제출 #757176

#제출 시각아이디문제언어결과실행 시간메모리
757176Desh03크레이피쉬 글쓰는 기계 (IOI12_scrivener)C++17
34 / 100
497 ms262144 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; struct node { int val; node *left, *right; node() : left(NULL), right(NULL) { }; node(const int &x) : val(x), left(NULL), right(NULL) { }; node(node* l, node* r) : left(l), right(r) { }; }; struct Persistent_Segment_Tree { node *root; Persistent_Segment_Tree() : root(NULL) { }; node* upd(node* v, int l, int r, int u, int x) { if (l == r) return new node(x); if (!v) v = new node; int m = l + r >> 1; if (u <= m) return new node(upd(v->left, l, m, u, x), v->right); else return new node(v->left, upd(v->right, m + 1, r, u, x)); } int qry(node* &v, int l, int r, int u) { if (l == r) return v->val; int m = l + r >> 1; if (u <= m) return qry(v->left, l, m, u); return qry(v->right, m + 1, r, u); } } st[N]; int cur[N]; int t; void Init() { } void TypeLetter(char L) { st[t].root = st[t + 1].root = st[t].upd(st[t].root, 0, N - 1, cur[t]++, L - 'a'); cur[t + 1] = cur[t]; t++; } void UndoCommands(int U) { cur[t] = cur[t + 1] = cur[t - U - 1]; st[t].root = st[t + 1].root = st[t - U - 1].root; t++; } char GetLetter(int P) { return 'a' + st[t].qry(st[t].root, 0, N - 1, P); }

컴파일 시 표준 에러 (stderr) 메시지

scrivener.cpp: In member function 'node* Persistent_Segment_Tree::upd(node*, int, int, int, int)':
scrivener.cpp:20:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |         int m = l + r >> 1;
      |                 ~~^~~
scrivener.cpp: In member function 'int Persistent_Segment_Tree::qry(node*&, int, int, int)':
scrivener.cpp:26:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |         int m = l + r >> 1;
      |                 ~~^~~
#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...