oj.uz

Submission #982941

# Submission time Handle Problem Language Result Execution time Memory
982941 2024-05-15T05:39:10 Z vjudge1 Strange Device (APIO19_strange_device) C++17
10 / 100
 936 ms 53180 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
    int n, A, B;
    cin >> n >> A >> B;
    vector<array<int, 2>> a(n);
    int sum = 0;
    for(int i = 0; i < n; i ++)
        cin >> a[i][0] >> a[i][1], sum += a[i][1] - a[i][0] + 1;
    if(sum <= 1e6){
        set<array<int, 2>> s;
        for(int i = 0; i < n; i ++)
            for(int j = a[i][0]; j <= a[i][1]; j ++)
                s.insert({(j + (j / B)) % A, j % B});
        cout << s.size();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 44 ms 12832 KB Output is correct
3 Correct 63 ms 18364 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 7 ms 1268 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 42 ms 7076 KB Output is correct
16 Correct 30 ms 7260 KB Output is correct
17 Correct 115 ms 11956 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 348 KB Output is correct
2 Correct 130 ms 32232 KB Output is correct
3 Correct 166 ms 32052 KB Output is correct
4 Correct 110 ms 30708 KB Output is correct
5 Incorrect 690 ms 41168 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 348 KB Output is correct
2 Incorrect 936 ms 53180 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 348 KB Output is correct
2 Incorrect 936 ms 53180 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 348 KB Output is correct
2 Incorrect 936 ms 53180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 93 ms 5552 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 44 ms 12832 KB Output is correct
3 Correct 63 ms 18364 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 7 ms 1268 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 42 ms 7076 KB Output is correct
16 Correct 30 ms 7260 KB Output is correct
17 Correct 115 ms 11956 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -