Submission #335285

# Submission time Handle Problem Language Result Execution time Memory
335285 2020-12-11T20:12:59 Z limabeans Segments (IZhO18_segments) C++17
7 / 100
5000 ms 4588 KB
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;

int n,t;
multiset<pair<int,int>> ms;
int id;

pair<int,int> a[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n>>t;

    int lastans=0;

    while (n--) {
	int op;
	cin>>op;
	if (op==1) {
	    ++id;
	    cin>>a[id].first>>a[id].second;
	    ms.insert({a[id].first,a[id].second});
	} else if (op==2) {
	    int i;
	    cin>>i;
	    ms.erase(ms.find({a[i].first,a[i].second}));
	} else if (op==3) {
	    int l,r,k;
	    cin>>l>>r>>k;
	    l=l^(t*lastans);
	    r=r^(t*lastans);
	    if (l>r) swap(l,r);
	    int res=0;
	    for (auto p: ms) {
		int x=max(l,p.first);
		int y=min(r,p.second);
		if (y-x+1>=k) res++;
	    }
	    cout<<res<<"\n";
	    lastans=res;
	} else assert(false);
    }
    
    
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 49 ms 748 KB Output is correct
6 Correct 61 ms 748 KB Output is correct
7 Correct 14 ms 492 KB Output is correct
8 Correct 28 ms 748 KB Output is correct
9 Correct 28 ms 620 KB Output is correct
10 Correct 18 ms 748 KB Output is correct
11 Correct 78 ms 620 KB Output is correct
12 Correct 80 ms 620 KB Output is correct
13 Correct 17 ms 748 KB Output is correct
14 Correct 27 ms 620 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 20 ms 620 KB Output is correct
18 Correct 20 ms 620 KB Output is correct
19 Correct 23 ms 620 KB Output is correct
20 Correct 22 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 5081 ms 3276 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 74 ms 748 KB Output is correct
2 Correct 53 ms 748 KB Output is correct
3 Correct 145 ms 748 KB Output is correct
4 Correct 52 ms 748 KB Output is correct
5 Execution timed out 5086 ms 4332 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 58 ms 748 KB Output is correct
2 Correct 52 ms 748 KB Output is correct
3 Correct 51 ms 748 KB Output is correct
4 Correct 73 ms 748 KB Output is correct
5 Execution timed out 5099 ms 4588 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 49 ms 748 KB Output is correct
6 Correct 61 ms 748 KB Output is correct
7 Correct 14 ms 492 KB Output is correct
8 Correct 28 ms 748 KB Output is correct
9 Correct 28 ms 620 KB Output is correct
10 Correct 18 ms 748 KB Output is correct
11 Correct 78 ms 620 KB Output is correct
12 Correct 80 ms 620 KB Output is correct
13 Correct 17 ms 748 KB Output is correct
14 Correct 27 ms 620 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 20 ms 620 KB Output is correct
18 Correct 20 ms 620 KB Output is correct
19 Correct 23 ms 620 KB Output is correct
20 Correct 22 ms 620 KB Output is correct
21 Execution timed out 5081 ms 3276 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 49 ms 748 KB Output is correct
6 Correct 61 ms 748 KB Output is correct
7 Correct 14 ms 492 KB Output is correct
8 Correct 28 ms 748 KB Output is correct
9 Correct 28 ms 620 KB Output is correct
10 Correct 18 ms 748 KB Output is correct
11 Correct 78 ms 620 KB Output is correct
12 Correct 80 ms 620 KB Output is correct
13 Correct 17 ms 748 KB Output is correct
14 Correct 27 ms 620 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 20 ms 620 KB Output is correct
18 Correct 20 ms 620 KB Output is correct
19 Correct 23 ms 620 KB Output is correct
20 Correct 22 ms 620 KB Output is correct
21 Execution timed out 5081 ms 3276 KB Time limit exceeded
22 Halted 0 ms 0 KB -