제출 #1201647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1201647		Malix	Strange Device (APIO19_strange_device)	C++20	35 / 100	314 ms	17060 KiB

strange_device

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))

ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
ios::sync_with_stdio(0);
cin.tie(0);
    int n;ll A,B;cin>>n>>A>>B;
    // ll k=A*B;
    ll k=(A/__gcd(A,B+1))*B;
    vector<pair<ll,ll>> a;
    REP(i,0,n){
        ll x,y;cin>>x>>y;
        if(y-x>=k){
            a.PB({0,k-1});
            continue;
        }
        x%=k;y%=k;
        if(x<=y)a.PB({x,y});
        else{
            a.PB({0,y});
            a.PB({x,k-1});
        }
    }
    sort(a.begin(),a.end());
    ll ans=a[0].S-a[0].F+1,l=a[0].S;
    int pos=1;
    n=a.size();
    while(pos<n){
        while(pos<n&&a[pos].S<=l)pos++;
        if(pos==n)break;
        ans+=a[pos].S-max(l,a[pos].F-1);
        l=a[pos].S;
    }
    cout<<min(ans,k);
}

• 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