oj.uz

Submission #1063014

# Submission time Handle Problem Language Result Execution time Memory
1063014 2024-08-17T13:22:18 Z belgianbot Infinite Race (EGOI24_infiniterace2) C++17
100 / 100
 111 ms 14260 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2000000;

struct node
{
	node* left, *right;
	bool ahead; 
	bool lazy;
	bool value;
};

int query(node* root, int left, int right, int qLeft, int qRight) 
{
	if (left > qRight || right < qLeft) return -1; 
	if (left >= qLeft && right <= qRight) {
		if (root->lazy){
			root->lazy = false;
			root->ahead = root->value;
		}
		return root->ahead; 
	}
	
	int mid = (left + right) / 2;
	
	if (root->lazy) {
		root->lazy = false;
		root->left->lazy = true;
		root->right->lazy = true;
		root->left->value = root->value;
		root->right->value = root->value;
	}
	int one = query(root->left, left, mid, qLeft, qRight);
	if (one != -1) return one;
	return query(root->right, mid + 1, right, qLeft, qRight); 
}

void update(node* root, int left, int right, int qLeft, int qRight, bool nValue) 
{
	if (left > qRight || right < qLeft) return;
	if (left >= qLeft && right <= qRight) 
	{
		if (left == right) root->ahead = nValue;
		else {
			root->lazy = true;
			root->value = nValue;
		 }
		return;
	}
	
	int mid = (left + right) / 2; 
	
	update(root->left, left, mid, qLeft, qRight, nValue);
	update(root->right, mid + 1, right, qLeft, qRight, nValue);
	
}

void build(node* root, int left, int right, const vector< bool > &v) 
{
	if (left == right) 
	{
		root->ahead = v[left]; 
		return;
	}
	
	int mid = (left + right) / 2; 

	root->left = new node{NULL, NULL, 0, false, false}; 
	root->right = new node{NULL, NULL, 0, false, false}; 
	
	build(root->left, left, mid, v); 
	build(root->right, mid + 1, right, v); 
	
}

void destroy(node* root) 
{
	if (root->left) destroy(root->left); 
	if (root->right) destroy(root->right);
	delete root; 
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	node *root = new node {NULL, NULL, false, false, false};
	int n, Q; cin >> n >> Q;
	int ans = 0;
	vector<bool> v(n, true);
	build(root, 0, n - 1, v);
	for (int i = 0; i < Q; i++) {
		int x; cin >> x;
		if (x < 0) update(root, 0, n - 1, -x, -x, true);
		else {
			if (query(root, 0, n - 1, x, x)) update(root, 0, n - 1, x, x, false);
			else {
				ans++;
				update(root, 0, n - 1, 0, x - 1, true);
				update (root, 0, n-1, x + 1, n - 1, true);
				update(root, 0, n - 1, x, x, false);
			}
		}
	}
	cout << ans << '\n';
	destroy(root);
	return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 11 ms 824 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 11 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 860 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 10 ms 828 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 828 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 16 ms 696 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 14 ms 980 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 58 ms 14108 KB Output is correct
6 Correct 20 ms 12892 KB Output is correct
7 Correct 12 ms 604 KB Output is correct
8 Correct 12 ms 728 KB Output is correct
9 Correct 16 ms 604 KB Output is correct
10 Correct 23 ms 860 KB Output is correct
11 Correct 28 ms 960 KB Output is correct
12 Correct 45 ms 1580 KB Output is correct
13 Correct 67 ms 4692 KB Output is correct
14 Correct 99 ms 14164 KB Output is correct
15 Correct 103 ms 14164 KB Output is correct
16 Correct 101 ms 14164 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 73 ms 14032 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 110 ms 14008 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 13 ms 12932 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 11 ms 824 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 11 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 860 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 10 ms 828 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 828 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 16 ms 696 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 14 ms 980 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 58 ms 14108 KB Output is correct
26 Correct 20 ms 12892 KB Output is correct
27 Correct 12 ms 604 KB Output is correct
28 Correct 12 ms 728 KB Output is correct
29 Correct 16 ms 604 KB Output is correct
30 Correct 23 ms 860 KB Output is correct
31 Correct 28 ms 960 KB Output is correct
32 Correct 45 ms 1580 KB Output is correct
33 Correct 67 ms 4692 KB Output is correct
34 Correct 99 ms 14164 KB Output is correct
35 Correct 103 ms 14164 KB Output is correct
36 Correct 101 ms 14164 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 73 ms 14032 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 110 ms 14008 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 13 ms 12932 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 456 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 10 ms 948 KB Output is correct
73 Correct 15 ms 984 KB Output is correct
74 Correct 11 ms 860 KB Output is correct
75 Correct 11 ms 820 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 11 ms 724 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 9 ms 860 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 11 ms 860 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 10 ms 948 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 11 ms 604 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 54 ms 14008 KB Output is correct
89 Correct 14 ms 12892 KB Output is correct
90 Correct 12 ms 844 KB Output is correct
91 Correct 14 ms 604 KB Output is correct
92 Correct 16 ms 604 KB Output is correct
93 Correct 22 ms 944 KB Output is correct
94 Correct 33 ms 1084 KB Output is correct
95 Correct 45 ms 1456 KB Output is correct
96 Correct 64 ms 4464 KB Output is correct
97 Correct 90 ms 14008 KB Output is correct
98 Correct 91 ms 14164 KB Output is correct
99 Correct 95 ms 14168 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 70 ms 14164 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 111 ms 14116 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 75 ms 14252 KB Output is correct
113 Correct 49 ms 4700 KB Output is correct
114 Correct 49 ms 14164 KB Output is correct
115 Correct 39 ms 4160 KB Output is correct
116 Correct 105 ms 13992 KB Output is correct
117 Correct 14 ms 12844 KB Output is correct
118 Correct 12 ms 860 KB Output is correct
119 Correct 14 ms 944 KB Output is correct
120 Correct 16 ms 860 KB Output is correct
121 Correct 19 ms 860 KB Output is correct
122 Correct 24 ms 1092 KB Output is correct
123 Correct 37 ms 1628 KB Output is correct
124 Correct 53 ms 4728 KB Output is correct
125 Correct 93 ms 14164 KB Output is correct
126 Correct 78 ms 14164 KB Output is correct
127 Correct 79 ms 14164 KB Output is correct
128 Correct 56 ms 14164 KB Output is correct
129 Correct 63 ms 14260 KB Output is correct
130 Correct 0 ms 348 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 0 ms 348 KB Output is correct
133 Correct 13 ms 12964 KB Output is correct
134 Correct 0 ms 348 KB Output is correct