# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201348 | Mamnoon_Siam | JJOOII 2 (JOI20_ho_t2) | C++17 | 27 ms | 5944 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>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int maxn = 2e5 + 5;
int n, k;
int cnt[3][maxn];
int to[3][maxn];
int a[maxn];
int main(int argc, char const *argv[])
{
#ifdef LOCAL
freopen("in", "r", stdin);
#endif
cin >> n >> k;
{
string s; cin >> s;
for(int i = 1; i <= n; i++) {
if(s[i-1] == 'J') a[i] = 0;
if(s[i-1] == 'O') a[i] = 1;
if(s[i-1] == 'I') a[i] = 2;
}
}
for(int i = 1; i <= n; i++) {
cnt[a[i]][i]++;
cnt[0][i] += cnt[0][i-1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |