# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095203 | phong | 스탬프 수집 (JOI16_ho_t2) | C++17 | 2 ms | 2644 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define int long long
const int nmax = 2e4 + 5, N = 2e6;
const ll oo = 1e12 + 5, base = 3001;
const int lg = 17,mod = 998244353;
#define pii pair<int, int>
#define fi first
#define se second
#define endl "\n"
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << "\n";
using namespace std;
int n;
string s;
int pre[nmax][5], suf[nmax][5];
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// freopen("FRIENDS.inp", "r", stdin);
// freopen("FRIENDS.out", "w", stdout);
cin >> n;
cin >> s;
s = ' ' + s;
int cur = 0;
for(int i = 1; i <= n; ++i){
pre[i][0] = pre[i - 1][0] + (s[i] == 'J');
pre[i][1] = pre[i - 1][1] + (s[i] == 'O');
pre[i][2] = pre[i - 1][2] + (s[i] == 'I');
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |