結果
問題 | No.2738 CPC To F |
ユーザー | iroha HEFFERNAN |
提出日時 | 2024-04-20 10:23:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 3,550 bytes |
コンパイル時間 | 2,011 ms |
コンパイル使用メモリ | 196,892 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-20 10:23:55 |
合計ジャッジ時間 | 2,824 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 12 ms
6,940 KB |
testcase_03 | AC | 11 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,940 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 3 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,944 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 3 ms
6,944 KB |
testcase_18 | AC | 3 ms
6,940 KB |
testcase_19 | AC | 3 ms
6,944 KB |
testcase_20 | AC | 3 ms
6,944 KB |
testcase_21 | AC | 3 ms
6,940 KB |
testcase_22 | AC | 3 ms
6,944 KB |
testcase_23 | AC | 3 ms
6,940 KB |
ソースコード
/*______ || | ||ACはこちらへ| || | || ̄ ̄ ̄ ̄ ̄ ̄ ∧_∧|| (`・ω・|| ( つ||0 uーu*/ #include <bits/stdc++.h> using namespace std; //output and debug template <class T> using V = vector<T>; template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << "P(" << p.first << ", " << p.second << ")"; } template <class T> ostream& operator<<(ostream& os,const V<T>& v) { os << "["; bool f = false; for (auto d : v) { if (f) os << ", "; f = true; os << d; } return os << "]"; } template <class T> ostream& operator<<(ostream& os,const set<T>& s) { os << "{"; bool f = false; for (auto d : s) { if (f) os << ", "; f = true; os << d; } return os << "}"; } template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << "{"; bool f = false; for (auto d : s) { if (f) os << ", "; f = true; os << d; } return os << "}"; } template <class T, class U> ostream& operator<<(ostream& os, const map<T, U>& s) { os << "{"; bool f = false; for (auto p : s) { if (f) os << ", "; f = true; os << p.first << ": " << p.second; } return os << "}"; } template<class T, class... Ts> void o(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } #ifdef LOCAL #define dbg(...) \ do { \ cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \ o(__VA_ARGS__); \ cerr << endl; \ } while (false); #else #define dbg(...) #endif // input template<class... T> void in(T&... a){ (cin >> ... >> a); } template<class T> void in(vector<T>& a){ for(auto&& i : a) in(i); } template<class T, class L> void in(pair<T, L>& p){ in(p.first); in(p.second); } template<class T> void in(T& a){ cin >> a; } #define rep1(n) for(ll i = 0; i < n; ++i) #define rep2(i, n) for(ll i = 0; i < n; ++i) #define rep3(i, j, n) for(ll i = j; i < n; ++i) #define overload3(a, b, c, e, ...) e #define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(ll i = n-1;i>=0;--i) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() using ll = long long ; using ld = long double; using pa = pair<ll,ll>; using t2 = tuple<ll,ll>; using tu = tuple<ll,ll,ll>; using vi = vector<ll>; using vs = vector<string>; using vp = vector<pa>; using vvi = vector<vi>; using vvp = vector<vp>; using vvvi = vector<vvi>; using v4 = vector<vvvi>; using vt = vector<tu>; const ll INF = (1ll << 29); const ll inf = INF*INF; const int dx[4]={1,-1,0,0}; const int dy[4]={0,0,1,-1}; void Yes(bool i = true){ return o(i?"Yes":"No"); } //reversed priority_queue template<class T> class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {}; const ll mod = 998244353; //const ll mod = 1000000007; int main(){ ll n; in(n); string s,t = "CPCTF",tt = "CPCTCPC"; in(s); ll cnt = 0; s += "aaaaaaaaaa"; rep(i,n){ bool ch = true; rep(j,5) if(t[j] != s[i+j]) ch = false; if(ch){ ++cnt; i += 4; }else{ ch = true; rep(j,tt.size()) if(tt[j] != s[i+j]) ch = false; if(ch){ ++cnt; i += tt.size()-1; } } } cout << cnt << endl; }