結果
問題 | No.2073 Concon Substrings (Swap Version) |
ユーザー | woodywoody |
提出日時 | 2022-09-16 22:55:21 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,773 bytes |
コンパイル時間 | 4,009 ms |
コンパイル使用メモリ | 240,556 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-12-21 22:16:14 |
合計ジャッジ時間 | 5,757 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 23 ms
5,248 KB |
testcase_06 | AC | 22 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 14 ms
5,248 KB |
testcase_09 | AC | 17 ms
5,248 KB |
testcase_10 | AC | 25 ms
5,248 KB |
testcase_11 | AC | 25 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 4 ms
5,248 KB |
testcase_14 | AC | 22 ms
5,248 KB |
testcase_15 | AC | 9 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 19 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 13 ms
5,248 KB |
testcase_26 | AC | 20 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 17 ms
5,248 KB |
testcase_29 | AC | 6 ms
5,248 KB |
testcase_30 | AC | 13 ms
5,248 KB |
testcase_31 | AC | 7 ms
5,248 KB |
testcase_32 | AC | 4 ms
5,248 KB |
testcase_33 | AC | 6 ms
5,248 KB |
testcase_34 | AC | 4 ms
5,248 KB |
testcase_35 | AC | 11 ms
5,248 KB |
testcase_36 | AC | 5 ms
5,248 KB |
testcase_37 | AC | 11 ms
5,248 KB |
testcase_38 | AC | 4 ms
5,248 KB |
testcase_39 | AC | 11 ms
5,248 KB |
testcase_40 | AC | 10 ms
5,248 KB |
testcase_41 | AC | 11 ms
5,248 KB |
ソースコード
// #define _GLIBCXX_DEBUG #include<bits/stdc++.h> #include<atcoder/all> #define rep(i,b) for(int i=0;i<b;i++) #define rrep(i,b) for(int i=b-1;i>=0;i--) #define rep1(i,b) for(int i=1;i<b;i++) #define repx(i,x,b) for(int i=x;i<b;i++) #define rrepx(i,x,b) for(int i=b-1;i>=x;i--) #define fore(i,a) for(auto i:a) #define fore1(i,a) for(auto &i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>; template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define debp(p) cout << p.fi << " " << p.se << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define show(x) cerr<<#x<<" = "<<x<<endl; #define showdeb(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl; #define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define showv2(v) fore(vy , v) cout << vy << "\n"; #define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define showvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>; using tp = tuple<int ,int ,int>; using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>; using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>; using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>; using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>; using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vector<mint>>; vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<<endl;} #define yesr { cout <<"Yes"<<endl; return 0;} #define no {cout <<"No"<<endl;} #define nor { cout <<"No"<<endl; return 0;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; int main(){ int n; cin>>n; string s; cin>>s; vvl cnt(3,vl(3)); vl cnt2(3); map<char,int> mp; mp['c'] = 0; mp['o'] = 1; mp['n'] = 2; rep(i,3*n){ int k = i % 3; if (mp.count(s[i])){ cnt[k][mp[s[i]]]++; }else{ cnt2[k]++; } } // rep(i,3){ // show(i); // showv(cnt[i]); // } ll ans = 0; rep(k,2){ ll mx = 0; rep(i,3){ ll mn = LINF; rep(j,3){ chmin(mn , cnt[j][(j+i+k)%3]); } mx += mn; } chmax(ans,mx); } bool ok = true; rep(i,3){ ll p = cnt[0][i]; rep(j,3) if (p != cnt[j][(i+j)%3]) ok = false; } if (ok) ans--; // ll now = 0; // ll tmp = min({cnt[0][0] , cnt[1][1] , cnt[2][2]}); // ans += tmp; // now += 3*tmp + 1; // if (!(cnt2[0] >0 || tmp < cnt[0][0])){ // ll tmp2 = min({cnt[0][2] , cnt[1][0] , cnt[2][1]}); // if (cnt[0][2] > tmp2) cnt[0][2]--; // else cnt[0][1]--; // } // tmp = min({cnt[0][2] , cnt[1][0] , cnt[2][1]}); // ans += tmp; // now += 3*tmp + 1; // if (cnt2[1] == 0){ // ll tmp2 = min({cnt[0][0] , cnt[1][1] , cnt[2][2]}); // if (tmp == cnt[1][0] && tmp2 == cnt[1][1]) cnt[1][2]--; // } // // showdeb(ans,tmp); // tmp = min({cnt[0][1] , cnt[1][2] , cnt[2][0] , (3*n-now)/3}); // ans += tmp; out; // 消せ!!!!!! #define _GLIBCXX_DEBUG // priority_queue でしぬ return 0; }