Submission #362215

#	Time	Username	Problem	Language	Result	Execution time	Memory
362215		alirezasamimi100	Strange Device (APIO19_strange_device)	C++17	100 / 100	562 ms	32616 KiB

strange_device

#include <bits/stdc++.h>
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
/*#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")*/
using namespace std;
using ll = long long int;
#define F first
#define S second
#define pb push_back
#define lc v<<1
#define rc v<<1|1
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N=5e5+10,LN=20,M=5e4+10,SQ=250,inf=1e9;
const ll INF=1e18;
const int MOD=1000000007 /*998244353*/;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}
ll n,a,b,c,ans,mr=-1;
vector<pll> v;
int main(){
    fast_io;
    cin >> n >> a >> b;
    c=a/__gcd(a,b+1);
    if(c>1e18/b+1) c=1e18+1;
    else c*=b;
    for(ll i=1; i<=n; i++){
        ll l,r;
        cin >> l >> r;
        if(r-l+1>=c) return cout << c << '\n', 0;
        l%=c;
        r%=c;
        if(r>=l) v.pb({l,r});
        else{
            v.pb({l,c-1});
            v.pb({0,r});
        }
    }
    sort(v.begin(),v.end());
    for(auto [l,r] : v){
        l=max(l,mr+1);
        if(l>r) continue;
        ans+=r-l+1;
        mr=r;
    }
    cout << ans << '\n';
    return 0;
}

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