oj.uz

Submission #361917

# Submission time Handle Problem Language Result Execution time Memory
361917 2021-02-01T06:52:25 Z parsabahrami Strange Device (APIO19_strange_device) C++17
35 / 100
 780 ms 81388 KB 
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<ll, ll> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 1e6 + 10;
ll A, B; int n; set<pii> st;

int main() {
    scanf("%d%lld%lld", &n, &A, &B);
    ll blk = A / __gcd(A, B + 1) * B;
    for (int i = 1; i <= n; i++) {
        ll l, r; scanf("%lld%lld", &l, &r);
        if (r - l + 1 >= blk) return !printf("%lld\n", blk);
        if (l % blk <= r % blk) st.insert({l % blk, -(r % blk)});
        else st.insert({0, -(r % blk)}), st.insert({l % blk, -(blk - 1)});
    }
    ll mx = -1, ret = 0;
    for (pii x : st) {
        ret += max(0ll, -x.S - max(mx + 1, x.F) + 1);
        mx = max(mx, -x.S);
    }
    printf("%lld\n", ret);
    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |     scanf("%d%lld%lld", &n, &A, &B);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:20:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |         ll l, r; scanf("%lld%lld", &l, &r);
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 7 ms 1388 KB Output is correct
3 Correct 9 ms 1388 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 7 ms 1260 KB Output is correct
17 Correct 69 ms 10220 KB Output is correct
18 Incorrect 1 ms 364 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 346 ms 9068 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 732 ms 81388 KB Output is correct
3 Correct 726 ms 74348 KB Output is correct
4 Correct 745 ms 67436 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 732 ms 81388 KB Output is correct
3 Correct 726 ms 74348 KB Output is correct
4 Correct 745 ms 67436 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 719 ms 67636 KB Output is correct
7 Correct 708 ms 67564 KB Output is correct
8 Correct 712 ms 67520 KB Output is correct
9 Correct 755 ms 67564 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 732 ms 81388 KB Output is correct
3 Correct 726 ms 74348 KB Output is correct
4 Correct 745 ms 67436 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 68 ms 10348 KB Output is correct
7 Correct 67 ms 10220 KB Output is correct
8 Correct 69 ms 10220 KB Output is correct
9 Correct 75 ms 10348 KB Output is correct
10 Correct 68 ms 10220 KB Output is correct
11 Correct 77 ms 10348 KB Output is correct
12 Correct 67 ms 10220 KB Output is correct
13 Correct 71 ms 10220 KB Output is correct
14 Correct 68 ms 10220 KB Output is correct
15 Correct 71 ms 10220 KB Output is correct
16 Correct 70 ms 10348 KB Output is correct
17 Correct 68 ms 10220 KB Output is correct
18 Correct 780 ms 68560 KB Output is correct
19 Correct 780 ms 77664 KB Output is correct
20 Correct 776 ms 68076 KB Output is correct
21 Correct 82 ms 10220 KB Output is correct
22 Correct 70 ms 10220 KB Output is correct
23 Correct 144 ms 12908 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 87 ms 10348 KB Output is correct
3 Correct 70 ms 10348 KB Output is correct
4 Correct 739 ms 74368 KB Output is correct
5 Correct 73 ms 10360 KB Output is correct
6 Correct 74 ms 10348 KB Output is correct
7 Correct 75 ms 10476 KB Output is correct
8 Correct 70 ms 10348 KB Output is correct
9 Correct 71 ms 10348 KB Output is correct
10 Correct 79 ms 10348 KB Output is correct
11 Correct 84 ms 10348 KB Output is correct
12 Correct 69 ms 10348 KB Output is correct
13 Correct 70 ms 10348 KB Output is correct
14 Correct 779 ms 74392 KB Output is correct
15 Correct 67 ms 10348 KB Output is correct
16 Correct 753 ms 68104 KB Output is correct
17 Correct 733 ms 68564 KB Output is correct
18 Incorrect 1 ms 364 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 7 ms 1388 KB Output is correct
3 Correct 9 ms 1388 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 7 ms 1260 KB Output is correct
17 Correct 69 ms 10220 KB Output is correct
18 Incorrect 1 ms 364 KB Output isn't correct