oj.uz

Submission #495729

# Submission time Handle Problem Language Result Execution time Memory
495729 2021-12-20T03:45:30 Z mansur Segments (IZhO18_segments) C++14
7 / 100
 5000 ms 8848 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e9, N = 1e6 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int intersect(int l, int r, int tl, int tr) {
	l = max(l, tl);
	r = min(r, tr);
	return max(0ll, r - l + 1);
}

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, vl;
	cin >> n >> vl;
	set<int> s, h;
	for (int i = 1; i <= n; i++) s.insert(i);
	int ans = 0, tl[n + 1], tr[n + 1];
	while (n--) {
		int t;
		cin >> t;
		if (t == 1) {
			int l, r;
			cin >> l >> r;
			l ^= (vl * ans);
			r ^= (vl * ans);
			if (l > r) swap(l, r);
			tl[*s.begin()] = l;
			tr[*s.begin()] = r;
			h.insert(*s.begin());
			s.erase(s.begin());
		}else if (t == 2) {
			int ind;
			cin >> ind;
			h.erase(ind);
		}else {
			int l, r, k;
			cin >> l >> r >> k;
			l ^= (vl * ans);
			r ^= (vl * ans);
			if (l > r) swap(l, r);
			int cur = 0;
			for (auto e: h) {
				if (intersect(l, r, tl[e], tr[e]) >= k) cur++;
			}
			cout << cur << nl;
			ans = cur;
		}
	}
}

Compilation message

segments.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
segments.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
segments.cpp:41:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 34 ms 720 KB Output is correct
6 Correct 39 ms 712 KB Output is correct
7 Correct 13 ms 740 KB Output is correct
8 Correct 18 ms 728 KB Output is correct
9 Correct 20 ms 728 KB Output is correct
10 Correct 10 ms 736 KB Output is correct
11 Correct 49 ms 756 KB Output is correct
12 Correct 53 ms 756 KB Output is correct
13 Correct 10 ms 736 KB Output is correct
14 Correct 19 ms 720 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 7 ms 712 KB Output is correct
17 Correct 16 ms 720 KB Output is correct
18 Correct 15 ms 740 KB Output is correct
19 Correct 18 ms 732 KB Output is correct
20 Correct 21 ms 728 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5049 ms 6696 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 6576 KB Output is correct
2 Correct 72 ms 8484 KB Output is correct
3 Correct 197 ms 8456 KB Output is correct
4 Correct 72 ms 8372 KB Output is correct
5 Execution timed out 5059 ms 8476 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 6560 KB Output is correct
2 Correct 72 ms 8632 KB Output is correct
3 Correct 71 ms 8632 KB Output is correct
4 Correct 98 ms 8708 KB Output is correct
5 Execution timed out 5083 ms 8848 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 34 ms 720 KB Output is correct
6 Correct 39 ms 712 KB Output is correct
7 Correct 13 ms 740 KB Output is correct
8 Correct 18 ms 728 KB Output is correct
9 Correct 20 ms 728 KB Output is correct
10 Correct 10 ms 736 KB Output is correct
11 Correct 49 ms 756 KB Output is correct
12 Correct 53 ms 756 KB Output is correct
13 Correct 10 ms 736 KB Output is correct
14 Correct 19 ms 720 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 7 ms 712 KB Output is correct
17 Correct 16 ms 720 KB Output is correct
18 Correct 15 ms 740 KB Output is correct
19 Correct 18 ms 732 KB Output is correct
20 Correct 21 ms 728 KB Output is correct
21 Execution timed out 5049 ms 6696 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 34 ms 720 KB Output is correct
6 Correct 39 ms 712 KB Output is correct
7 Correct 13 ms 740 KB Output is correct
8 Correct 18 ms 728 KB Output is correct
9 Correct 20 ms 728 KB Output is correct
10 Correct 10 ms 736 KB Output is correct
11 Correct 49 ms 756 KB Output is correct
12 Correct 53 ms 756 KB Output is correct
13 Correct 10 ms 736 KB Output is correct
14 Correct 19 ms 720 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 7 ms 712 KB Output is correct
17 Correct 16 ms 720 KB Output is correct
18 Correct 15 ms 740 KB Output is correct
19 Correct 18 ms 732 KB Output is correct
20 Correct 21 ms 728 KB Output is correct
21 Execution timed out 5049 ms 6696 KB Time limit exceeded
22 Halted 0 ms 0 KB -