oj.uz

답안 #405272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
405272 2021-05-16T06:55:37 Z pavement 이상한 기계 (APIO19_strange_device) C++17
35 / 100
 552 ms 16892 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, A, B, P, f = -1, st, ans;
vector<ii> seg;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> A >> B;
	P = A / __gcd(A, B + 1) * B;
	assert(P <= 1e18);
	for (int i = 1, l, r; i <= N; i++) {
		cin >> l >> r;
		if (r - l + 1 >= 2 * P) return cout << P << '\n', 0;
		if (l + P - (l % P) > r) seg.eb(l % P, r % P);
		else seg.eb(l % P, P - 1), seg.eb(0, r % P);
	}
	sort(seg.begin(), seg.end());
	for (auto i : seg) {
		if (i.first > f) {
			if (f != -1) ans += f - st + 1;
			st = i.first;
		}
		f = max(f, i.second);
	}
	ans += f - st + 1;
	cout << ans << '\n';
}

Compilation message

strange_device.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 7 ms 592 KB Output is correct
3 Correct 6 ms 592 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 592 KB Output is correct
17 Correct 52 ms 2396 KB Output is correct
18 Incorrect 1 ms 256 KB Output isn't correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 370 ms 16792 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 508 ms 16864 KB Output is correct
3 Correct 493 ms 16864 KB Output is correct
4 Correct 466 ms 16812 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 508 ms 16864 KB Output is correct
3 Correct 493 ms 16864 KB Output is correct
4 Correct 466 ms 16812 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 485 ms 16772 KB Output is correct
7 Correct 483 ms 16792 KB Output is correct
8 Correct 486 ms 16820 KB Output is correct
9 Correct 507 ms 16808 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 508 ms 16864 KB Output is correct
3 Correct 493 ms 16864 KB Output is correct
4 Correct 466 ms 16812 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 46 ms 2448 KB Output is correct
7 Correct 54 ms 2468 KB Output is correct
8 Correct 48 ms 2492 KB Output is correct
9 Correct 53 ms 2456 KB Output is correct
10 Correct 47 ms 2380 KB Output is correct
11 Correct 48 ms 2432 KB Output is correct
12 Correct 48 ms 2412 KB Output is correct
13 Correct 49 ms 2440 KB Output is correct
14 Correct 45 ms 2472 KB Output is correct
15 Correct 56 ms 2504 KB Output is correct
16 Correct 62 ms 2484 KB Output is correct
17 Correct 49 ms 2492 KB Output is correct
18 Correct 471 ms 16856 KB Output is correct
19 Correct 475 ms 16816 KB Output is correct
20 Correct 540 ms 16812 KB Output is correct
21 Correct 49 ms 2480 KB Output is correct
22 Correct 50 ms 2492 KB Output is correct
23 Correct 150 ms 8580 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 55 ms 2416 KB Output is correct
3 Correct 49 ms 2496 KB Output is correct
4 Correct 552 ms 16880 KB Output is correct
5 Correct 61 ms 2496 KB Output is correct
6 Correct 51 ms 2504 KB Output is correct
7 Correct 49 ms 2472 KB Output is correct
8 Correct 49 ms 2456 KB Output is correct
9 Correct 48 ms 2496 KB Output is correct
10 Correct 51 ms 2504 KB Output is correct
11 Correct 50 ms 2412 KB Output is correct
12 Correct 44 ms 2456 KB Output is correct
13 Correct 49 ms 2484 KB Output is correct
14 Correct 521 ms 16892 KB Output is correct
15 Correct 51 ms 2440 KB Output is correct
16 Correct 492 ms 16868 KB Output is correct
17 Correct 470 ms 16804 KB Output is correct
18 Incorrect 1 ms 204 KB Output isn't correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 7 ms 592 KB Output is correct
3 Correct 6 ms 592 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 592 KB Output is correct
17 Correct 52 ms 2396 KB Output is correct
18 Incorrect 1 ms 256 KB Output isn't correct