Submission #548712

#TimeUsernameProblemLanguageResultExecution timeMemory
548712ikaurovCrayfish scrivener (IOI12_scrivener)C++17
0 / 100
208 ms62744 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define all(arr) (arr).begin(), (arr).end() #define ll long long #define ld long double #define pb push_back #define sz(x) int((x).size()) #define fi first #define se second #define endl '\n' const int N = 1e6 + 20, LOG = 20; int par[N][LOG], cur[N]; int dp[N]; string s = "."; void Init(){ cur[0] = LOG; } void TypeLetter(char c){ int idx = sz(s); dp[idx] = dp[idx - 1] + 1; s.pb(c); par[idx][0] = idx - 1; cur[idx] = 1; } void UndoCommands(int x){ int idx = sz(s); dp[idx] = dp[max(idx - 1 - x, 0)]; s.pb('#'); par[idx][0] = max(idx - 1 - x, 0); cur[idx] = 1; } void calc(int idx, int i){ while (cur[idx] <= i) par[idx][cur[idx]] = par[par[idx][cur[idx] - 1]][cur[idx] - 1], cur[idx]++; } char GetLetter(int pos){ int idx = sz(s) - 1; for (int i = LOG - 1; i >= 0; i--){ calc(idx, i); if (dp[par[idx][i]] > pos) idx = par[idx][i]; } return s[idx]; } // signed main(){ // ios_base::sync_with_stdio(0); // cin.tie(0); // // cout.precision(20); // Init(); // TypeLetter('a'); // TypeLetter('b'); // GetLetter(1); // TypeLetter('d'); // UndoCommands(2); // UndoCommands(1); // GetLetter(2); // TypeLetter('e'); // UndoCommands(1); // UndoCommands(5); // TypeLetter('c'); // GetLetter(2); // UndoCommands(2); // GetLetter(2); // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...