Submission #527031

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
527031	2022-02-16T20:05:28 Z	Lobo	Strange Device (APIO19_strange_device)	C++17	100 / 100	466 ms	53408 KB

strange_device

#include<bits/stdc++.h>
using namespace std;
 
const long long inf = (long long) 2e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
#define maxn 

int gcdd(int a, int b) {
    if(b == 0) return a;
    a%=b;
    return gcdd(b,a);
}
 
void solve() {
    int n, a, b;
    cin >> n >> a >> b;
    int gc = gcdd(a,b+1);
    int q = (b+1)/gc;
    int m;
    if(log2(a) + log2(b) + log2(q) - log2(b+1) > log2(inf)) m = inf;
    else {
        // assert((a*b*q)%(b+1) == 0);
        m = ((a*q)/(b+1))*b;
    }
 
    vector<pair<int,int>> lr;
 
    for(int i = 1; i <= n; i++) {
        int l, r; cin >> l >> r;
 
        if(r-l+1 >= m) {
            lr.pb(mp(0,m-1));
        }
        else if(l/m != r/m) {
            //terminam em cantos diferentes
            l%= m;
            r%= m;
            //colocar l,m-1 e 0,r
            lr.pb(mp(l,m-1));
            lr.pb(mp(0,r));
        }
        else {
            l%= m;
            r%= m;
            lr.pb(mp(l,r));
        }
    }
 
    sort(all(lr));
 
    int l = 0;
    int r = -1;
    int ans = 0;
    for(auto x : lr) {
        int l1 = x.fr;
        int r1 = x.sc;

 
        if(l1 > r) {
            //conta o lr anterior e comeca um novo
            ans+= r-l+1;
            l = l1;
            r = r1;
        }
        r = max(r,r1);
    }
 
    ans+= r-l+1;
    cout << ans << endl;
 
 
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
 
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
 
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	6 ms	916 KB	Output is correct
3	Correct	6 ms	848 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	4 ms	976 KB	Output is correct
17	Correct	51 ms	3496 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	286 ms	16876 KB	Output is correct

Subtask #4
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	373 ms	17060 KB	Output is correct
3	Correct	388 ms	17084 KB	Output is correct
4	Correct	356 ms	17088 KB	Output is correct

Subtask #5
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	373 ms	17060 KB	Output is correct
3	Correct	388 ms	17084 KB	Output is correct
4	Correct	356 ms	17088 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	381 ms	16964 KB	Output is correct
7	Correct	369 ms	17012 KB	Output is correct
8	Correct	385 ms	17032 KB	Output is correct
9	Correct	405 ms	17028 KB	Output is correct

Subtask #6
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	373 ms	17060 KB	Output is correct
3	Correct	388 ms	17084 KB	Output is correct
4	Correct	356 ms	17088 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	40 ms	4064 KB	Output is correct
7	Correct	42 ms	4316 KB	Output is correct
8	Correct	40 ms	4796 KB	Output is correct
9	Correct	41 ms	5072 KB	Output is correct
10	Correct	40 ms	5204 KB	Output is correct
11	Correct	40 ms	5176 KB	Output is correct
12	Correct	38 ms	5152 KB	Output is correct
13	Correct	40 ms	5164 KB	Output is correct
14	Correct	37 ms	5684 KB	Output is correct
15	Correct	44 ms	5688 KB	Output is correct
16	Correct	47 ms	5652 KB	Output is correct
17	Correct	39 ms	5696 KB	Output is correct
18	Correct	398 ms	53272 KB	Output is correct
19	Correct	394 ms	53328 KB	Output is correct
20	Correct	432 ms	53324 KB	Output is correct
21	Correct	42 ms	5688 KB	Output is correct
22	Correct	38 ms	5628 KB	Output is correct
23	Correct	120 ms	18476 KB	Output is correct

Subtask #7
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	43 ms	4788 KB	Output is correct
3	Correct	42 ms	4916 KB	Output is correct
4	Correct	426 ms	17064 KB	Output is correct
5	Correct	40 ms	4544 KB	Output is correct
6	Correct	40 ms	5840 KB	Output is correct
7	Correct	40 ms	5676 KB	Output is correct
8	Correct	42 ms	5632 KB	Output is correct
9	Correct	41 ms	5588 KB	Output is correct
10	Correct	43 ms	5672 KB	Output is correct
11	Correct	42 ms	5684 KB	Output is correct
12	Correct	37 ms	5688 KB	Output is correct
13	Correct	43 ms	5872 KB	Output is correct
14	Correct	394 ms	17012 KB	Output is correct
15	Correct	43 ms	5688 KB	Output is correct
16	Correct	391 ms	53392 KB	Output is correct
17	Correct	385 ms	53176 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct

Subtask #8
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	6 ms	916 KB	Output is correct
3	Correct	6 ms	848 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	4 ms	976 KB	Output is correct
17	Correct	51 ms	3496 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	286 ms	16876 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	373 ms	17060 KB	Output is correct
31	Correct	388 ms	17084 KB	Output is correct
32	Correct	356 ms	17088 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	381 ms	16964 KB	Output is correct
35	Correct	369 ms	17012 KB	Output is correct
36	Correct	385 ms	17032 KB	Output is correct
37	Correct	405 ms	17028 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	40 ms	4064 KB	Output is correct
40	Correct	42 ms	4316 KB	Output is correct
41	Correct	40 ms	4796 KB	Output is correct
42	Correct	41 ms	5072 KB	Output is correct
43	Correct	40 ms	5204 KB	Output is correct
44	Correct	40 ms	5176 KB	Output is correct
45	Correct	38 ms	5152 KB	Output is correct
46	Correct	40 ms	5164 KB	Output is correct
47	Correct	37 ms	5684 KB	Output is correct
48	Correct	44 ms	5688 KB	Output is correct
49	Correct	47 ms	5652 KB	Output is correct
50	Correct	39 ms	5696 KB	Output is correct
51	Correct	398 ms	53272 KB	Output is correct
52	Correct	394 ms	53328 KB	Output is correct
53	Correct	432 ms	53324 KB	Output is correct
54	Correct	42 ms	5688 KB	Output is correct
55	Correct	38 ms	5628 KB	Output is correct
56	Correct	120 ms	18476 KB	Output is correct
57	Correct	0 ms	204 KB	Output is correct
58	Correct	43 ms	4788 KB	Output is correct
59	Correct	42 ms	4916 KB	Output is correct
60	Correct	426 ms	17064 KB	Output is correct
61	Correct	40 ms	4544 KB	Output is correct
62	Correct	40 ms	5840 KB	Output is correct
63	Correct	40 ms	5676 KB	Output is correct
64	Correct	42 ms	5632 KB	Output is correct
65	Correct	41 ms	5588 KB	Output is correct
66	Correct	43 ms	5672 KB	Output is correct
67	Correct	42 ms	5684 KB	Output is correct
68	Correct	37 ms	5688 KB	Output is correct
69	Correct	43 ms	5872 KB	Output is correct
70	Correct	394 ms	17012 KB	Output is correct
71	Correct	43 ms	5688 KB	Output is correct
72	Correct	391 ms	53392 KB	Output is correct
73	Correct	385 ms	53176 KB	Output is correct
74	Correct	1 ms	204 KB	Output is correct
75	Correct	1 ms	316 KB	Output is correct
76	Correct	0 ms	204 KB	Output is correct
77	Correct	0 ms	204 KB	Output is correct
78	Correct	0 ms	312 KB	Output is correct
79	Correct	4 ms	972 KB	Output is correct
80	Correct	466 ms	53408 KB	Output is correct
81	Correct	457 ms	53248 KB	Output is correct
82	Correct	433 ms	53256 KB	Output is correct
83	Correct	415 ms	53284 KB	Output is correct
84	Correct	424 ms	53260 KB	Output is correct
85	Correct	417 ms	53240 KB	Output is correct
86	Correct	123 ms	18468 KB	Output is correct
87	Correct	0 ms	204 KB	Output is correct

Submission #527031

Compilation message