oj.uz

Submission #527022

# Submission time Handle Problem Language Result Execution time Memory
527022 2022-02-16T19:55:13 Z Lobo Strange Device (APIO19_strange_device) C++17
30 / 100
 445 ms 16904 KB 
#include<bits/stdc++.h>
using namespace std;
 
const long long inf = (long long) 4e18 + 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 

int gcd(int a, int b) {
    if(b == 0) return a;
    a%=b;
    return gcd(b,a);
}
 
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);

    int af = 2;
    if(m == inf) {
        int af = 1000000;
    }
    map<int,int> asdf[af];
 
    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();
 
}

Compilation message

strange_device.cpp: In function 'void solve()':
strange_device.cpp:34:13: warning: unused variable 'af' [-Wunused-variable]
   34 |         int af = 1000000;
      |             ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 40 ms 2512 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 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 268 ms 16804 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 395 ms 16828 KB Output is correct
3 Correct 375 ms 16896 KB Output is correct
4 Correct 417 ms 16848 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 395 ms 16828 KB Output is correct
3 Correct 375 ms 16896 KB Output is correct
4 Correct 417 ms 16848 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 396 ms 16788 KB Output is correct
7 Correct 390 ms 16820 KB Output is correct
8 Correct 363 ms 16788 KB Output is correct
9 Correct 407 ms 16804 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 395 ms 16828 KB Output is correct
3 Correct 375 ms 16896 KB Output is correct
4 Correct 417 ms 16848 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 38 ms 2456 KB Output is correct
7 Correct 39 ms 2444 KB Output is correct
8 Correct 36 ms 2468 KB Output is correct
9 Correct 36 ms 2496 KB Output is correct
10 Correct 39 ms 2504 KB Output is correct
11 Correct 38 ms 2528 KB Output is correct
12 Correct 35 ms 2436 KB Output is correct
13 Incorrect 32 ms 2488 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 47 ms 2504 KB Output is correct
3 Correct 41 ms 2528 KB Output is correct
4 Correct 445 ms 16904 KB Output is correct
5 Incorrect 33 ms 2448 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 4 ms 716 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 40 ms 2512 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 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 268 ms 16804 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 395 ms 16828 KB Output is correct
31 Correct 375 ms 16896 KB Output is correct
32 Correct 417 ms 16848 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 396 ms 16788 KB Output is correct
35 Correct 390 ms 16820 KB Output is correct
36 Correct 363 ms 16788 KB Output is correct
37 Correct 407 ms 16804 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 38 ms 2456 KB Output is correct
40 Correct 39 ms 2444 KB Output is correct
41 Correct 36 ms 2468 KB Output is correct
42 Correct 36 ms 2496 KB Output is correct
43 Correct 39 ms 2504 KB Output is correct
44 Correct 38 ms 2528 KB Output is correct
45 Correct 35 ms 2436 KB Output is correct
46 Incorrect 32 ms 2488 KB Output isn't correct
47 Halted 0 ms 0 KB -