oj.uz

Submission #940821

# Submission time Handle Problem Language Result Execution time Memory
940821 2024-03-07T16:52:25 Z GrindMachine Strange Device (APIO19_strange_device) C++17
100 / 100
 378 ms 71620 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions long time ago, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,A,B; cin >> n >> A >> B;
    vector<pll> a(n+5);
    rep1(i,n) cin >> a[i].ff >> a[i].ss;

    ll g = gcd(A,B+1);
    ll k = A/g;
    ll period = 0;

    if(k > inf2/B){
        period = inf2;
    }
    else{
        period = k*B;
    }

    vector<pll> b;
 
    rep1(i,n){
        auto [l,r] = a[i];
        amin(r,l+period-1);
        l %= period, r %= period;
        if(l <= r){
            b.pb({l,r});
        }
        else{
            b.pb({l,period-1});
            b.pb({0,r});
        }
    }
 
    sort(all(b));
    ll mx_reach = -1;
    ll ans = 0;
 
    for(auto [l,r] : b){
        if(l > mx_reach){
            ans += r-l+1;
        }
        else{
            ans += max(r-mx_reach,0ll);
        }
 
        amax(mx_reach,r);
    }
 
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 1232 KB Output is correct
3 Correct 4 ms 1372 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 1380 KB Output is correct
17 Correct 34 ms 6132 KB Output is correct
18 Correct 1 ms 344 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 270 ms 33124 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 307 ms 33880 KB Output is correct
3 Correct 300 ms 71492 KB Output is correct
4 Correct 303 ms 70476 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 307 ms 33880 KB Output is correct
3 Correct 300 ms 71492 KB Output is correct
4 Correct 303 ms 70476 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 306 ms 71240 KB Output is correct
7 Correct 299 ms 69828 KB Output is correct
8 Correct 307 ms 70976 KB Output is correct
9 Correct 333 ms 70472 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 307 ms 33880 KB Output is correct
3 Correct 300 ms 71492 KB Output is correct
4 Correct 303 ms 70476 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 36 ms 7768 KB Output is correct
7 Correct 34 ms 7888 KB Output is correct
8 Correct 31 ms 7684 KB Output is correct
9 Correct 30 ms 7896 KB Output is correct
10 Correct 30 ms 7888 KB Output is correct
11 Correct 32 ms 7824 KB Output is correct
12 Correct 30 ms 7888 KB Output is correct
13 Correct 32 ms 7888 KB Output is correct
14 Correct 29 ms 7880 KB Output is correct
15 Correct 33 ms 7880 KB Output is correct
16 Correct 36 ms 7884 KB Output is correct
17 Correct 30 ms 7884 KB Output is correct
18 Correct 347 ms 70092 KB Output is correct
19 Correct 346 ms 70472 KB Output is correct
20 Correct 330 ms 70592 KB Output is correct
21 Correct 34 ms 7884 KB Output is correct
22 Correct 29 ms 7772 KB Output is correct
23 Correct 94 ms 27780 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 34 ms 7764 KB Output is correct
3 Correct 33 ms 7896 KB Output is correct
4 Correct 356 ms 71620 KB Output is correct
5 Correct 39 ms 7884 KB Output is correct
6 Correct 34 ms 7772 KB Output is correct
7 Correct 33 ms 7896 KB Output is correct
8 Correct 35 ms 7884 KB Output is correct
9 Correct 34 ms 7888 KB Output is correct
10 Correct 35 ms 7772 KB Output is correct
11 Correct 33 ms 7888 KB Output is correct
12 Correct 31 ms 7896 KB Output is correct
13 Correct 33 ms 7884 KB Output is correct
14 Correct 336 ms 69700 KB Output is correct
15 Correct 35 ms 7740 KB Output is correct
16 Correct 311 ms 70340 KB Output is correct
17 Correct 310 ms 69704 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 1232 KB Output is correct
3 Correct 4 ms 1372 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 1380 KB Output is correct
17 Correct 34 ms 6132 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 270 ms 33124 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 307 ms 33880 KB Output is correct
31 Correct 300 ms 71492 KB Output is correct
32 Correct 303 ms 70476 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 306 ms 71240 KB Output is correct
35 Correct 299 ms 69828 KB Output is correct
36 Correct 307 ms 70976 KB Output is correct
37 Correct 333 ms 70472 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 36 ms 7768 KB Output is correct
40 Correct 34 ms 7888 KB Output is correct
41 Correct 31 ms 7684 KB Output is correct
42 Correct 30 ms 7896 KB Output is correct
43 Correct 30 ms 7888 KB Output is correct
44 Correct 32 ms 7824 KB Output is correct
45 Correct 30 ms 7888 KB Output is correct
46 Correct 32 ms 7888 KB Output is correct
47 Correct 29 ms 7880 KB Output is correct
48 Correct 33 ms 7880 KB Output is correct
49 Correct 36 ms 7884 KB Output is correct
50 Correct 30 ms 7884 KB Output is correct
51 Correct 347 ms 70092 KB Output is correct
52 Correct 346 ms 70472 KB Output is correct
53 Correct 330 ms 70592 KB Output is correct
54 Correct 34 ms 7884 KB Output is correct
55 Correct 29 ms 7772 KB Output is correct
56 Correct 94 ms 27780 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 34 ms 7764 KB Output is correct
59 Correct 33 ms 7896 KB Output is correct
60 Correct 356 ms 71620 KB Output is correct
61 Correct 39 ms 7884 KB Output is correct
62 Correct 34 ms 7772 KB Output is correct
63 Correct 33 ms 7896 KB Output is correct
64 Correct 35 ms 7884 KB Output is correct
65 Correct 34 ms 7888 KB Output is correct
66 Correct 35 ms 7772 KB Output is correct
67 Correct 33 ms 7888 KB Output is correct
68 Correct 31 ms 7896 KB Output is correct
69 Correct 33 ms 7884 KB Output is correct
70 Correct 336 ms 69700 KB Output is correct
71 Correct 35 ms 7740 KB Output is correct
72 Correct 311 ms 70340 KB Output is correct
73 Correct 310 ms 69704 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 3 ms 1236 KB Output is correct
80 Correct 378 ms 69828 KB Output is correct
81 Correct 370 ms 71492 KB Output is correct
82 Correct 332 ms 69960 KB Output is correct
83 Correct 319 ms 71496 KB Output is correct
84 Correct 327 ms 70216 KB Output is correct
85 Correct 321 ms 70596 KB Output is correct
86 Correct 95 ms 27848 KB Output is correct
87 Correct 0 ms 348 KB Output is correct