oj.uz

Submission #572351

# Submission time Handle Problem Language Result Execution time Memory
572351 2022-06-04T09:40:56 Z CpDark Strange Device (APIO19_strange_device) C++14
65 / 100
 458 ms 38680 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 = (A / gcd(A, B + 1)) * B;
	if (mod < 0)mod = 1e18 + 7;
	vp times(n);
	vp points;
	ll l, r;
	for (int i = 0; i < n; i++) {
		cin >> l >> r;
		times[i] = { l,r};
		pushTime(times[i], mod, points);
	}
	
	sort(points.begin(), points.end());
	ll count = 0;
	int open = 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:65: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]
   65 |  for (int i = 1; i < points.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~
strange_device.cpp:62:6: warning: unused variable 'open' [-Wunused-variable]
   62 |  int open = 0;
      |      ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 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 0 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 1236 KB Output is correct
17 Correct 44 ms 7236 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 1 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 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 309 ms 36588 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 422 ms 35872 KB Output is correct
3 Correct 410 ms 38656 KB Output is correct
4 Correct 382 ms 38628 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 422 ms 35872 KB Output is correct
3 Correct 410 ms 38656 KB Output is correct
4 Correct 382 ms 38628 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 395 ms 38680 KB Output is correct
7 Correct 396 ms 37988 KB Output is correct
8 Correct 399 ms 37504 KB Output is correct
9 Correct 409 ms 37040 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 422 ms 35872 KB Output is correct
3 Correct 410 ms 38656 KB Output is correct
4 Correct 382 ms 38628 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 44 ms 7228 KB Output is correct
7 Correct 44 ms 7276 KB Output is correct
8 Correct 41 ms 7292 KB Output is correct
9 Correct 41 ms 7236 KB Output is correct
10 Correct 42 ms 7232 KB Output is correct
11 Correct 43 ms 7172 KB Output is correct
12 Correct 44 ms 7224 KB Output is correct
13 Correct 51 ms 7220 KB Output is correct
14 Correct 38 ms 7180 KB Output is correct
15 Correct 43 ms 7288 KB Output is correct
16 Correct 42 ms 7252 KB Output is correct
17 Correct 42 ms 7236 KB Output is correct
18 Correct 382 ms 36076 KB Output is correct
19 Correct 371 ms 35464 KB Output is correct
20 Correct 414 ms 34780 KB Output is correct
21 Correct 44 ms 7292 KB Output is correct
22 Correct 39 ms 7232 KB Output is correct
23 Correct 126 ms 18040 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 47 ms 7212 KB Output is correct
3 Correct 42 ms 7200 KB Output is correct
4 Correct 458 ms 34076 KB Output is correct
5 Correct 44 ms 7224 KB Output is correct
6 Correct 41 ms 7228 KB Output is correct
7 Correct 43 ms 7180 KB Output is correct
8 Correct 45 ms 7236 KB Output is correct
9 Correct 43 ms 7272 KB Output is correct
10 Correct 42 ms 7220 KB Output is correct
11 Correct 51 ms 7348 KB Output is correct
12 Correct 38 ms 7220 KB Output is correct
13 Correct 52 ms 7196 KB Output is correct
14 Correct 410 ms 33524 KB Output is correct
15 Correct 44 ms 7248 KB Output is correct
16 Correct 368 ms 33364 KB Output is correct
17 Correct 393 ms 33236 KB Output is correct
18 Correct 1 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 5 ms 1236 KB Output is correct
3 Correct 5 ms 1236 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 0 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 1236 KB Output is correct
17 Correct 44 ms 7236 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -