# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124836 | 2019-07-04T03:44:01 Z | nxteru | Crayfish scrivener (IOI12_scrivener) | C++14 | 468 ms | 63864 KB |
#include <bits/stdc++.h> using namespace std; int le[1000005],n,k,par[20][1000005],dp[1000005]; char re[1000005]; void Init(void){}; void TypeLetter(char c){ int v=le[n],x=c-'a'; k++; re[k]=c; par[0][k]=v; dp[k]=dp[v]+1; for(int i=0;i<19;i++)par[i+1][k]=par[i][par[i][k]]; n++; le[n]=k; } void UndoCommands(int x){ le[n+1]=le[n-x]; n++; } char GetLetter(int x){ x++; int v=le[n]; for(int i=0;i<20;i++)if((dp[v]-x)>>i&1)v=par[i][v]; return re[v]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Correct | 2 ms | 504 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 2 ms | 504 KB | Output is correct |
7 | Correct | 2 ms | 504 KB | Output is correct |
8 | Correct | 2 ms | 504 KB | Output is correct |
9 | Correct | 2 ms | 504 KB | Output is correct |
10 | Correct | 2 ms | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Correct | 2 ms | 504 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 2 ms | 504 KB | Output is correct |
7 | Correct | 2 ms | 504 KB | Output is correct |
8 | Correct | 2 ms | 476 KB | Output is correct |
9 | Correct | 2 ms | 504 KB | Output is correct |
10 | Correct | 2 ms | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 636 KB | Output is correct |
3 | Correct | 3 ms | 632 KB | Output is correct |
4 | Correct | 3 ms | 760 KB | Output is correct |
5 | Correct | 3 ms | 632 KB | Output is correct |
6 | Correct | 4 ms | 888 KB | Output is correct |
7 | Correct | 3 ms | 888 KB | Output is correct |
8 | Correct | 3 ms | 760 KB | Output is correct |
9 | Correct | 3 ms | 760 KB | Output is correct |
10 | Correct | 3 ms | 632 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 314 ms | 51688 KB | Output is correct |
2 | Correct | 340 ms | 57996 KB | Output is correct |
3 | Correct | 330 ms | 56824 KB | Output is correct |
4 | Correct | 325 ms | 45688 KB | Output is correct |
5 | Correct | 353 ms | 49908 KB | Output is correct |
6 | Correct | 282 ms | 62968 KB | Output is correct |
7 | Correct | 334 ms | 31224 KB | Output is correct |
8 | Correct | 307 ms | 46588 KB | Output is correct |
9 | Correct | 373 ms | 63864 KB | Output is correct |
10 | Correct | 218 ms | 47224 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 398 ms | 44092 KB | Output is correct |
2 | Correct | 468 ms | 39800 KB | Output is correct |
3 | Correct | 330 ms | 43768 KB | Output is correct |
4 | Correct | 364 ms | 32760 KB | Output is correct |
5 | Correct | 273 ms | 48108 KB | Output is correct |
6 | Correct | 323 ms | 45176 KB | Output is correct |
7 | Correct | 269 ms | 48120 KB | Output is correct |
8 | Correct | 444 ms | 23544 KB | Output is correct |
9 | Correct | 464 ms | 41208 KB | Output is correct |
10 | Correct | 217 ms | 46712 KB | Output is correct |