oj.uz

Submission #677157

# Submission time Handle Problem Language Result Execution time Memory
677157 2023-01-02T13:13:57 Z ajab_01 Strange Device (APIO19_strange_device) C++17
10 / 100
 303 ms 41064 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 6;
long long l[N] , r[N] , a , b , sum = 0;
int n;

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> a >> b;
	for(int i = 0 ; i < n ; i++){
		cin >> l[i] >> r[i];
		sum += r[i] - l[i] + 1;
	}

	if(sum < N){
		map<pair<long long , long long> , int> mp;
		for(int i = 0 ; i < n ; i++)
			for(long long j = l[i] ; j <= r[i] ; j++)
				mp[{(j + j / b) % a , j % b}]++;
		cout << (int)mp.size() << '\n';
		return 0;
	}

	cout << 0 << '\n';
	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 12532 KB Output is correct
3 Correct 61 ms 18192 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 372 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 7 ms 1108 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 37 ms 7028 KB Output is correct
16 Correct 30 ms 7352 KB Output is correct
17 Correct 54 ms 11816 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 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
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 122 ms 32224 KB Output is correct
3 Correct 158 ms 32100 KB Output is correct
4 Correct 109 ms 30556 KB Output is correct
5 Incorrect 250 ms 41064 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 303 ms 15916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 303 ms 15916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 303 ms 15916 KB Output isn't correct
3 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 Incorrect 34 ms 5596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 12532 KB Output is correct
3 Correct 61 ms 18192 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 372 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 7 ms 1108 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 37 ms 7028 KB Output is correct
16 Correct 30 ms 7352 KB Output is correct
17 Correct 54 ms 11816 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -