oj.uz

Submission #244017

# Submission time Handle Problem Language Result Execution time Memory
244017 2020-07-02T13:13:20 Z hanagasumi Strange Device (APIO19_strange_device) C++17
35 / 100
 580 ms 18208 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
#include <ctime>
 
#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll
 
using namespace std;
typedef long long ll;
typedef long double ld;
mt19937 rnd(chrono::steady_clock().now().time_since_epoch().count());

int gcd(int a, int b) {
	if(a == 0 || b == 0) 
		return a + b;
	return gcd(b, a % b);
}

signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);	

	int n, a, b, ans = 0;
	cin >> n >> a >> b;
	int k = ((b + 1) * a / gcd(b + 1, a)) / (b + 1) * b;
	// cout << k << endl;
	// for (int t = 0; t <= 10; t++) {
	// 	cout << "T " << t << "  " << (t + (t / b)) % a << " " << t % b << endl;
	// }

	
	vector<pair<int, int>> have;
	for (int i = 0; i < n; i++) {
		int l, r;
		cin >> l >> r;
		if(r - l >= k) {
			have.pb({0, k - 1});
			continue;
		}
		int p1 = l % k, p2 = r % k;
		if(p2 >= p1) {
			have.pb({p1, p2});
		}
		else {
			have.pb({p1, k - 1});
			have.pb({0, p2});
		}
	}
	sort(have.begin(), have.end());
	int l = have[0].ft, r = have[0].sc;
	for (int i = 1; i < len(have); i++) {
		if(have[i].ft <= r) {
			r = max(r, have[i].sc);
			continue;
		}
		else {
			ans += (r - l + 1);
			l = have[i].ft, r = have[i].sc;
		}
	}
	ans += (r - l + 1);
	cout << ans << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 10 ms 1152 KB Output is correct
17 Correct 57 ms 3184 KB Output is correct
18 Incorrect 4 ms 384 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Incorrect 5 ms 384 KB Output isn't correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 367 ms 17940 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 515 ms 16980 KB Output is correct
3 Correct 509 ms 16924 KB Output is correct
4 Correct 505 ms 16980 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 515 ms 16980 KB Output is correct
3 Correct 509 ms 16924 KB Output is correct
4 Correct 505 ms 16980 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 520 ms 16956 KB Output is correct
7 Correct 537 ms 16980 KB Output is correct
8 Correct 503 ms 16984 KB Output is correct
9 Correct 537 ms 16984 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 515 ms 16980 KB Output is correct
3 Correct 509 ms 16924 KB Output is correct
4 Correct 505 ms 16980 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 55 ms 3184 KB Output is correct
7 Correct 56 ms 3184 KB Output is correct
8 Correct 61 ms 3312 KB Output is correct
9 Correct 56 ms 3184 KB Output is correct
10 Correct 53 ms 3192 KB Output is correct
11 Correct 55 ms 3184 KB Output is correct
12 Correct 56 ms 3184 KB Output is correct
13 Correct 57 ms 3192 KB Output is correct
14 Correct 54 ms 3184 KB Output is correct
15 Correct 60 ms 3192 KB Output is correct
16 Correct 56 ms 3184 KB Output is correct
17 Correct 54 ms 3184 KB Output is correct
18 Correct 501 ms 17096 KB Output is correct
19 Correct 508 ms 17012 KB Output is correct
20 Correct 580 ms 16980 KB Output is correct
21 Correct 57 ms 3312 KB Output is correct
22 Correct 51 ms 3184 KB Output is correct
23 Correct 161 ms 9288 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 57 ms 3192 KB Output is correct
3 Correct 57 ms 3184 KB Output is correct
4 Correct 563 ms 18208 KB Output is correct
5 Correct 57 ms 3184 KB Output is correct
6 Correct 56 ms 3184 KB Output is correct
7 Correct 57 ms 3192 KB Output is correct
8 Correct 83 ms 3184 KB Output is correct
9 Correct 57 ms 3184 KB Output is correct
10 Correct 57 ms 3464 KB Output is correct
11 Correct 56 ms 3192 KB Output is correct
12 Correct 53 ms 3184 KB Output is correct
13 Correct 58 ms 3180 KB Output is correct
14 Correct 569 ms 18132 KB Output is correct
15 Correct 57 ms 3192 KB Output is correct
16 Correct 517 ms 16980 KB Output is correct
17 Correct 496 ms 16992 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 10 ms 1152 KB Output is correct
17 Correct 57 ms 3184 KB Output is correct
18 Incorrect 4 ms 384 KB Output isn't correct