oj.uz

Submission #120485

# Submission time Handle Problem Language Result Execution time Memory
120485 2019-06-24T16:15:18 Z KieranHorgan Crayfish scrivener (IOI12_scrivener) C++17
0 / 100
 1000 ms 64520 KB 
#include <bits/stdc++.h>
using namespace std;
int a[1000005][23], curStep=0, node, i;
void Init() {}
void TypeLetter(char L) {
	a[++curStep][21] = L;
	a[curStep][22] = a[curStep-1][22]+1;
	a[curStep][0] = curStep-1;
	for(i = 1; 1<<i <= a[curStep][22]; i++)
		a[curStep][i] = a[a[curStep][i-1]][i-1];
}
void UndoCommands(int U) { copy(a[curStep-1-U], a[curStep-1-U]+23, a[++curStep]); }
char GetLetter(int P) {
  for(i = 21, node = curStep; a[node][22] != P+1;)
  		node = a[node][31-__builtin_clz(a[node][22]-P)];
  return a[node][21];
}

Compilation message

scrivener.cpp: In function 'void UndoCommands(int)':
scrivener.cpp:12:70: warning: operation on 'curStep' may be undefined [-Wsequence-point]
 void UndoCommands(int U) { copy(a[curStep-1-U], a[curStep-1-U]+23, a[++curStep]); }
                                                                      ^~~~~~~~~
scrivener.cpp:12:70: warning: operation on 'curStep' may be undefined [-Wsequence-point]

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1064 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1057 ms 64520 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 3968 KB Time limit exceeded
2 Halted 0 ms 0 KB -