oj.uz

답안 #1035184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035184 2024-07-26T06:01:47 Z Halym2007 이상한 기계 (APIO19_strange_device) C++17
10 / 100
 300 ms 69792 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define sz size()
#define pii pair <ll, ll>
const int N = 1e7 + 5;
#define ll long long
#define pb push_back
vector <pii> v;
ll n, a, b, l[N], r[N];
int main () {
//	freopen ("input.txt", "r", stdin);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> a >> b;
	__int128 m = a / __gcd (a, b + 1) * b;
	for (int i = 1; i <= n; ++i) {
		cin >> l[i] >> r[i];
	}
	for (int i = 1; i <= n; ++i) {
		if (r[i] - l[i] + 1 >= m) {
			v.pb ({0, m - 1});
		}
		if (l[i] % m > r[i] % m) {
			v.pb ({l[i] % m, m - 1});
			v.pb ({0, r[i] % m});
		}
		else {
			v.pb ({l[i] % m, r[i] % m});
		}
	}
	sort (v.begin(), v.end());
//	for (auto i : v) {
//		cout << i.ff << " " << i.ss << "\n";
//	}
//	return 0;
	ll l1 = 0, r1 = 0, jogap = 0;
	for (int i = 0; i < (int)v.sz; ++i) {
		if (v[i].ff <= r1) r1 = max (r1, v[i].ss);
		
		else {
			jogap += r1 - l1 + 1;
			l1 = v[i].ff; 
			r1 = v[i].ss;
		}
	}
	jogap += r1 - l1 + 1;
	cout << jogap;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 3 ms 1372 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 198 ms 57800 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 286 ms 69560 KB Output is correct
3 Correct 282 ms 69580 KB Output is correct
4 Correct 300 ms 69568 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 286 ms 69560 KB Output is correct
3 Correct 282 ms 69580 KB Output is correct
4 Correct 300 ms 69568 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 279 ms 69696 KB Output is correct
7 Correct 277 ms 69792 KB Output is correct
8 Correct 274 ms 69568 KB Output is correct
9 Incorrect 298 ms 69692 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 286 ms 69560 KB Output is correct
3 Correct 282 ms 69580 KB Output is correct
4 Correct 300 ms 69568 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 27 ms 7884 KB Output is correct
7 Correct 30 ms 7924 KB Output is correct
8 Correct 28 ms 7704 KB Output is correct
9 Correct 29 ms 7884 KB Output is correct
10 Correct 27 ms 7796 KB Output is correct
11 Correct 29 ms 7852 KB Output is correct
12 Correct 31 ms 8076 KB Output is correct
13 Incorrect 35 ms 7804 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 29 ms 7888 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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