oj.uz

Submission #622544

# Submission time Handle Problem Language Result Execution time Memory
622544 2022-08-04T11:16:29 Z bigo Strange Device (APIO19_strange_device) C++14
10 / 100
 5000 ms 524288 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
#define all(a) a.begin(),a.end()

int main() {
	ios::sync_with_stdio(false);
	ll n, a, b;
	cin >> n >> a >> b;
	vector<pii>vec(n);
	for (ll i = 0; i < n; i++)
		cin >> vec[i].first >> vec[i].second;
	set<pii>mp;
	ll ans = 0;
	for (ll i = 0; i < n; i++) {
		for (ll j = vec[i].first; j <= vec[i].second; j++) {
			int x = (j + j / b) % a;
			int y = j % b;
			if (mp.find({ x,y })==mp.end()) {
				ans++;
				mp.insert({ x,y });
			}
		}
	}
	cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 56 ms 12464 KB Output is correct
3 Correct 86 ms 18452 KB Output is correct
4 Correct 2 ms 840 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 1216 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 44 ms 7032 KB Output is correct
16 Correct 33 ms 7276 KB Output is correct
17 Correct 73 ms 11864 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 Execution timed out 5075 ms 516284 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 170 ms 32264 KB Output is correct
3 Correct 169 ms 32088 KB Output is correct
4 Correct 149 ms 30596 KB Output is correct
5 Execution timed out 5015 ms 103332 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 571 ms 78556 KB Output is correct
3 Runtime error 3096 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 571 ms 78556 KB Output is correct
3 Runtime error 3096 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 571 ms 78556 KB Output is correct
3 Runtime error 3096 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1841 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 56 ms 12464 KB Output is correct
3 Correct 86 ms 18452 KB Output is correct
4 Correct 2 ms 840 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 1216 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 44 ms 7032 KB Output is correct
16 Correct 33 ms 7276 KB Output is correct
17 Correct 73 ms 11864 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Execution timed out 5075 ms 516284 KB Time limit exceeded
21 Halted 0 ms 0 KB -