oj.uz

Submission #31197

# Submission time Handle Problem Language Result Execution time Memory
31197 2017-08-13T07:46:34 Z pasa3232 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 699 ms 128132 KB 
#include<bits/stdc++.h>
using namespace std;

int now, A[1000010], d[30][1000010], lev[1000010];
char L[1000010];

char last;

void Init() {
    for(int i=0; i<30; i++) for(int j=0; j<1000010; j++) d[i][j]=-1;
}

void TypeLetter(char La) {
    A[++now]=now;
    lev[now]=lev[A[now-1]]+1;
    L[now]=La;
    d[0][now]=A[now-1];
    for(int i=1; d[i-1][d[i-1][now]]!=-1; i++) d[i][now]=d[i-1][d[i-1][now]];
}

void UndoCommands(int U) {
    A[++now]=A[now-U-1];
}

char GetLetter(int P) {
    int b=P;
    b=lev[A[now]]-b-1;
    int rev=A[now];
    while(b){
        int i, num;
        for(i=0, num=1; num<=b; i++, num*=2);
        i--;
        b-=(num/2);
        rev=d[i][rev];
    }
    return L[rev];

}

Compilation message

scrivener.cpp: In function 'void TypeLetter(char)':
scrivener.cpp:14:17: warning: operation on 'now' may be undefined [-Wsequence-point]
     A[++now]=now;
                 ^
scrivener.cpp: In function 'void UndoCommands(int)':
scrivener.cpp:22:24: warning: operation on 'now' may be undefined [-Wsequence-point]
     A[++now]=A[now-U-1];
                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 128132 KB Output is correct
2 Correct 33 ms 128132 KB Output is correct
3 Correct 33 ms 128132 KB Output is correct
4 Correct 26 ms 128132 KB Output is correct
5 Correct 19 ms 128132 KB Output is correct
6 Correct 23 ms 128132 KB Output is correct
7 Correct 43 ms 128132 KB Output is correct
8 Correct 36 ms 128132 KB Output is correct
9 Correct 9 ms 128132 KB Output is correct
10 Correct 33 ms 128132 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 128132 KB Output is correct
2 Correct 26 ms 128132 KB Output is correct
3 Correct 16 ms 128132 KB Output is correct
4 Correct 26 ms 128132 KB Output is correct
5 Correct 26 ms 128132 KB Output is correct
6 Correct 9 ms 128132 KB Output is correct
7 Correct 16 ms 128132 KB Output is correct
8 Correct 19 ms 128132 KB Output is correct
9 Correct 16 ms 128132 KB Output is correct
10 Correct 23 ms 128132 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 128132 KB Output is correct
2 Correct 26 ms 128132 KB Output is correct
3 Correct 36 ms 128132 KB Output is correct
4 Correct 23 ms 128132 KB Output is correct
5 Correct 33 ms 128132 KB Output is correct
6 Correct 26 ms 128132 KB Output is correct
7 Correct 39 ms 128132 KB Output is correct
8 Correct 16 ms 128132 KB Output is correct
9 Correct 19 ms 128132 KB Output is correct
10 Correct 6 ms 128132 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 128132 KB Output is correct
2 Correct 479 ms 128132 KB Output is correct
3 Correct 413 ms 128132 KB Output is correct
4 Correct 463 ms 128132 KB Output is correct
5 Correct 503 ms 128132 KB Output is correct
6 Correct 419 ms 128132 KB Output is correct
7 Correct 543 ms 128132 KB Output is correct
8 Correct 473 ms 128132 KB Output is correct
9 Correct 483 ms 128132 KB Output is correct
10 Correct 223 ms 128132 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 609 ms 128132 KB Output is correct
2 Correct 689 ms 128132 KB Output is correct
3 Correct 493 ms 128132 KB Output is correct
4 Correct 483 ms 128132 KB Output is correct
5 Correct 396 ms 128132 KB Output is correct
6 Correct 443 ms 128132 KB Output is correct
7 Correct 456 ms 128132 KB Output is correct
8 Correct 699 ms 128132 KB Output is correct
9 Correct 696 ms 128132 KB Output is correct
10 Correct 256 ms 128132 KB Output is correct