Submission #721646

#	Time	Username	Problem	Language	Result	Execution time	Memory
721646		victor_gao	Strange Device (APIO19_strange_device)	C++17	5 / 100	359 ms	12016 KiB

strange_device

//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int findt(int a,int b){
    int go=b+1,g=__gcd(go,a);
   // cout<<go<<" "<<a<<' '<<b<<" "<<g<<'\n';
    // lcm(go,a)/go*b
    return a/g*b;
}
int vis[1500000];
signed main(){
    fast
    int n,a,b; cin>>n>>a>>b;
    int t=findt(a,b);
    for (int i=1;i<=n;i++){
        int l,r; cin>>l>>r;
        l%=t; r%=t;
        if (l<=r){
            vis[l]++; vis[r+1]--;
        }
        else {
            vis[0]++; vis[r+1]--;
            vis[l]++; vis[t]--;
        }
    }
    int ans=0;
    for (int i=0;i<1500000;i++){
        if (i) vis[i]+=vis[i-1];
        ans+=(vis[i]>0);
    }
    cout<<ans<<'\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 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