제출 #483185

#제출 시각아이디문제언어결과실행 시간메모리
483185abc864197532크레이피쉬 글쓰는 기계 (IOI12_scrivener)C++17
34 / 100
130 ms262148 KiB
#include <bits/stdc++.h> using namespace std; #define lli long long int #define mp make_pair #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define X first #define Y second #define pii pair<int, int> void abc() {cout << endl;} template <typename T, typename ...U> void abc(T i, U ...j) { cout << i << ' ', abc(j...); } template <typename T> void printv(T l, T r) { for (; l != r; ++l) cout << *l << " \n"[l + 1 == r]; } #ifdef Doludu #define test(args...) abc("[" + string(#args) + "]", args); #include "grader_C.cpp" #else #define test(args...) void(0); #endif const int N = 1000000; vector <string> cur; void Init() { cur.pb(""); } void TypeLetter(char L) { string t = cur.back(); t += L; cur.pb(t); } void UndoCommands(int U) { cur.pb(cur[cur.size() - U - 1]); } char GetLetter(int P) { return cur.back()[P]; } /* 14 T a T b P 1 T d U 2 U 1 P 2 T e U 1 U 5 T c P 2 U 2 P 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...