oj.uz

Submission #940776

# Submission time Handle Problem Language Result Execution time Memory
940776 2024-03-07T15:42:41 Z GrindMachine Strange Device (APIO19_strange_device) C++17
10 / 100
 339 ms 34148 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 prod = 0;
    if(A > inf2/B){
        prod = inf2;
    }
    else{
        prod = A*B;
    }

    vector<pll> b;

    rep1(i,n){
        auto [l,r] = a[i];
        amin(r,l+prod-1);
        l %= prod, r %= prod;
        if(l <= r){
            b.pb({l,r});
        }
        else{
            b.pb({l,prod-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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 31 ms 4208 KB Output is correct
3 Correct 32 ms 4204 KB Output is correct
4 Correct 339 ms 34148 KB Output is correct
5 Correct 31 ms 4044 KB Output is correct
6 Correct 31 ms 4048 KB Output is correct
7 Correct 31 ms 4032 KB Output is correct
8 Correct 33 ms 4056 KB Output is correct
9 Correct 31 ms 4056 KB Output is correct
10 Correct 31 ms 4056 KB Output is correct
11 Correct 32 ms 4056 KB Output is correct
12 Correct 28 ms 4048 KB Output is correct
13 Correct 31 ms 4056 KB Output is correct
14 Correct 325 ms 34128 KB Output is correct
15 Incorrect 33 ms 4044 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -