oj.uz

Submission #985082

# Submission time Handle Problem Language Result Execution time Memory
985082 2024-05-17T10:28:10 Z SyedSohaib_123 Strange Device (APIO19_strange_device) C++17
100 / 100
 1731 ms 149584 KB 
#include<bits/stdc++.h>
 
 
 
using namespace std;
 
 
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
 
 
 
#define str string
#define append push_back
#define vector deque
#define vi vector<int>
#define int long long
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define endl '\n'
#define all(ls) ls.begin(),ls.end()
#define sorted(ls) sort(ls.begin(),ls.end());
#define reversed(ls) reverse(ls.begin(),ls.end());
#define print(n) for(auto i:n)cout<<i<<' ';cout<<endl;
#define input(n,ls,m) deque<n>ls(m);for(int i=0;i<m;i++)cin>>ls[i];
#define len(s) s.size()
#define ff first
#define ss second
#define N (int const) 3e5+1
#define pii pair<int,int>
#define SQ(x) ((x)*(x))
#define float double
 
 
int mod=1e9+7;
int mod1=998244353;
 
 
 
int sum_(vector<int>ls){int s=0;for(auto i:ls){s+=i;}return s;}
int min(int a,int b){if (a>b){return b;}return a;}
int max(int a,int b){if (a<b){return b;}return a;}
 
 
 
//......................................tHe ReaL cOdE beGinS HerE....................................../



int solve2(vector<pii> ls,int a,int b){
    map<pair<int,int>,bool>m;
    for(auto i:ls){
        for(int j=i.ff;j<=i.ss;j++){
            m[{(j+j/b)%a,j%b}]=1;
        }
    }
    return len(m);
}


 
void solve(){
    int n,a,b;
    cin>>n>>a>>b;
    vector<pii>ls;
    int cnt=0;
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        cnt+=y-x+1;
        ls.append({x,y});
    }
    if(cnt<=1e6){cout<<solve2(ls,a,b)<<endl;return;}
    a/=gcd(a,b+1);
    a*=b;
    for(auto i:ls){
        if(i.ss-i.ff+1>=a){
            cout<<a<<endl;return;
        }
    }
    vector<pii>q;
    for(auto i:ls){
        int f=i.ff%a,s=i.ss%a;
        if(f<s or i.ff==i.ss) q.append({f,s});
        else{
            q.append({f,a-1});
            q.append({0,s});
        }
    }
    sorted(q);
    map<int,int>hlpr;
    for(auto i:q) hlpr[i.ff]=i.ss;
    vector<pii>q2;
    for(auto i:hlpr) q2.append(i);
    hlpr.clear();
    swap(q2,q);
    for(int i=1;i<q.size();i++){
        if(q[i-1].ss>=q[i].ff){
            q[i].ss=max(q[i].ss,q[i-1].ss);
            q[i].ff=q[i-1].ff;
            hlpr[i-1]=1;
        }
    }
    q2.clear();
    int ans=0;
    for(int i=0;i<q.size();i++){
        if(hlpr[i]){continue;}
        ans+=q[i].ss-q[i].ff+1;
    }
    cout<<ans<<endl;

}
 
 
 
 
 
signed main(){
    int t=1;
    // cin>>t;
    while(t--)
        solve();
}

Compilation message

strange_device.cpp: In function 'void solve()':
strange_device.cpp:99:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i=1;i<q.size();i++){
      |                 ~^~~~~~~~~
strange_device.cpp:108:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for(int i=0;i<q.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 48 ms 12784 KB Output is correct
3 Correct 74 ms 18236 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 8 ms 1328 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 38 ms 7104 KB Output is correct
16 Correct 31 ms 6992 KB Output is correct
17 Correct 125 ms 9836 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 133 ms 32388 KB Output is correct
3 Correct 187 ms 32004 KB Output is correct
4 Correct 121 ms 30680 KB Output is correct
5 Correct 725 ms 33104 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1498 ms 112076 KB Output is correct
3 Correct 1488 ms 131276 KB Output is correct
4 Correct 1467 ms 131348 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1498 ms 112076 KB Output is correct
3 Correct 1488 ms 131276 KB Output is correct
4 Correct 1467 ms 131348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1533 ms 131440 KB Output is correct
7 Correct 1553 ms 131348 KB Output is correct
8 Correct 1544 ms 131472 KB Output is correct
9 Correct 1616 ms 131356 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1498 ms 112076 KB Output is correct
3 Correct 1488 ms 131276 KB Output is correct
4 Correct 1467 ms 131348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 144 ms 13848 KB Output is correct
7 Correct 146 ms 13692 KB Output is correct
8 Correct 168 ms 13908 KB Output is correct
9 Correct 134 ms 13764 KB Output is correct
10 Correct 152 ms 13848 KB Output is correct
11 Correct 133 ms 13880 KB Output is correct
12 Correct 132 ms 13672 KB Output is correct
13 Correct 141 ms 13916 KB Output is correct
14 Correct 133 ms 13908 KB Output is correct
15 Correct 144 ms 13792 KB Output is correct
16 Correct 175 ms 15300 KB Output is correct
17 Correct 136 ms 15224 KB Output is correct
18 Correct 1531 ms 149372 KB Output is correct
19 Correct 1518 ms 149356 KB Output is correct
20 Correct 1610 ms 149424 KB Output is correct
21 Correct 136 ms 15180 KB Output is correct
22 Correct 136 ms 15444 KB Output is correct
23 Correct 327 ms 24056 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 152 ms 11600 KB Output is correct
3 Correct 139 ms 13904 KB Output is correct
4 Correct 1600 ms 131432 KB Output is correct
5 Correct 139 ms 13908 KB Output is correct
6 Correct 139 ms 13724 KB Output is correct
7 Correct 148 ms 13888 KB Output is correct
8 Correct 141 ms 13880 KB Output is correct
9 Correct 139 ms 13904 KB Output is correct
10 Correct 142 ms 13792 KB Output is correct
11 Correct 139 ms 13712 KB Output is correct
12 Correct 135 ms 13740 KB Output is correct
13 Correct 176 ms 13848 KB Output is correct
14 Correct 1649 ms 131256 KB Output is correct
15 Correct 137 ms 15080 KB Output is correct
16 Correct 1487 ms 149212 KB Output is correct
17 Correct 1532 ms 149584 KB Output is correct
18 Correct 1 ms 344 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 48 ms 12784 KB Output is correct
3 Correct 74 ms 18236 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 8 ms 1328 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 38 ms 7104 KB Output is correct
16 Correct 31 ms 6992 KB Output is correct
17 Correct 125 ms 9836 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 133 ms 32388 KB Output is correct
26 Correct 187 ms 32004 KB Output is correct
27 Correct 121 ms 30680 KB Output is correct
28 Correct 725 ms 33104 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1498 ms 112076 KB Output is correct
31 Correct 1488 ms 131276 KB Output is correct
32 Correct 1467 ms 131348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1533 ms 131440 KB Output is correct
35 Correct 1553 ms 131348 KB Output is correct
36 Correct 1544 ms 131472 KB Output is correct
37 Correct 1616 ms 131356 KB Output is correct
38 Correct 0 ms 600 KB Output is correct
39 Correct 144 ms 13848 KB Output is correct
40 Correct 146 ms 13692 KB Output is correct
41 Correct 168 ms 13908 KB Output is correct
42 Correct 134 ms 13764 KB Output is correct
43 Correct 152 ms 13848 KB Output is correct
44 Correct 133 ms 13880 KB Output is correct
45 Correct 132 ms 13672 KB Output is correct
46 Correct 141 ms 13916 KB Output is correct
47 Correct 133 ms 13908 KB Output is correct
48 Correct 144 ms 13792 KB Output is correct
49 Correct 175 ms 15300 KB Output is correct
50 Correct 136 ms 15224 KB Output is correct
51 Correct 1531 ms 149372 KB Output is correct
52 Correct 1518 ms 149356 KB Output is correct
53 Correct 1610 ms 149424 KB Output is correct
54 Correct 136 ms 15180 KB Output is correct
55 Correct 136 ms 15444 KB Output is correct
56 Correct 327 ms 24056 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 152 ms 11600 KB Output is correct
59 Correct 139 ms 13904 KB Output is correct
60 Correct 1600 ms 131432 KB Output is correct
61 Correct 139 ms 13908 KB Output is correct
62 Correct 139 ms 13724 KB Output is correct
63 Correct 148 ms 13888 KB Output is correct
64 Correct 141 ms 13880 KB Output is correct
65 Correct 139 ms 13904 KB Output is correct
66 Correct 142 ms 13792 KB Output is correct
67 Correct 139 ms 13712 KB Output is correct
68 Correct 135 ms 13740 KB Output is correct
69 Correct 176 ms 13848 KB Output is correct
70 Correct 1649 ms 131256 KB Output is correct
71 Correct 137 ms 15080 KB Output is correct
72 Correct 1487 ms 149212 KB Output is correct
73 Correct 1532 ms 149584 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 17 ms 1696 KB Output is correct
80 Correct 1641 ms 149344 KB Output is correct
81 Correct 1609 ms 149256 KB Output is correct
82 Correct 1623 ms 149348 KB Output is correct
83 Correct 1688 ms 149360 KB Output is correct
84 Correct 1731 ms 149352 KB Output is correct
85 Correct 1611 ms 149340 KB Output is correct
86 Correct 324 ms 24032 KB Output is correct
87 Correct 1 ms 348 KB Output is correct