# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696300 | 2023-02-06T07:39:12 Z | Dan4Life | Inside information (BOI21_servers) | C++17 | 51 ms | 3936 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = (int)130000; int n, k, pos[mxN]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; int sz = 1; for(int _ = 0; _ < n+k-1; _++){ char t; int x, y; cin >> t >> x; if(t=='S'){ cin >> y; if(x>y)swap(x,y); pos[y]=sz++; } else if(t=='Q'){ cin >> y; if(x==y) cout << "yes"; else if(x==1) cout << (pos[y]?"yes":"no"); else if(y==1) cout << (pos[x]?"yes":"no"); else cout << (pos[x]>pos[y] and pos[x] and pos[y]?"yes":"no"); } else{ int cnt = 0; if(x==1) cout << sz; else if(!pos[x]) cout << 1; else cout << sz-pos[x]+1; } if(t!='S') cout << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 596 KB | Output is correct |
2 | Correct | 47 ms | 1088 KB | Output is correct |
3 | Correct | 51 ms | 1184 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 596 KB | Output is correct |
2 | Correct | 47 ms | 1088 KB | Output is correct |
3 | Correct | 51 ms | 1184 KB | Output is correct |
4 | Correct | 20 ms | 596 KB | Output is correct |
5 | Correct | 49 ms | 3936 KB | Output is correct |
6 | Correct | 38 ms | 3064 KB | Output is correct |
7 | Correct | 40 ms | 3244 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 608 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 608 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 664 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 664 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 724 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 724 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 660 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 23 ms | 660 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |