Submit Info #13808

Problem Lang User Status Time Memory
Persistent Queue cpp Benq AC 204 ms 46.17 MiB

ケース詳細
Name Status Time Memory
ephemeral_00 AC 130 ms 46.17 MiB
example_00 AC 9 ms 12.17 MiB
half_rot_killer_00 AC 156 ms 41.60 MiB
random_00 AC 168 ms 22.94 MiB
random_01 AC 204 ms 24.92 MiB
random_02 AC 26 ms 13.66 MiB
random_2_00 AC 167 ms 22.34 MiB
random_2_01 AC 204 ms 24.35 MiB
random_2_02 AC 25 ms 13.55 MiB
random_3_00 AC 133 ms 27.34 MiB
random_3_01 AC 153 ms 30.24 MiB
random_3_02 AC 23 ms 14.17 MiB
two_stacks_killer_00 AC 162 ms 43.04 MiB

#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef string str; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef pair<db,db> pd; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<db> vd; typedef vector<str> vs; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<pd> vpd; #define mp make_pair #define f first #define s second #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) (x).rbegin(), (x).rend() #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const int MX = 5e5+5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } constexpr int pct(int x) { return __builtin_popcount(x); } constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) constexpr int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 int fstTrue(function<bool(int)> f, int lo, int hi) { hi ++; assert(lo <= hi); // assuming f is increasing while (lo < hi) { // find first index such that f is true int mid = (lo+hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; } template<class T> void remDup(vector<T>& v) { sort(all(v)); v.erase(unique(all(v)),end(v)); } // INPUT template<class A> void re(complex<A>& c); template<class A, class B> void re(pair<A,B>& p); template<class A> void re(vector<A>& v); template<class A, size_t SZ> void re(array<A,SZ>& a); template<class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); } template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; } template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); } template<class A> void re(vector<A>& x) { trav(a,x) re(a); } template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); } // TO_STRING #define ts to_string str ts(char c) { return str(1,c); } str ts(bool b) { return b ? "true" : "false"; } str ts(const char* s) { return (str)s; } str ts(str s) { return s; } template<class A> str ts(complex<A> c) { stringstream ss; ss << c; return ss.str(); } str ts(vector<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]); res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } template<class A, class B> str ts(pair<A,B> p); template<class T> str ts(T v) { // containers with begin(), end() bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; } template<class A, class B> str ts(pair<A,B> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; } // OUTPUT template<class A> void pr(A x) { cout << ts(x); } template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); } void ps() { pr("\n"); } // print w/ spaces template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); } // DEBUG void DBG() { cerr << "]" << endl; } template<class H, class... T> void DBG(H h, T... t) { cerr << ts(h); if (sizeof...(t)) cerr << ", "; DBG(t...); } #ifdef LOCAL // compile with -DLOCAL #define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #else #define dbg(...) 0 #endif // FILE I/O void setIn(string s) { freopen(s.c_str(),"r",stdin); } void setOut(string s) { freopen(s.c_str(),"w",stdout); } void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); } void setIO(string s = "") { unsyncIO(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO } deque<int> cur; vi child[MX]; int op[MX]; vi ans; void dfs(int x) { dbg("DFS",x,op[x]); int rem = -1; if (op[x] == -1) { rem = cur.front(), cur.pop_front(); ans[x] = rem; } else cur.pb(op[x]); trav(t,child[x]) dfs(t); if (op[x] == -1) cur.push_front(rem); else cur.pop_back(); } int main() { setIO(); int Q; re(Q); vi ori; F0R(i,Q) { int z; re(z); if (z == 0) { int t,x; re(t,x); dbg(i,t); if (t == -1) ori.pb(i); else child[t].pb(i); op[i] = x; } else { int t; re(t); if (t == -1) ori.pb(i); else child[t].pb(i); op[i] = -1; } } ans = vi(Q,-1); trav(t,ori) dfs(t); F0R(i,Q) if (ans[i] != -1) ps(ans[i]); // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN */