【强烈推荐】全力冲刺2023年信息学CSP-J/S之【降龙十八掌】：看大佬怎么对付爆零

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
...
 
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin >> N; p.resize(N);
	F0R(i,N) cin >> p[i].f >> p[i].s;
	sort(p.begin(),p.end());
	F0R(i,p.size()) solve(i);
	cout << ans;
}
 
// read!
// ll vs. int!

// read!
// ll vs. int!

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
...
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n; a.resize(n);
    F0R(i,n) cin >> a[i];
    ...
    process(st,n-1);
    cout << ans;
}
 
// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)

// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef string str;
 
int main() {
	setIO(); string S; int K; re(S,K); 
	string T = S+S+S;
	vl ans(3);
    ...
	// ps(ans);
	// ps(ans);
	ps(ret);
	// you should actually read the stuff at the bottom
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), set tle
	* do smth instead of nothing and stay organized
*/

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), set tle
	* do smth instead of nothing and stay organized
*/

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!
 
using pi = pair<int,int>;
 
str S;
 
void solve(int tc) {
	re(S);
	int ind = 0;
	while (ind < sz(S) && S[ind] == 'a') ind ++;
	if (ind == sz(S)) {
		ps(-1);
		return;
	}
	int ans = 0;
	while (ind > 1) {
		swap(S[ind],S[ind-1]), ans ++;
		ind --;
	}
	if ("atcoder" < S) ps(ans);
	else ps(ans+1);
}
 
int main() {
	setIO();
	int TC; re(TC);
	FOR(i,1,TC+1) solve(i);
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

/*
 
  0. Enough array size? Enough array size? Enough array size? Integer overflow?
 
   
  1. Think TWICE, Code ONCE!
 
  Are there any counterexamples to your algo?
  
  2. Be careful about the BOUNDARIES!
 
  N=1? P=1? Something about 0?
 
 
  3. Do not make STUPID MISTAKES!
 
  Time complexity? Memory usage? Precision error?
 
*/