# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213410 | 2020-03-25T18:09:59 Z | Nucleist | Crayfish scrivener (IOI12_scrivener) | C++14 | 369 ms | 262144 KB |
#include <bits/stdc++.h> using namespace std; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") #define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define debug(x) cerr << " - " << #x << ": " << x << endl; #define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl; #define all(x) (x).begin(),(x).end() #define sz(x) (ll)x.size() #define ll long long #define INF 1000000000 #define MOD 1000000007 #define pb push_back #define ve vector<ll> #define dos pair<ll,ll> #define vedos vector<dos> #define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) struct greateri { template<class T> bool operator()(T const &a, T const &b) const { return a > b; } }; int cur; struct node { char let; int s; node *par[25]; node(){ } node( char let ) : let( let ){ for (int i = 0; i <= 19; ++i) { par[i]=nullptr; } } }; node* sol[1000101]; void Init() { cur = 0; sol[0] = nullptr; } void TypeLetter(char k) { ++cur; sol[cur] = new node(k); if(sol[cur-1])sol[cur]->s=((sol[cur-1]->s)+1); else sol[cur]->s=1; sol[cur]->par[0]=sol[cur-1]; for (int i = 1; i <= 19; ++i) { if( sol[cur]->par[i-1] ) sol[cur]->par[i]=sol[cur]->par[i-1]->par[i-1]; } } void UndoCommands(int u) { sol[cur++]=sol[cur-u]; } char GetLetter(int pos) { int posi= sol[cur]->s - pos-1; node *nowi = sol[cur]; for (int i = 19; i >= 0; --i) { if(posi >> i & 1)nowi=nowi->par[i]; } return nowi->let; } //code the AC sol ! // BS/queue/map
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 256 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 5 ms | 512 KB | Output is correct |
6 | Correct | 5 ms | 384 KB | Output is correct |
7 | Correct | 5 ms | 384 KB | Output is correct |
8 | Correct | 5 ms | 256 KB | Output is correct |
9 | Correct | 5 ms | 384 KB | Output is correct |
10 | Correct | 5 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 369 ms | 262144 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 30 ms | 18944 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |