oj.uz

Submission #527008

# Submission time Handle Problem Language Result Execution time Memory
527008 2022-02-16T19:41:11 Z Lobo Strange Device (APIO19_strange_device) C++17
30 / 100
 491 ms 16952 KB 
#include<bits/stdc++.h>
using namespace std;
 
const long long inf = (long long) 2e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
#define maxn 
 
void solve() {
    int n, a, b;
    cin >> n >> a >> b;
    int gc = __gcd(a,b+1);
    int q = (b+1)/gc;
    int m;
    if(log2(a) + log2(b) + log2(q) - log2(b+1) > log2(inf)) m = inf;
    else m = (a*b*q)/(b+1);
 
    vector<pair<int,int>> lr;
 
    for(int i = 1; i <= n; i++) {
        int l, r; cin >> l >> r;
 
        if(r-l+1 >= m) {
            lr.pb(mp(0,m-1));
        }
        else if(l/m != r/m) {
            //terminam em cantos diferentes
            l%= m;
            r%= m;
            //colocar l,m-1 e 0,r
            lr.pb(mp(l,m-1));
            lr.pb(mp(0,r));
        }
        else {
            l%= m;
            r%= m;
            lr.pb(mp(l,r));
        }
    }
 
    sort(all(lr));
 
    int l = 0;
    int r = -1;
    int ans = 0;
    for(auto x : lr) {
        int l1 = x.fr;
        int r1 = x.sc;

 
        if(l1 > r) {
            //conta o lr anterior e comeca um novo
            ans+= r-l+1;
            l = l1;
            r = r1;
        }
        r = max(r,r1);
    }
 
    ans+= r-l+1;
    cout << ans << endl;
 
 
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
 
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
 
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1084 KB Output is correct
3 Correct 7 ms 1028 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 1008 KB Output is correct
17 Correct 48 ms 3552 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 284 ms 16804 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 390 ms 16928 KB Output is correct
3 Correct 390 ms 16924 KB Output is correct
4 Correct 370 ms 16952 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 390 ms 16928 KB Output is correct
3 Correct 390 ms 16924 KB Output is correct
4 Correct 370 ms 16952 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 402 ms 16916 KB Output is correct
7 Correct 380 ms 16896 KB Output is correct
8 Correct 381 ms 16872 KB Output is correct
9 Correct 403 ms 16944 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 390 ms 16928 KB Output is correct
3 Correct 390 ms 16924 KB Output is correct
4 Correct 370 ms 16952 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 53 ms 3752 KB Output is correct
7 Correct 48 ms 3908 KB Output is correct
8 Correct 43 ms 3968 KB Output is correct
9 Correct 43 ms 4096 KB Output is correct
10 Correct 52 ms 4288 KB Output is correct
11 Correct 41 ms 4228 KB Output is correct
12 Correct 38 ms 4276 KB Output is correct
13 Incorrect 36 ms 4380 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 42 ms 4244 KB Output is correct
3 Correct 43 ms 4184 KB Output is correct
4 Correct 491 ms 16916 KB Output is correct
5 Incorrect 36 ms 4668 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1084 KB Output is correct
3 Correct 7 ms 1028 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 1008 KB Output is correct
17 Correct 48 ms 3552 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 312 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 284 ms 16804 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 390 ms 16928 KB Output is correct
31 Correct 390 ms 16924 KB Output is correct
32 Correct 370 ms 16952 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 402 ms 16916 KB Output is correct
35 Correct 380 ms 16896 KB Output is correct
36 Correct 381 ms 16872 KB Output is correct
37 Correct 403 ms 16944 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 53 ms 3752 KB Output is correct
40 Correct 48 ms 3908 KB Output is correct
41 Correct 43 ms 3968 KB Output is correct
42 Correct 43 ms 4096 KB Output is correct
43 Correct 52 ms 4288 KB Output is correct
44 Correct 41 ms 4228 KB Output is correct
45 Correct 38 ms 4276 KB Output is correct
46 Incorrect 36 ms 4380 KB Output isn't correct
47 Halted 0 ms 0 KB -