oj.uz

답안 #572371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572371 2022-06-04T09:56:55 Z CpDark 이상한 기계 (APIO19_strange_device) C++14
65 / 100
 461 ms 34268 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);
	}
}


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

	ll mod = 1e18 + 1;
	A /= gcd(A, B + 1);
	if (A <= LLONG_MAX / 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:71: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]
   71 |  for (int i = 1; i < points.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 291 ms 34172 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 461 ms 34072 KB Output is correct
3 Correct 395 ms 34172 KB Output is correct
4 Correct 379 ms 34096 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 461 ms 34072 KB Output is correct
3 Correct 395 ms 34172 KB Output is correct
4 Correct 379 ms 34096 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 390 ms 34172 KB Output is correct
7 Correct 396 ms 34260 KB Output is correct
8 Correct 392 ms 34268 KB Output is correct
9 Correct 406 ms 34148 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 461 ms 34072 KB Output is correct
3 Correct 395 ms 34172 KB Output is correct
4 Correct 379 ms 34096 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 47 ms 5704 KB Output is correct
7 Correct 49 ms 5496 KB Output is correct
8 Correct 42 ms 5576 KB Output is correct
9 Correct 40 ms 5588 KB Output is correct
10 Correct 40 ms 5388 KB Output is correct
11 Correct 41 ms 5436 KB Output is correct
12 Correct 43 ms 5524 KB Output is correct
13 Correct 42 ms 5196 KB Output is correct
14 Correct 40 ms 5192 KB Output is correct
15 Correct 47 ms 5484 KB Output is correct
16 Correct 42 ms 5196 KB Output is correct
17 Correct 41 ms 5220 KB Output is correct
18 Correct 403 ms 34160 KB Output is correct
19 Correct 385 ms 33984 KB Output is correct
20 Correct 420 ms 34116 KB Output is correct
21 Correct 43 ms 5456 KB Output is correct
22 Correct 37 ms 5484 KB Output is correct
23 Correct 126 ms 16272 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 43 ms 4956 KB Output is correct
3 Correct 48 ms 5456 KB Output is correct
4 Correct 458 ms 34064 KB Output is correct
5 Correct 44 ms 5048 KB Output is correct
6 Correct 42 ms 4932 KB Output is correct
7 Correct 45 ms 5288 KB Output is correct
8 Correct 47 ms 5288 KB Output is correct
9 Correct 44 ms 5192 KB Output is correct
10 Correct 48 ms 5004 KB Output is correct
11 Correct 42 ms 5056 KB Output is correct
12 Correct 39 ms 5192 KB Output is correct
13 Correct 48 ms 5044 KB Output is correct
14 Correct 423 ms 33548 KB Output is correct
15 Correct 44 ms 5112 KB Output is correct
16 Correct 436 ms 33400 KB Output is correct
17 Correct 385 ms 33456 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 30.0

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