Submission #61827

# Submission time Handle Problem Language Result Execution time Memory
61827 2018-07-26T18:39:38 Z theknife2001 Crayfish scrivener (IOI12_scrivener) C++17
0 / 100
1000 ms 3104 KB
#include <bits/stdc++.h>
#define ii pair < char , char >
#define fi first
#define se second


using namespace std;
const int N=1e6+5;
ii a[N];
char s[N];
bool q=0;
int k=0;


void Init() {}

void TypeLetter(char L) {
    a[k].fi='T';
    a[k].se=L;
    k++;
}

void UndoCommands(int U) {
    a[k].fi='F';
    a[k].se=U;
    k++;
}


char GetLetter(int P) {
    if(!q)
    {
        int j=0;
        k--;
        while(k>=0)
        {
            if(a[k].fi=='T')
            {
                s[j]=a[k].se;
                j++;
            }
            else
            {
                k-=a[k].se;
            }
            k--;
        }
        reverse(s,s+j);
    }
    q=0;
    return s[P];
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 432 KB Output is correct
2 Incorrect 3 ms 432 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1404 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 466 ms 3104 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 3104 KB Time limit exceeded
2 Halted 0 ms 0 KB -