제출 #1106877

#제출 시각아이디문제언어결과실행 시간메모리
1106877rahidilbayramli크레이피쉬 글쓰는 기계 (IOI12_scrivener)C++17
34 / 100
183 ms262144 KiB
#pragma GCC optimize("-O3") #include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #define ll long long #define ld long double #define vl vector<ll> #define vi vector<int> #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define f first #define s second #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define p_b pop_back using namespace std; using namespace __gnu_pbds; typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); char last; string s = ""; vector<string>vect; void Init() { vect.pb(s); } void TypeLetter(char L) { s += L; vect.pb(s); last = L; } void UndoCommands(int U) { int sz = (int)(vect.size()); s = vect[sz - 1 - U]; vect.pb(s); } char GetLetter(int P) { return s[P]; }
#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...