oj.uz

답안 #171157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171157 2019-12-27T14:15:05 Z joulej 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 987 ms 69272 KB 
#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
	#define DBG(X) cout << #X << "=" << (X) << '\n';
	#define SAY(X) cout << (X) << '\n';
#else
	#define DBG(X)
	#define SAY(X)
#endif
 
using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for(auto& elem: ret) cin >> elem; return ret; }

ll GCD(ll x, ll y) {
	return (x == 0 ? y : GCD(y % x, x));
}

ll calc_period(ll A, ll B) {
	ll k = (A / GCD(A, B + 1));

	ld kLD = (ld)k;
	ld bLD = (ld)B;

	if(kLD * bLD >= (ld)2e18) {
		return LL_INF;
	}

	return k * B;
}

vector<pll> events;

void add(ll L, ll R) {
	assert(L <= R);

	events.emplace_back(L, +1);
	events.emplace_back(R + 1, -1);
}

void solve() {
	int n = fetch<int>();
	ll A = fetch<ll>();
	ll B = fetch<ll>();
	ll p = calc_period(A, B);
	DBG(p);

	for(int i = 0; i < n; ++i) {
		ll L = fetch<ll>();
		ll R = fetch<ll>();

		ll sz = R - L + 1;
		if(sz >= p) {
			add(0, p - 1);
		} else {
			L %= p;
			R %= p;

			if(L <= R) {
				add(L, R);
			} else {
				add(0, R);
				add(L, p - 1);
			}
		}
	}

	sort(events.begin(), events.end());
	ll answ = 0;
	ll bal = 0;

	for(int i = 0; i < len(events); ) {
		DBG(i);
		int j = i;
		while(j < len(events) && events[j].first == events[i].first) {
			bal += events[j++].second;
		}

		DBG(bal);
		if(bal > 0 && j < len(events)) {
			answ += events[j].first - events[i].first;
		}

		i = j;
	}

	cout << answ << '\n';
}

int main() {
	fast_io();
	solve();

	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 9 ms 1404 KB Output is correct
3 Correct 10 ms 1400 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 9 ms 1328 KB Output is correct
17 Correct 85 ms 7292 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 528 ms 34728 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 747 ms 35428 KB Output is correct
3 Correct 778 ms 35480 KB Output is correct
4 Correct 755 ms 35252 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 747 ms 35428 KB Output is correct
3 Correct 778 ms 35480 KB Output is correct
4 Correct 755 ms 35252 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 803 ms 35344 KB Output is correct
7 Correct 750 ms 35324 KB Output is correct
8 Correct 762 ms 35352 KB Output is correct
9 Correct 943 ms 35400 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 747 ms 35428 KB Output is correct
3 Correct 778 ms 35480 KB Output is correct
4 Correct 755 ms 35252 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 77 ms 7276 KB Output is correct
7 Correct 78 ms 7272 KB Output is correct
8 Correct 78 ms 7272 KB Output is correct
9 Correct 79 ms 7272 KB Output is correct
10 Correct 75 ms 7272 KB Output is correct
11 Correct 80 ms 7272 KB Output is correct
12 Correct 76 ms 7228 KB Output is correct
13 Correct 82 ms 7276 KB Output is correct
14 Correct 76 ms 7272 KB Output is correct
15 Correct 85 ms 7272 KB Output is correct
16 Correct 85 ms 7272 KB Output is correct
17 Correct 78 ms 7268 KB Output is correct
18 Correct 774 ms 35528 KB Output is correct
19 Correct 738 ms 34868 KB Output is correct
20 Correct 906 ms 34724 KB Output is correct
21 Correct 85 ms 6120 KB Output is correct
22 Correct 69 ms 6120 KB Output is correct
23 Correct 221 ms 18236 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 81 ms 5480 KB Output is correct
3 Correct 82 ms 5436 KB Output is correct
4 Correct 977 ms 34432 KB Output is correct
5 Correct 85 ms 5476 KB Output is correct
6 Correct 84 ms 5480 KB Output is correct
7 Correct 117 ms 5480 KB Output is correct
8 Correct 92 ms 5452 KB Output is correct
9 Correct 88 ms 5568 KB Output is correct
10 Correct 90 ms 5608 KB Output is correct
11 Correct 84 ms 5624 KB Output is correct
12 Correct 79 ms 5660 KB Output is correct
13 Correct 93 ms 5488 KB Output is correct
14 Correct 953 ms 34320 KB Output is correct
15 Correct 86 ms 5608 KB Output is correct
16 Correct 786 ms 34380 KB Output is correct
17 Correct 785 ms 33844 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 9 ms 1404 KB Output is correct
3 Correct 10 ms 1400 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 9 ms 1328 KB Output is correct
17 Correct 85 ms 7292 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 1 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 528 ms 34728 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 747 ms 35428 KB Output is correct
31 Correct 778 ms 35480 KB Output is correct
32 Correct 755 ms 35252 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 803 ms 35344 KB Output is correct
35 Correct 750 ms 35324 KB Output is correct
36 Correct 762 ms 35352 KB Output is correct
37 Correct 943 ms 35400 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 77 ms 7276 KB Output is correct
40 Correct 78 ms 7272 KB Output is correct
41 Correct 78 ms 7272 KB Output is correct
42 Correct 79 ms 7272 KB Output is correct
43 Correct 75 ms 7272 KB Output is correct
44 Correct 80 ms 7272 KB Output is correct
45 Correct 76 ms 7228 KB Output is correct
46 Correct 82 ms 7276 KB Output is correct
47 Correct 76 ms 7272 KB Output is correct
48 Correct 85 ms 7272 KB Output is correct
49 Correct 85 ms 7272 KB Output is correct
50 Correct 78 ms 7268 KB Output is correct
51 Correct 774 ms 35528 KB Output is correct
52 Correct 738 ms 34868 KB Output is correct
53 Correct 906 ms 34724 KB Output is correct
54 Correct 85 ms 6120 KB Output is correct
55 Correct 69 ms 6120 KB Output is correct
56 Correct 221 ms 18236 KB Output is correct
57 Correct 2 ms 380 KB Output is correct
58 Correct 81 ms 5480 KB Output is correct
59 Correct 82 ms 5436 KB Output is correct
60 Correct 977 ms 34432 KB Output is correct
61 Correct 85 ms 5476 KB Output is correct
62 Correct 84 ms 5480 KB Output is correct
63 Correct 117 ms 5480 KB Output is correct
64 Correct 92 ms 5452 KB Output is correct
65 Correct 88 ms 5568 KB Output is correct
66 Correct 90 ms 5608 KB Output is correct
67 Correct 84 ms 5624 KB Output is correct
68 Correct 79 ms 5660 KB Output is correct
69 Correct 93 ms 5488 KB Output is correct
70 Correct 953 ms 34320 KB Output is correct
71 Correct 86 ms 5608 KB Output is correct
72 Correct 786 ms 34380 KB Output is correct
73 Correct 785 ms 33844 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 376 KB Output is correct
76 Correct 3 ms 248 KB Output is correct
77 Correct 3 ms 380 KB Output is correct
78 Correct 1 ms 376 KB Output is correct
79 Correct 10 ms 1400 KB Output is correct
80 Correct 987 ms 69272 KB Output is correct
81 Correct 985 ms 69156 KB Output is correct
82 Correct 906 ms 69228 KB Output is correct
83 Correct 891 ms 69044 KB Output is correct
84 Correct 940 ms 69064 KB Output is correct
85 Correct 957 ms 69188 KB Output is correct
86 Correct 228 ms 26860 KB Output is correct
87 Correct 2 ms 376 KB Output is correct