Submission #252134

#	Time	Username	Problem	Language	Result	Execution time	Memory
252134		khangal	Strange Device (APIO19_strange_device)	C++14	35 / 100	2463 ms	181380 KiB

strange_device

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,x,y,r,z,h,a[1234567],w,c1[1234][1234];
bool used[1234567],used1[1234567];
pl p[1234567];
string s,s1[1234567];
map<ll,ll> mp;
map<pl,ll> mpl;
vector<pl> vec,vec1,ansvec;
vector<ll> v[1234567],v1[1234567];
vector<ll> vp[1234567];
set<pl> st;
set<ll> stl,str;
stack <ll> sta;
int main(){
    ll A,B;
    cin>>n>>A>>B;
    ll L[1234567],R[1234567];
    ll t = A/__gcd(A,(B+1))*B;
    rep(i,1,n)cin>>L[i]>>R[i];
    rep(i,1,n){
        l=L[i];
        r=R[i];
        if(r - l + 1 >= t)
            return cout << t , 0;
        l %= t, r %= t;
        if(l > r){
            vec.pb({l , -1});
            vec.pb({t , 1});
            vec.pb({0 , -1});
            vec.pb({r + 1 , 1});
        }
        else{
            vec.pb({l, -1});
            vec.pb({r + 1, 1});
        }
    }
    sort(vec.begin() , vec.end());
    for(auto i : vec){
        if(i.ss == 1) {
            if(sta.size() == 1)
                ans += i.ff - sta.top();
            sta.pop();
        }
        else
            sta.push(i.ff);
    }
    cout<<ans;
}

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