# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201034 | HellAngel | JJOOII 2 (JOI20_ho_t2) | C++14 | 94 ms | 48516 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;
const int maxn = 200007;
string s;
int nxt[20][maxn][3], a[maxn], n, k, ans;
void Jump(int &pos, int type, int cnt)
{
for(int i = 19; i >= 0; i--)
{
if(cnt >= (1 << i))
{
cnt -= (1 << i);
pos = nxt[i][pos][type];
}
}
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin);
cin >> n >> k >> s;
ans = n + 1;
for(int i = 1; i <= n; i++)
{
if(s[i - 1] == 'J') a[i] = 0;
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... |