# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797460 | 2023-07-29T12:10:53 Z | kingfran1907 | Segments (IZhO18_segments) | C++14 | 5000 ms | 11388 KB |
#include <bits/stdc++.h> #define X first #define Y second using namespace std; const int maxn = 2e5+10; int n, t; set< int > s, cur; int l[maxn], r[maxn]; int inter(pair<int, int> a, pair<int, int> b) { if (a.X > b.X) swap(a, b); return min(a.Y, b.Y) - b.X + 1; } int main() { scanf("%d%d", &n, &t); for (int i = 1; i <= n + 2; i++) s.insert(i); int lastans = 0; int ptr = 0; while (n--) { int type; scanf("%d", &type); if (type == 1) { int ind = ++ptr; int l, r; scanf("%d%d", &l, &r); l = l ^ (t * lastans); r = r ^ (t * lastans); if (l > r) swap(l, r); ::l[ind] = l, ::r[ind] = r; cur.insert(ind); } else if (type == 2) { int x; scanf("%d", &x); cur.erase(x); s.insert(x); } else { int l, r, k; scanf("%d%d%d", &l, &r, &k); l = l ^ (t * lastans); r = r ^ (t * lastans); if (l > r) swap(l, r); lastans = 0; for (int tren : cur) { lastans += (inter({l, r}, {::l[tren], ::r[tren]}) >= k); } printf("%d\n", lastans); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 3 ms | 468 KB | Output is correct |
4 | Correct | 3 ms | 584 KB | Output is correct |
5 | Correct | 30 ms | 876 KB | Output is correct |
6 | Correct | 37 ms | 852 KB | Output is correct |
7 | Correct | 10 ms | 596 KB | Output is correct |
8 | Correct | 20 ms | 828 KB | Output is correct |
9 | Correct | 18 ms | 724 KB | Output is correct |
10 | Correct | 8 ms | 852 KB | Output is correct |
11 | Correct | 51 ms | 820 KB | Output is correct |
12 | Correct | 47 ms | 828 KB | Output is correct |
13 | Correct | 10 ms | 828 KB | Output is correct |
14 | Correct | 21 ms | 724 KB | Output is correct |
15 | Correct | 3 ms | 596 KB | Output is correct |
16 | Correct | 3 ms | 576 KB | Output is correct |
17 | Correct | 17 ms | 708 KB | Output is correct |
18 | Correct | 14 ms | 852 KB | Output is correct |
19 | Correct | 16 ms | 736 KB | Output is correct |
20 | Correct | 15 ms | 724 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5078 ms | 7876 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 79 ms | 5316 KB | Output is correct |
2 | Correct | 58 ms | 7100 KB | Output is correct |
3 | Correct | 135 ms | 7196 KB | Output is correct |
4 | Correct | 63 ms | 7200 KB | Output is correct |
5 | Execution timed out | 5076 ms | 10960 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 57 ms | 5324 KB | Output is correct |
2 | Correct | 61 ms | 7372 KB | Output is correct |
3 | Correct | 62 ms | 7384 KB | Output is correct |
4 | Correct | 69 ms | 7372 KB | Output is correct |
5 | Execution timed out | 5079 ms | 11388 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 3 ms | 468 KB | Output is correct |
4 | Correct | 3 ms | 584 KB | Output is correct |
5 | Correct | 30 ms | 876 KB | Output is correct |
6 | Correct | 37 ms | 852 KB | Output is correct |
7 | Correct | 10 ms | 596 KB | Output is correct |
8 | Correct | 20 ms | 828 KB | Output is correct |
9 | Correct | 18 ms | 724 KB | Output is correct |
10 | Correct | 8 ms | 852 KB | Output is correct |
11 | Correct | 51 ms | 820 KB | Output is correct |
12 | Correct | 47 ms | 828 KB | Output is correct |
13 | Correct | 10 ms | 828 KB | Output is correct |
14 | Correct | 21 ms | 724 KB | Output is correct |
15 | Correct | 3 ms | 596 KB | Output is correct |
16 | Correct | 3 ms | 576 KB | Output is correct |
17 | Correct | 17 ms | 708 KB | Output is correct |
18 | Correct | 14 ms | 852 KB | Output is correct |
19 | Correct | 16 ms | 736 KB | Output is correct |
20 | Correct | 15 ms | 724 KB | Output is correct |
21 | Execution timed out | 5078 ms | 7876 KB | Time limit exceeded |
22 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 3 ms | 468 KB | Output is correct |
4 | Correct | 3 ms | 584 KB | Output is correct |
5 | Correct | 30 ms | 876 KB | Output is correct |
6 | Correct | 37 ms | 852 KB | Output is correct |
7 | Correct | 10 ms | 596 KB | Output is correct |
8 | Correct | 20 ms | 828 KB | Output is correct |
9 | Correct | 18 ms | 724 KB | Output is correct |
10 | Correct | 8 ms | 852 KB | Output is correct |
11 | Correct | 51 ms | 820 KB | Output is correct |
12 | Correct | 47 ms | 828 KB | Output is correct |
13 | Correct | 10 ms | 828 KB | Output is correct |
14 | Correct | 21 ms | 724 KB | Output is correct |
15 | Correct | 3 ms | 596 KB | Output is correct |
16 | Correct | 3 ms | 576 KB | Output is correct |
17 | Correct | 17 ms | 708 KB | Output is correct |
18 | Correct | 14 ms | 852 KB | Output is correct |
19 | Correct | 16 ms | 736 KB | Output is correct |
20 | Correct | 15 ms | 724 KB | Output is correct |
21 | Execution timed out | 5078 ms | 7876 KB | Time limit exceeded |
22 | Halted | 0 ms | 0 KB | - |