oj.uz

Submission #31045

# Submission time Handle Problem Language Result Execution time Memory
31045 2017-08-06T02:35:50 Z 14kg Crayfish scrivener (IOI12_scrivener) C++11
60 / 100
 1000 ms 94868 KB 
struct TYPE{
	char num;
	int next_0, lev, next[21];
} d[1000001];
int n, p[21];

void Init(){
    p[0] = 1;
    for (int i = 1; i <= 20; i++) p[i] = p[i - 1] * 2;
}

void TypeLetter(char x){
    n++, d[n].next_0 = n, d[n].num = x, d[n].lev = d[n - 1].lev + 1;
	d[n].next[0] = d[n - 1].next_0;
	for (int i = 1; i <= 20; i++) d[n].next[i] = d[d[n].next[i - 1]].next[i - 1];
}

void UndoCommands(int x) {
    n++, d[n].next_0 = d[n - x - 1].next_0, d[n].lev = d[d[n].next_0].lev;
}

char f(int x, int y){
    if (x != d[x].next_0) return f(d[x].next_0, y);
	if (y == 0) return d[x].num;

	for (int i = 20; i >= 0; i--)
	if (p[i] <= y) return f(d[x].next[i], y - p[i]);
}
char GetLetter(int x){
    return f(n, d[n].lev - x - 1);
}

Compilation message

scrivener.cpp: In function 'char f(int, int)':
scrivener.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 94868 KB Output is correct
2 Correct 0 ms 94868 KB Output is correct
3 Correct 0 ms 94868 KB Output is correct
4 Correct 0 ms 94868 KB Output is correct
5 Correct 0 ms 94868 KB Output is correct
6 Correct 0 ms 94868 KB Output is correct
7 Correct 0 ms 94868 KB Output is correct
8 Correct 0 ms 94868 KB Output is correct
9 Correct 0 ms 94868 KB Output is correct
10 Correct 0 ms 94868 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 94868 KB Output is correct
2 Correct 0 ms 94868 KB Output is correct
3 Correct 0 ms 94868 KB Output is correct
4 Correct 0 ms 94868 KB Output is correct
5 Correct 0 ms 94868 KB Output is correct
6 Correct 0 ms 94868 KB Output is correct
7 Correct 0 ms 94868 KB Output is correct
8 Correct 0 ms 94868 KB Output is correct
9 Correct 0 ms 94868 KB Output is correct
10 Correct 0 ms 94868 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 94868 KB Output is correct
2 Correct 0 ms 94868 KB Output is correct
3 Correct 0 ms 94868 KB Output is correct
4 Correct 0 ms 94868 KB Output is correct
5 Correct 0 ms 94868 KB Output is correct
6 Correct 0 ms 94868 KB Output is correct
7 Correct 0 ms 94868 KB Output is correct
8 Correct 0 ms 94868 KB Output is correct
9 Correct 0 ms 94868 KB Output is correct
10 Correct 0 ms 94868 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 713 ms 94868 KB Output is correct
2 Correct 663 ms 94868 KB Output is correct
3 Correct 486 ms 94868 KB Output is correct
4 Correct 453 ms 94868 KB Output is correct
5 Correct 609 ms 94868 KB Output is correct
6 Correct 489 ms 94868 KB Output is correct
7 Correct 493 ms 94868 KB Output is correct
8 Correct 493 ms 94868 KB Output is correct
9 Correct 469 ms 94868 KB Output is correct
10 Correct 189 ms 94868 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 94868 KB Output is correct
2 Correct 976 ms 94868 KB Output is correct
3 Correct 403 ms 94868 KB Output is correct
4 Correct 426 ms 94868 KB Output is correct
5 Correct 423 ms 94868 KB Output is correct
6 Correct 556 ms 94868 KB Output is correct
7 Correct 496 ms 94868 KB Output is correct
8 Correct 706 ms 94868 KB Output is correct
9 Execution timed out 1000 ms 94868 KB Execution timed out
10 Halted 0 ms 0 KB -