oj.uz

Submission #572381

# Submission time Handle Problem Language Result Execution time Memory
572381 2022-06-04T10:06:12 Z CpDark Strange Device (APIO19_strange_device) C++14
65 / 100
 465 ms 32560 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 = 0; i < points.size(); i++) {
		if (points[i].first > last) {
			ll amount = last - start + 1;
			start = points[i].first;
			count += amount;
			last = points[i].second;
		}
		else 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 = 0; i < points.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 4 ms 828 KB Output is correct
17 Correct 40 ms 3992 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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 296 ms 32508 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 395 ms 32504 KB Output is correct
3 Correct 378 ms 32412 KB Output is correct
4 Correct 393 ms 32432 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 395 ms 32504 KB Output is correct
3 Correct 378 ms 32412 KB Output is correct
4 Correct 393 ms 32432 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 386 ms 32496 KB Output is correct
7 Correct 405 ms 32560 KB Output is correct
8 Correct 373 ms 32516 KB Output is correct
9 Correct 439 ms 32432 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 395 ms 32504 KB Output is correct
3 Correct 378 ms 32412 KB Output is correct
4 Correct 393 ms 32432 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 46 ms 4060 KB Output is correct
7 Correct 49 ms 4044 KB Output is correct
8 Correct 42 ms 4120 KB Output is correct
9 Correct 52 ms 3980 KB Output is correct
10 Correct 40 ms 4016 KB Output is correct
11 Correct 48 ms 4088 KB Output is correct
12 Correct 37 ms 4048 KB Output is correct
13 Correct 39 ms 3992 KB Output is correct
14 Correct 38 ms 4012 KB Output is correct
15 Correct 43 ms 3984 KB Output is correct
16 Correct 49 ms 3948 KB Output is correct
17 Correct 42 ms 4012 KB Output is correct
18 Correct 392 ms 32508 KB Output is correct
19 Correct 403 ms 32492 KB Output is correct
20 Correct 465 ms 32496 KB Output is correct
21 Correct 41 ms 4016 KB Output is correct
22 Correct 37 ms 4048 KB Output is correct
23 Correct 126 ms 13900 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 40 ms 4052 KB Output is correct
3 Correct 40 ms 4048 KB Output is correct
4 Correct 458 ms 32412 KB Output is correct
5 Correct 39 ms 4048 KB Output is correct
6 Correct 39 ms 4048 KB Output is correct
7 Correct 39 ms 4008 KB Output is correct
8 Correct 40 ms 4040 KB Output is correct
9 Correct 38 ms 4020 KB Output is correct
10 Correct 37 ms 3984 KB Output is correct
11 Correct 42 ms 4072 KB Output is correct
12 Correct 38 ms 4048 KB Output is correct
13 Correct 42 ms 4008 KB Output is correct
14 Correct 405 ms 32500 KB Output is correct
15 Correct 40 ms 3956 KB Output is correct
16 Correct 396 ms 32428 KB Output is correct
17 Correct 379 ms 32468 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 4 ms 828 KB Output is correct
17 Correct 40 ms 3992 KB Output is correct
18 Correct 0 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 -