oj.uz

답안 #977068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977068 2024-05-07T11:01:39 Z dubabuba 이상한 기계 (APIO19_strange_device) C++14
10 / 100
 1207 ms 63260 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair
 
int gcd(int a, int b) {
	if(a == 0) return b;
	if(b == 0) return a;
	return gcd(b % a, a);
}
 
signed main() {
	int a, b, n, t;
	cin >> n >> a >> b;
	int d = gcd(a, b + 1);
	double sda = 1.0  * a / d * b;
	if(sda <= 1e18) t = a / d * b;
	else t = a / d * b;
	set<pii> v;
 
	int l, r; bool gay = false;
	for(int i = 0; i < n; i++) {
		cin >> l >> r;
		if(r - l + 1 >= t) {
			gay = 1;
			continue;
		}
 
		l %= t;
		r %= t;
 
		if(l <= r) {
			// root->upt(l, r);
			v.insert(MP(l, r));
		}
		else {
			// root->upt(l, t - 1);
			// root->upt(0, r);
			v.insert(MP(l, t - 1));
			v.insert(MP(0, r));
		}
	}
 
	if(gay) {
		cout << t << endl;
		return 0;
	}
 
	int ans = 0;
	l = 0, r = 0;
	for(pii p : v) {
		// cout << p.ff << ' ' << p.ss << endl;
		if(r < p.ff) {
			// cout << " + " << r - l + 1 << endl;
			ans += (r - l + 1);
			l = p.ff;
		}
		r = max(r, p.ss);
	}
 
	ans += (r - l + 1);
	cout << ans << endl;
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 11 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 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 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 677 ms 412 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1131 ms 62844 KB Output is correct
3 Correct 1166 ms 63244 KB Output is correct
4 Correct 1207 ms 63076 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1131 ms 62844 KB Output is correct
3 Correct 1166 ms 63244 KB Output is correct
4 Correct 1207 ms 63076 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1135 ms 62784 KB Output is correct
7 Correct 1172 ms 63260 KB Output is correct
8 Correct 1183 ms 62788 KB Output is correct
9 Incorrect 1187 ms 62804 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1131 ms 62844 KB Output is correct
3 Correct 1166 ms 63244 KB Output is correct
4 Correct 1207 ms 63076 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 115 ms 6564 KB Output is correct
7 Correct 109 ms 6484 KB Output is correct
8 Correct 108 ms 6608 KB Output is correct
9 Correct 109 ms 6476 KB Output is correct
10 Correct 112 ms 6480 KB Output is correct
11 Correct 123 ms 6476 KB Output is correct
12 Correct 108 ms 6556 KB Output is correct
13 Incorrect 110 ms 6680 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 112 ms 6480 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 11 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -