oj.uz

답안 #572380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572380 2022-06-04T10:02:55 Z CpDark 이상한 기계 (APIO19_strange_device) C++14
65 / 100
 454 ms 32628 KB 
#include <bits/stdc++.h>
#define fastInput ios::sync_with_stdio(false); cin.tie(nullptr);

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pii;
typedef vector<pii> vp;
typedef vector<bool> vb;
typedef vector<vb> vvb;

ll A, B;
inline pii getTime(ll t) {
	ll x = (t + (t / B)) % A;
	ll y = t % B;
	return { x,y };
}

inline void pushTime(pii p, ll mod, vp &points) {

	if (p.first % mod <= p.second % mod) {
		points.push_back({ p.first % mod, p.second % mod });
	}
	else {
		points.push_back({ p.first % mod, mod - 1 });
		points.push_back({ 0, p.second % mod });
	}
	
}

ll gcd(ll a, ll b) {
	if (b == 0) {
		return a;
	}
	else {
		return gcd(b, a % b);
	}
}
const ll inf = 1e18 + 1;

int main() {
	fastInput;
	int n;
	cin >> n >> A >> B;

	ll mod = inf;

	A /= __gcd(A, B + 1);
	if (A <= inf / B) {
		mod = A * B;
	}
	vp times(n);
	vp points;
	ll l, r;
	for (int i = 0; i < n; i++) {
		cin >> l >> r;
		times[i] = { l,r};
		if (l - r + 1 >= mod) {
			cout << mod;
			return 0;
		}
		pushTime(times[i], mod, points);
	}
	
	sort(points.begin(), points.end());
	ll count = 0;
	ll last = points[0].second;
	ll start = points[0].first;
	for (int i = 1; i < points.size(); i++) {
		if (points[i].first > last) {
			ll amount = last - start + 1;
			start = points[i].first;
			count += amount;
		}
		last = max(last, points[i].second);
		
	}
	ll amount = last - start + 1;
	count += amount;
	cout << count;

	return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |  for (int i = 1; i < points.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 42 ms 4044 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 287 ms 32460 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 403 ms 32436 KB Output is correct
3 Correct 387 ms 32440 KB Output is correct
4 Correct 379 ms 32476 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 403 ms 32436 KB Output is correct
3 Correct 387 ms 32440 KB Output is correct
4 Correct 379 ms 32476 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 399 ms 32512 KB Output is correct
7 Correct 402 ms 32480 KB Output is correct
8 Correct 381 ms 32592 KB Output is correct
9 Correct 435 ms 32428 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 403 ms 32436 KB Output is correct
3 Correct 387 ms 32440 KB Output is correct
4 Correct 379 ms 32476 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 42 ms 4048 KB Output is correct
7 Correct 42 ms 4048 KB Output is correct
8 Correct 40 ms 4048 KB Output is correct
9 Correct 39 ms 4048 KB Output is correct
10 Correct 37 ms 4040 KB Output is correct
11 Correct 40 ms 4016 KB Output is correct
12 Correct 38 ms 4048 KB Output is correct
13 Correct 43 ms 3984 KB Output is correct
14 Correct 37 ms 4064 KB Output is correct
15 Correct 44 ms 3956 KB Output is correct
16 Correct 47 ms 4012 KB Output is correct
17 Correct 41 ms 4040 KB Output is correct
18 Correct 393 ms 32484 KB Output is correct
19 Correct 425 ms 32528 KB Output is correct
20 Correct 422 ms 32412 KB Output is correct
21 Correct 42 ms 4048 KB Output is correct
22 Correct 36 ms 4020 KB Output is correct
23 Correct 129 ms 13928 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 42 ms 4024 KB Output is correct
3 Correct 43 ms 4020 KB Output is correct
4 Correct 454 ms 32488 KB Output is correct
5 Correct 49 ms 4040 KB Output is correct
6 Correct 41 ms 4076 KB Output is correct
7 Correct 41 ms 4072 KB Output is correct
8 Correct 43 ms 4052 KB Output is correct
9 Correct 40 ms 4048 KB Output is correct
10 Correct 40 ms 3964 KB Output is correct
11 Correct 51 ms 4036 KB Output is correct
12 Correct 37 ms 4008 KB Output is correct
13 Correct 41 ms 4036 KB Output is correct
14 Correct 422 ms 32628 KB Output is correct
15 Correct 41 ms 4040 KB Output is correct
16 Correct 390 ms 32544 KB Output is correct
17 Correct 385 ms 32456 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 42 ms 4044 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -