#798302 (C++14) No.2073 Concon Substrings (Swap Version)

• 問題: No.2073 Concon Substrings (Swap Version)
• 提出日時: 2022-09-16 22:47:33
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,756 bytes
• コンパイル時間: 1,196 ms
• コンパイル使用メモリ: 99,568 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-21 22:06:56
• 合計ジャッジ時間: 2,522 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
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	17 ms; 5,248 KB
testcase_06	AC	17 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	11 ms; 5,248 KB
testcase_09	AC	13 ms; 5,248 KB
testcase_10	AC	21 ms; 5,248 KB
testcase_11	AC	20 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	3 ms; 5,248 KB
testcase_14	AC	18 ms; 5,248 KB
testcase_15	AC	7 ms; 5,248 KB
testcase_16	AC	16 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	3 ms; 5,248 KB
testcase_19	AC	15 ms; 5,248 KB
testcase_20	AC	13 ms; 5,248 KB
testcase_21	AC	11 ms; 5,248 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-

ソースコード

#include <cstdio>
#include <cstdint>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cassert>
using namespace std;
namespace atcoder{};using namespace atcoder;

using ull = uint64_t;
using ll = int64_t;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using ld = long double;
using P = pair<ll,ll>;
using G = vector<vector<int>>;

#ifdef MYDEBUG
#define LO(...) fprintf(stderr, __VA_ARGS__)
#define debug(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" << endl
#else
#define LO(...) (void)0
#define debug(x) (void)0
#endif

#define reps(i,a,n) for(ll i##_len = (ll)(n), i = (a); i < i##_len; ++i)
#define rep(i,n) reps(i,0,n)
#define rrep(i,n) reps(i,1,n+1)
#define repd(i,n) for(ll i=n-1;i>=0;i--)
#define rrepd(i,n) for(ll i=n;i>=1;i--)

#define inp(i) ll i; cin >> i;
#define inps(s) string s; cin >> s;
#define inpp(p) cin >> (p).first >> (p).second;
#define inpv(v,N) vll v(N);rep(i,N)cin>>v[i];
#define inpg(g,N,M) g.resize(N);rep(i,M){inp(a);inp(b);a--,b--;g[a].push_back(b);g[b].push_back(a);}
#define all(v) begin(v),end(v)
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(bool) if(bool){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl

#define SP cout << " ";
#define ENDL cout << "\n";
#define outp(i) cout << (i);
#define outps(i) cout << (i) << " ";
#define outpl(i) cout << (i) << "\n";
#define setfp() cout << fixed << setprecision(16)

template<typename C>
void outpv(C &v){for(auto &&e:v){cout << e;if(&e != &v.back()) cout << ' ';}cout << "\n";}

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

inline ll lg(ll __n) { return sizeof(ll) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); }

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main(){
    inp(N);
    inps(S);
    ll n = S.size();

    ll cou[3][3] = {};
    rep(i,n){
        if(S[i] == 'c'){
            cou[i%3][0]++;
        }
        if(S[i] == 'o'){
            cou[i%3][1]++;
        }
        if(S[i] == 'n'){
            cou[i%3][2]++;
        }
    }
    outpl(min({cou[0][0],cou[1][1],cou[2][2]}) + 
            min({cou[0][1],cou[1][2],cou[2][0]})+
            min({cou[0][2],cou[1][0],cou[2][1]}));

    return 0;
}