# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914372 | VMaksimoski008 | Crayfish scrivener (IOI12_scrivener) | C++14 | 298 ms | 62448 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 21;
const int maxn = 1e6 + 5;
const double eps = 1e-9;
int up[maxn][LOG], id=0;
char s[maxn], len[maxn];
void Init() {
s[0] = ' ';
}
void TypeLetter(char ch) {
s[id++] = ch;
len[id] = len[id-1] + 1;
up[id][0] = id - 1;
for(int i=1; i<LOG; i++) up[id][i] = up[ up[id][i-1] ][i-1];
}
void UndoCommands(int U) {
int p = id - U;
s[id++] = s[p];
len[id] = len[p];
up[id][0] = up[p][0];
for(int i=1; i<LOG; i++) up[id][i] = up[ up[id][i-1] ][i-1];
}
char GetLetter(int p) {
int L = len[id]-p-1, pos = id;
for(int i=LOG-1; i>=0; i--)
if(L & (1 << i)) pos = up[pos][i];
return s[pos];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |