oj.uz

Submission #321741

# Submission time Handle Problem Language Result Execution time Memory
321741 2020-11-13T08:44:52 Z zaneyu Strange Device (APIO19_strange_device) C++14
100 / 100
 579 ms 70104 KB 
/*input
3 1
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll sub(ll a,ll b){
    ll x=a-b;
    while(x<0) x+=MOD;
    while(x>MOD) x-=MOD;
    return x;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
typedef pair<ll,ll> ii;

int n;
ll a, b, t;

vector<ii> p;

const ll MAXT = 1e18+18;

int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n>>a>>b;
    p.resize(n);
    for(int i=0;i<n;++i){
        cin>>p[i].f>>p[i].s;
    }
    a = a/__gcd(a, b+1);
    if(b>MAXT/a){ //every t has a distinct pair
        ll sol = 0;
        for(auto i:p){
            sol += i.second-i.first+1;
        }
        cout<<sol;
    }else{ //pairs repeat every t moments
        ll t = a*b;
        vector<ii> p2;
        for(auto i:p){
            if(i.first/t==i.second/t){
                p2.push_back(ii(i.first%t, i.second%t));
            }else if(i.first/t+1==i.second/t){
                p2.push_back(ii(i.first%t, t-1));
                p2.push_back(ii(0, i.second%t));
            }else{
                cout<<t;
                return 0;
            }
        }
        sort(p2.begin(), p2.end());
        ll s, e, sol=0;
        for(int i=0, j=0;i<p2.size();i=j){
            s=p2[i].first;e=p2[i].second;
            for(;j<p2.size() && p2[j].first<=e;++j){
                e=max(e, p2[j].second);
            }
            sol+=e-s+1;
        }
        cout<<sol;
    }

}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:91:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int i=0, j=0;i<p2.size();i=j){
      |                          ~^~~~~~~~~~
strange_device.cpp:93:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |             for(;j<p2.size() && p2[j].first<=e;++j){
      |                  ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 1260 KB Output is correct
3 Correct 7 ms 1260 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1260 KB Output is correct
17 Correct 54 ms 7784 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 366 ms 57820 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 516 ms 69720 KB Output is correct
3 Correct 494 ms 69976 KB Output is correct
4 Correct 490 ms 69980 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 516 ms 69720 KB Output is correct
3 Correct 494 ms 69976 KB Output is correct
4 Correct 490 ms 69980 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 497 ms 69724 KB Output is correct
7 Correct 497 ms 69720 KB Output is correct
8 Correct 495 ms 70104 KB Output is correct
9 Correct 547 ms 69724 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 516 ms 69720 KB Output is correct
3 Correct 494 ms 69976 KB Output is correct
4 Correct 490 ms 69980 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 49 ms 7784 KB Output is correct
7 Correct 54 ms 7784 KB Output is correct
8 Correct 49 ms 7784 KB Output is correct
9 Correct 50 ms 7784 KB Output is correct
10 Correct 49 ms 7784 KB Output is correct
11 Correct 50 ms 7784 KB Output is correct
12 Correct 48 ms 7784 KB Output is correct
13 Correct 51 ms 7784 KB Output is correct
14 Correct 49 ms 7784 KB Output is correct
15 Correct 53 ms 7784 KB Output is correct
16 Correct 53 ms 7784 KB Output is correct
17 Correct 49 ms 7784 KB Output is correct
18 Correct 503 ms 70000 KB Output is correct
19 Correct 483 ms 69916 KB Output is correct
20 Correct 546 ms 70048 KB Output is correct
21 Correct 53 ms 7784 KB Output is correct
22 Correct 48 ms 7784 KB Output is correct
23 Correct 152 ms 26592 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 54 ms 7784 KB Output is correct
3 Correct 51 ms 7784 KB Output is correct
4 Correct 579 ms 69852 KB Output is correct
5 Correct 52 ms 7784 KB Output is correct
6 Correct 51 ms 7784 KB Output is correct
7 Correct 52 ms 7784 KB Output is correct
8 Correct 53 ms 7784 KB Output is correct
9 Correct 50 ms 7784 KB Output is correct
10 Correct 57 ms 7912 KB Output is correct
11 Correct 52 ms 7784 KB Output is correct
12 Correct 46 ms 7784 KB Output is correct
13 Correct 51 ms 7912 KB Output is correct
14 Correct 539 ms 69792 KB Output is correct
15 Correct 53 ms 7784 KB Output is correct
16 Correct 494 ms 69852 KB Output is correct
17 Correct 495 ms 69720 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 1260 KB Output is correct
3 Correct 7 ms 1260 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1260 KB Output is correct
17 Correct 54 ms 7784 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 366 ms 57820 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 516 ms 69720 KB Output is correct
31 Correct 494 ms 69976 KB Output is correct
32 Correct 490 ms 69980 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 497 ms 69724 KB Output is correct
35 Correct 497 ms 69720 KB Output is correct
36 Correct 495 ms 70104 KB Output is correct
37 Correct 547 ms 69724 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 49 ms 7784 KB Output is correct
40 Correct 54 ms 7784 KB Output is correct
41 Correct 49 ms 7784 KB Output is correct
42 Correct 50 ms 7784 KB Output is correct
43 Correct 49 ms 7784 KB Output is correct
44 Correct 50 ms 7784 KB Output is correct
45 Correct 48 ms 7784 KB Output is correct
46 Correct 51 ms 7784 KB Output is correct
47 Correct 49 ms 7784 KB Output is correct
48 Correct 53 ms 7784 KB Output is correct
49 Correct 53 ms 7784 KB Output is correct
50 Correct 49 ms 7784 KB Output is correct
51 Correct 503 ms 70000 KB Output is correct
52 Correct 483 ms 69916 KB Output is correct
53 Correct 546 ms 70048 KB Output is correct
54 Correct 53 ms 7784 KB Output is correct
55 Correct 48 ms 7784 KB Output is correct
56 Correct 152 ms 26592 KB Output is correct
57 Correct 1 ms 268 KB Output is correct
58 Correct 54 ms 7784 KB Output is correct
59 Correct 51 ms 7784 KB Output is correct
60 Correct 579 ms 69852 KB Output is correct
61 Correct 52 ms 7784 KB Output is correct
62 Correct 51 ms 7784 KB Output is correct
63 Correct 52 ms 7784 KB Output is correct
64 Correct 53 ms 7784 KB Output is correct
65 Correct 50 ms 7784 KB Output is correct
66 Correct 57 ms 7912 KB Output is correct
67 Correct 52 ms 7784 KB Output is correct
68 Correct 46 ms 7784 KB Output is correct
69 Correct 51 ms 7912 KB Output is correct
70 Correct 539 ms 69792 KB Output is correct
71 Correct 53 ms 7784 KB Output is correct
72 Correct 494 ms 69852 KB Output is correct
73 Correct 495 ms 69720 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 6 ms 1388 KB Output is correct
80 Correct 570 ms 69724 KB Output is correct
81 Correct 570 ms 69980 KB Output is correct
82 Correct 537 ms 69852 KB Output is correct
83 Correct 530 ms 69852 KB Output is correct
84 Correct 539 ms 69852 KB Output is correct
85 Correct 531 ms 69852 KB Output is correct
86 Correct 152 ms 26688 KB Output is correct
87 Correct 1 ms 364 KB Output is correct