oj.uz

Submission #541862

# Submission time Handle Problem Language Result Execution time Memory
541862 2022-03-24T16:13:34 Z NicolaAbusaad2014 Strange Device (APIO19_strange_device) C++14
100 / 100
 496 ms 69844 KB 
/**
 * Prof.Nicola
**/
#include <bits/stdc++.h>

using namespace std;
#define endl "\n"
#define mp make_pair
#define F first
#define S second
#define REP(i,l,r) for(long long i=(l);i<(r);i++)
#define PER(i,l,r) for(long long i=(r)-1;i>=(l);i--)
#define bitl __builtin_clz
#define bitr __builtin_ctz
#define bits __builtin_popcount
const long dx[4]={1,0,-1,0},dz[4]={0,1,0,-1};
const long double pi=3.14159265359;
const long long mod=1e9+7;
long long p(long long x){while(x&(x-1)){x=x&(x-1);}return x;}
long long squared(long long x){return (x*x)%mod;}
long long power(long long x,long long p){if(p==0){return 1;}if(p%2==1){return (power(x,p-1)*x)%mod;}return squared(power(x,p/2));}
long long inv(long long x){return power(x,mod-2);}
long long log(long long x,long long z){if(x<z){return 0;}return 1+log(x/z,z);}
template<class T>void re(T&x){cin>>x;}
template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);}
template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void out(T x){cout<<x<<" ";}
template<class T1,class T2>void out(pair<T1,T2>x){out(x.first);out(x.second);cout<<endl;}
template<class T>void out(vector<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(deque<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(set<T>x){while(!x.empty()){out(*x.begin());x.erase(*x.begin());}cout<<endl;}
template<class T1,class T2>void out(map<T1,T2>x){while(!x.empty()){out(*x.begin());x.erase(x.begin()->first);}cout<<endl;}
template<class T>void out(queue<T>x){while(!x.empty()){out(x.front());x.pop();}cout<<endl;}
template<class T>void out(priority_queue<T>x){while(!x.empty()){out(x.top());x.pop();}cout<<endl;}
template<class T>void out(stack<T>x){while(!x.empty()){out(x.top());x.pop();}cout<<endl;}
template<class T>T cross(complex<T>x,complex<T>z){return (conj(x)*z).imag();}
template<class T>T dot(complex<T>x,complex<T>z){return (conj(x)*z).real();}
set<long long>::iterator T;
long long vLE(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>x){return -1;}long long z=p(r-l);while(z){if(l+z<=r&&VT[l+z]<=x){l+=z;}z/=2;}return l;}
long long vL(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>=x){return -1;}long long z=p(r-l);while(z){if(l+z<=r&&VT[l+z]<x){l+=z;}z/=2;}return l;}
long long vGE(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>=x){return l;}l=vL(x,VT,l,r);if(l==r){return -1;}return l+1;}
long long vG(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>x){return l;}l=vLE(x,VT,l,r);if(l==r){return -1;}return l+1;}
long long sLE(long long x,set<long long>&ST){if(ST.count(x)){return x;}if(*ST.begin()>x){return -1;}ST.insert(x);T=ST.find(x);T--;ST.erase(x);return *T;}
long long sL(long long x,set<long long>&ST){if(*ST.begin()>=x){return -1;}if(ST.count(x)){T=ST.find(x);T--;return *T;}ST.insert(x);T=ST.find(x);T--;ST.erase(x);return *T;}
long long sGE(long long x,set<long long>&ST){if(ST.count(x)){return x;}if(*ST.rbegin()<x){return -1;}ST.insert(x);T=ST.find(x);T++;ST.erase(x);return *T;}
long long sG(long long x,set<long long>&ST){if(*ST.rbegin()<=x){return -1;}if(ST.count(x)){T=ST.find(x);T++;return *T;}ST.insert(x);T=ST.find(x);T++;ST.erase(x);return *T;}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long n,A,B,s,ans=0,l,r,mx;
    cin>>n>>A>>B;
    vector<pair<long long,long long> >v(n),srt;
    re(v);
    REP(i,0,n){
        ans+=v[i].S-v[i].F+1;
    }
    if(log(A)+log(B)-log(__gcd(A,B+1))>log(2e18)){
        cout<<ans<<endl;
        return 0;
    }
    s=B*(A/__gcd(A,B+1));
    REP(i,0,n){
        if(v[i].S-v[i].F+1>=s){
            cout<<s<<endl;
            return 0;
        }
        l=v[i].F%s;
        r=v[i].S%s;
        if(l<=r){
            srt.push_back(mp(l,r));
            continue;
        }
        srt.push_back(mp(0,r));
        srt.push_back(mp(l,s-1));
    }
    sort(srt.begin(),srt.end());
    ans=srt[0].S-srt[0].F+1;
    mx=srt[0].S;
    REP(j,1,srt.size()){
        mx=max(mx,srt[j].F-1);
        ans+=max(0ll,srt[j].S-mx);
        mx=max(mx,srt[j].S);
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:11:41: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define REP(i,l,r) for(long long i=(l);i<(r);i++)
      |                                         ^
strange_device.cpp:81:5: note: in expansion of macro 'REP'
   81 |     REP(j,1,srt.size()){
      |     ^~~
strange_device.cpp: In instantiation of 'void re(std::vector<_Tp>&) [with T = std::pair<long long int, long long int>]':
strange_device.cpp:55:9:   required from here
strange_device.cpp:26:53: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
      |                                                    ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 7 ms 1108 KB Output is correct
17 Correct 49 ms 4300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 309 ms 32732 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 408 ms 33016 KB Output is correct
3 Correct 402 ms 38328 KB Output is correct
4 Correct 433 ms 38428 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 408 ms 33016 KB Output is correct
3 Correct 402 ms 38328 KB Output is correct
4 Correct 433 ms 38428 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 427 ms 38384 KB Output is correct
7 Correct 429 ms 38392 KB Output is correct
8 Correct 422 ms 38376 KB Output is correct
9 Correct 464 ms 38388 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 408 ms 33016 KB Output is correct
3 Correct 402 ms 38328 KB Output is correct
4 Correct 433 ms 38428 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 44 ms 7748 KB Output is correct
7 Correct 45 ms 7756 KB Output is correct
8 Correct 44 ms 7752 KB Output is correct
9 Correct 47 ms 7748 KB Output is correct
10 Correct 42 ms 7752 KB Output is correct
11 Correct 43 ms 7756 KB Output is correct
12 Correct 44 ms 7744 KB Output is correct
13 Correct 46 ms 7752 KB Output is correct
14 Correct 42 ms 7756 KB Output is correct
15 Correct 46 ms 7748 KB Output is correct
16 Correct 46 ms 7764 KB Output is correct
17 Correct 43 ms 7748 KB Output is correct
18 Correct 427 ms 69648 KB Output is correct
19 Correct 427 ms 69640 KB Output is correct
20 Correct 469 ms 69708 KB Output is correct
21 Correct 48 ms 7756 KB Output is correct
22 Correct 42 ms 7752 KB Output is correct
23 Correct 137 ms 26508 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 41 ms 4064 KB Output is correct
3 Correct 45 ms 4060 KB Output is correct
4 Correct 475 ms 38228 KB Output is correct
5 Correct 47 ms 7748 KB Output is correct
6 Correct 46 ms 7764 KB Output is correct
7 Correct 47 ms 7744 KB Output is correct
8 Correct 46 ms 7880 KB Output is correct
9 Correct 46 ms 7788 KB Output is correct
10 Correct 46 ms 7752 KB Output is correct
11 Correct 48 ms 7760 KB Output is correct
12 Correct 42 ms 7756 KB Output is correct
13 Correct 46 ms 7744 KB Output is correct
14 Correct 451 ms 38084 KB Output is correct
15 Correct 47 ms 7756 KB Output is correct
16 Correct 433 ms 69624 KB Output is correct
17 Correct 422 ms 69840 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 7 ms 1108 KB Output is correct
17 Correct 49 ms 4300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 309 ms 32732 KB Output is correct
29 Correct 1 ms 224 KB Output is correct
30 Correct 408 ms 33016 KB Output is correct
31 Correct 402 ms 38328 KB Output is correct
32 Correct 433 ms 38428 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 427 ms 38384 KB Output is correct
35 Correct 429 ms 38392 KB Output is correct
36 Correct 422 ms 38376 KB Output is correct
37 Correct 464 ms 38388 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 44 ms 7748 KB Output is correct
40 Correct 45 ms 7756 KB Output is correct
41 Correct 44 ms 7752 KB Output is correct
42 Correct 47 ms 7748 KB Output is correct
43 Correct 42 ms 7752 KB Output is correct
44 Correct 43 ms 7756 KB Output is correct
45 Correct 44 ms 7744 KB Output is correct
46 Correct 46 ms 7752 KB Output is correct
47 Correct 42 ms 7756 KB Output is correct
48 Correct 46 ms 7748 KB Output is correct
49 Correct 46 ms 7764 KB Output is correct
50 Correct 43 ms 7748 KB Output is correct
51 Correct 427 ms 69648 KB Output is correct
52 Correct 427 ms 69640 KB Output is correct
53 Correct 469 ms 69708 KB Output is correct
54 Correct 48 ms 7756 KB Output is correct
55 Correct 42 ms 7752 KB Output is correct
56 Correct 137 ms 26508 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 41 ms 4064 KB Output is correct
59 Correct 45 ms 4060 KB Output is correct
60 Correct 475 ms 38228 KB Output is correct
61 Correct 47 ms 7748 KB Output is correct
62 Correct 46 ms 7764 KB Output is correct
63 Correct 47 ms 7744 KB Output is correct
64 Correct 46 ms 7880 KB Output is correct
65 Correct 46 ms 7788 KB Output is correct
66 Correct 46 ms 7752 KB Output is correct
67 Correct 48 ms 7760 KB Output is correct
68 Correct 42 ms 7756 KB Output is correct
69 Correct 46 ms 7744 KB Output is correct
70 Correct 451 ms 38084 KB Output is correct
71 Correct 47 ms 7756 KB Output is correct
72 Correct 433 ms 69624 KB Output is correct
73 Correct 422 ms 69840 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 316 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 316 KB Output is correct
78 Correct 1 ms 320 KB Output is correct
79 Correct 5 ms 1236 KB Output is correct
80 Correct 481 ms 69716 KB Output is correct
81 Correct 496 ms 69776 KB Output is correct
82 Correct 456 ms 69712 KB Output is correct
83 Correct 449 ms 69844 KB Output is correct
84 Correct 444 ms 69588 KB Output is correct
85 Correct 473 ms 69584 KB Output is correct
86 Correct 132 ms 26496 KB Output is correct
87 Correct 1 ms 212 KB Output is correct