oj.uz

Submission #977009

# Submission time Handle Problem Language Result Execution time Memory
977009 2024-05-07T10:19:13 Z dubabuba Strange Device (APIO19_strange_device) C++14
5 / 100
 1228 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long i64;
 
struct tree {
	i64 tl, tr, sum;
	tree *lc, *rc;
	bool lazy;
 
	tree(i64 l, i64 r) {
		tl = l;
		tr = r;
		sum = 0;
		lazy = 0;
		lc = NULL;
		rc = NULL;
	}
 
	void upt(i64 l, i64 r) {
		if(lazy) return;
		if(tl == l && r == tr) {
			sum = r - l + 1;
			lazy = 1;
			return;
		}
 
		i64 tm = (tl + tr) / 2;
		if(lc == NULL) lc = new tree(tl, tm);
		if(rc == NULL) rc = new tree(tm + 1, tr);
 
		if(r <= tm) lc-> upt(l, r);
		else if(tm < l) rc-> upt(l, r);
		else {
			lc-> upt(l, tm);
			rc-> upt(tm + 1, r);
		}
 
		sum = lc-> sum + rc-> sum;
		if(lc-> lazy && rc-> lazy)
			lazy = 1;
	}
};
 
i64 gcd(i64 a, i64 b) {
	if(a == 0) return b;
	if(b == 0) return a;
	return gcd(b % a, a);
}
 
int main() {
	int n, gay = 0;
	i64 A, B;
	cin >> n >> A >> B;
	i64 T = A / gcd(A, B + 1) * B;
 
	// cout << T << endl;
	tree *root = new tree(0, T - 1);
 
	for(int i = 0; i < n; i++) {
		i64 l, r;
		cin >> l >> r;
		if(gay) continue;
		if(r - l + 1 >= T) {
			gay = 1;
			continue;
		}

		l %= T;
		r %= T;

		if(l <= r) {
			// cout << " > " << l << ' ' << r << endl;
			root-> upt(l, r);
		}
		else {
			// cout << " > " << l << ' ' << T - 1 << endl;
			// cout << " > " << 0 << ' ' << r << endl;
			root-> upt(l, T - 1);
			root-> upt(0, r);
		}
	}
 
	if(gay) cout << T << endl;
	else cout << root-> sum << endl;
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 15 ms 5496 KB Output is correct
3 Correct 16 ms 6548 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 15 ms 4700 KB Output is correct
17 Correct 136 ms 13500 KB Output is correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
0 / 5.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 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 1628 KB Output is correct
3 Correct 3 ms 1628 KB Output is correct
4 Correct 4 ms 1628 KB Output is correct
5 Correct 786 ms 408 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1228 ms 125864 KB Output is correct
3 Runtime error 859 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1228 ms 125864 KB Output is correct
3 Runtime error 859 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1228 ms 125864 KB Output is correct
3 Runtime error 859 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 194 ms 83584 KB Output is correct
3 Correct 264 ms 197456 KB Output is correct
4 Runtime error 656 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 15 ms 5496 KB Output is correct
3 Correct 16 ms 6548 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 15 ms 4700 KB Output is correct
17 Correct 136 ms 13500 KB Output is correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -