Submission #1255326

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255326		M_SH_O	Strange Device (APIO19_strange_device)	C++20	10 / 100	264 ms	16800 KiB

strange_device

#include <bits/stdc++.h>
//#include "rainbow.h"

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

const ll INF = 5e18;
const int lg = 20;

mt19937 rng(time(0));
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    ll n, a, b;
    cin >> n >> a >> b;
    set<pll> s;
    ll x = max(b, a-a/b);
    ll res = 0;
    vpll v;
    
    for(int i = 0; i < n; i ++){
        ll l, r;
        cin >> l >> r;
        if(INF/a < b){
            res += r-l+1;
            continue;
        }
        else{
            if(r-l+1 >= a*b){
                cout << a*b << endl;
                return 0;
            }
            v.pb({l%(a*b), r%(a*b)});
            if(v.back().se < v.back().fr){
                pll p = v.back();
                v.pop_back();
                v.pb({p.fr, a*b-1});
                v.pb({0, p.se});
            }
        }
        /*for(auto j : v){
            cout << j.fr << ' ' << j.se << endl;
        }
        cout << endl;*/
    }
    
    sort(v);
    
    if(res != 0) cout << res << endl;
    else{
        ll l = v[0].fr, r = v[0].se;
        for(int i = 0; i < v.size(); i ++){
            //cout << v[i].fr << ' ' << v[i].se << endl;
            
            if(v[i].fr <= r) r = max(r, v[i].se);
            else{
                res += r-l+1;
                l = v[i].fr, r = v[i].se;
            }
        }
        res += r-l+1;
        cout << res << endl;
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30