Submission #1100588

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100588		vjudge1	Strange Device (APIO19_strange_device)	C++17	100 / 100	1030 ms	163024 KiB

strange_device

// Bolatulu
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define kanagattandirilmagandiktarinizdan ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define fx cout << fixed << setprecision(6);
#define md (tl+tr)/2
#define TL v+v, tl,md
#define TR v+v+1, md+1,tr
#define Tl t[v].l, tl,md
#define Tr t[v].r, md+1,tr
#define yes cout << "Yes\n"
#define no cout << "No\n"
#define all(x) (x).begin(), (x).end()
#define int ull
#define cnk(n,k) mod(mod(f[(n)]*binpow(f[(n)-(k)],M-2))*binpow(f[(k)],M-2))
#define cnkf(n,k) mod(mod(f[(n)]*inv[(n)-(k)])*inv[(k)])

using namespace std;

typedef complex<double> cd;

struct mine{int l;int r;int i;};
struct edge{int u;int v;int w;};
struct tree{int l;int r;int val;};

bool cmp(edge a,edge b) {
    return a.w>b.w;
}

mt19937 RR((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
 
int random(int l, int r){
  return uniform_int_distribution<int>(l, r)(RR);
}

int M=998244353;

int mod1(int a,int b=M) {
    if (a<0)
        a=b+a%b;
    return a % b;
}

int binpow(int a,int n,int m=M) {
    a=mod1(a,m);
    if (!n)
        return 1;
    if (n&1)
        return (a * binpow(a,n-1))%m;
    int x = binpow(a,n>>1);
    return (x*x)%m; 
}

const double pi = acos(-1);
const cd I = sqrt(cd(-1));
const int INF=1e18+7;
const int N=1e6+7;
const int root = 5;
const int root_1 = 4404020;
const int root_pw = 1 << 20;
int mod=7340033;

int n,A,B,l[N],r[N],m;
set <int> s;
map <int,int> add,del;

void addf(int l,int r) {
    s.insert(l);
    add[l]++;
    s.insert(r+1);
    add[r+1]--;
}

void solve() {
    cin >> n >> A >> B;
    db d=A*B/__gcd(A,B+1);
    // cout << d << ' ';
    if (INF>=d)
        m=d;
    else
        m=INF;
    for (int i=1;i<=n;i++) {
        cin >> l[i] >> r[i];
        if (r[i]-l[i]+1>=m) {
            cout << m;
            return;
        }
        int posl=(l[i])%m;
        int posr=(r[i])%m;
        if (posl<=posr)
            addf(posl,posr);
        else {
            addf(posl,m-1);
            addf(0,posr);
        }
    }
    int cnt=0,ans=0,last=0;
    for (auto now : s) {
        if (cnt>0)
            ans+=(now-last);
        cnt+=add[now];
        last=now;
    }
    cout << ans;
}   

signed main() {
    /*
    freopen("sequence.in", "r", stdin);
    freopen("sequence.out", "w", stdout);
    */
    // fx
    kanagattandirilmagandiktarinizdan
    int test = 1, count = 1;
    // cin >> test;
    while (test--) {
        // cout << "Case " << count << ":\n";
        solve();
        if (test) {
            cout << '\n';
            count++;
        }
    }
    return 0;
}

// ctrl + shift + p make stress isis__Good isis__Generator

// g++ -std=c++17 (path) -o run
// .\run

• 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