# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
120755 | 2019-06-25T11:43:55 Z | MAMBA | 크레이피쉬 글쓰는 기계 (IOI12_scrivener) | C++14 | 334 ms | 262144 KB |
#include <bits/stdc++.h> using namespace std; #define rep(i, j, k) for (int i = j; i < int(k); i++) constexpr int N = 1e6 + 10; struct node { node* par[20]; char c = '\0'; int deep = -1; node() { fill(par, par + 20, this); } node(char c_, node* p) { par[0] = p, c = c_; deep = p->deep + 1; rep(i, 1, 20) par[i] = par[i - 1]->par[i - 1]; } } state[N]; int now; void Init() { now = 0; } void TypeLetter(char L) { state[++now] = node(L, &state[now - 1]); } void UndoCommands(int U) { state[++now] = state[now - U - 1]; } char GetLetter(int P) { int goUp = state[now].deep - P; node* me = &state[now]; rep(i, 0, 20) if (goUp >> i & 1) me = me->par[i]; return me->c; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 334 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 332 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 325 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 330 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 324 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |