Submission #729436

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
729436	2023-04-24T07:07:16 Z	Blistering_Barnacles	Cave (IOI13_cave)	C++11	100 / 100	654 ms	13740 KB

cave

#include "cave.h"
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(0) , cin.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(dosomething) {dosomething; break;}
#define co(dosomething) {dosomething ; continue;}
using namespace std;
typedef long long ll;
ll q, dp[500005] , a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s ;
void exploreCave(int N) {
    n = N ;
    ll cnt = 0 ;
    int S[n] , D[n] ;
    for(ll i = 0 ; i < n ; i++)D[i] = S[i] = 0 ;
    for(ll i = 0 ; i < n ; i++){
        for(ll j = 0 ; j < n ;j++){
            if(a[j])C ;
            S[j] = 0 ;
        }
        cnt++ ;
        assert(cnt <= 70000) ;
        int op = tryCombination(S) ;
        if(op == -1 || op > i){
            int l = -1 , r = n ;
            while(r - l > 1){
                for(ll j = 0 ; j < n ; j++){
                    if(a[j])C ;
                    if(j <= mid)S[j] = 0 ;
                    else S[j] = 1 ;
                }
                int op = tryCombination(S) ;
                cnt++ ;
                assert(cnt <= 70000) ;
                if(op == -1 || op > i)r = mid ;
                else l = mid ;
            }
            a[r] = 1 ;
            S[r] = 0 ;
            D[r] = i ;
        }
        else {
            int l = -1 , r = n ;
            while(r - l > 1){
                for(ll j = 0 ; j < n ; j++){
                    if(a[j])C ;
                    if(j <= mid)S[j] = 1 ;
                    else S[j] = 0 ;
                }
                cnt++ ;
                assert(cnt <= 70000) ;
                int op = tryCombination(S) ;
                if(op == -1 || op > i)r = mid ;
                else l = mid ;
            }
            a[r] = 1 ;
            S[r] = 1 ;
            D[r] = i ;
        }
    }
    answer(S , D) ;
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	13440 KB	Output is correct
2	Correct	282 ms	13432 KB	Output is correct
3	Correct	468 ms	13460 KB	Output is correct
4	Correct	299 ms	13556 KB	Output is correct
5	Correct	506 ms	13592 KB	Output is correct
6	Correct	429 ms	13584 KB	Output is correct
7	Correct	504 ms	13576 KB	Output is correct
8	Correct	8 ms	13268 KB	Output is correct
9	Correct	8 ms	13340 KB	Output is correct
10	Correct	10 ms	13316 KB	Output is correct
11	Correct	10 ms	13296 KB	Output is correct
12	Correct	462 ms	13460 KB	Output is correct
13	Correct	457 ms	13472 KB	Output is correct
14	Correct	429 ms	13468 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	489 ms	13472 KB	Output is correct
2	Correct	8 ms	13268 KB	Output is correct
3	Correct	538 ms	13640 KB	Output is correct
4	Correct	8 ms	13268 KB	Output is correct
5	Correct	8 ms	13320 KB	Output is correct
6	Correct	443 ms	13612 KB	Output is correct
7	Correct	495 ms	13520 KB	Output is correct
8	Correct	621 ms	13524 KB	Output is correct
9	Correct	623 ms	13524 KB	Output is correct
10	Correct	628 ms	13524 KB	Output is correct
11	Correct	461 ms	13500 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13268 KB	Output is correct
2	Correct	10 ms	13364 KB	Output is correct
3	Correct	8 ms	13308 KB	Output is correct
4	Correct	7 ms	13268 KB	Output is correct
5	Correct	8 ms	13268 KB	Output is correct
6	Correct	8 ms	13268 KB	Output is correct
7	Correct	8 ms	13268 KB	Output is correct
8	Correct	8 ms	13268 KB	Output is correct
9	Correct	8 ms	13268 KB	Output is correct
10	Correct	8 ms	13368 KB	Output is correct
11	Correct	8 ms	13264 KB	Output is correct
12	Correct	8 ms	13268 KB	Output is correct
13	Correct	8 ms	13308 KB	Output is correct
14	Correct	8 ms	13348 KB	Output is correct

Subtask #4

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13268 KB	Output is correct
2	Correct	10 ms	13364 KB	Output is correct
3	Correct	8 ms	13308 KB	Output is correct
4	Correct	7 ms	13268 KB	Output is correct
5	Correct	8 ms	13268 KB	Output is correct
6	Correct	8 ms	13268 KB	Output is correct
7	Correct	8 ms	13268 KB	Output is correct
8	Correct	8 ms	13268 KB	Output is correct
9	Correct	8 ms	13268 KB	Output is correct
10	Correct	8 ms	13368 KB	Output is correct
11	Correct	8 ms	13264 KB	Output is correct
12	Correct	8 ms	13268 KB	Output is correct
13	Correct	8 ms	13308 KB	Output is correct
14	Correct	8 ms	13348 KB	Output is correct
15	Correct	8 ms	13268 KB	Output is correct
16	Correct	9 ms	13360 KB	Output is correct
17	Correct	8 ms	13292 KB	Output is correct
18	Correct	8 ms	13340 KB	Output is correct
19	Correct	8 ms	13268 KB	Output is correct
20	Correct	71 ms	13428 KB	Output is correct
21	Correct	8 ms	13268 KB	Output is correct
22	Correct	9 ms	13360 KB	Output is correct
23	Correct	92 ms	13420 KB	Output is correct
24	Correct	92 ms	13424 KB	Output is correct
25	Correct	95 ms	13516 KB	Output is correct
26	Correct	9 ms	13272 KB	Output is correct
27	Correct	9 ms	13268 KB	Output is correct
28	Correct	70 ms	13400 KB	Output is correct
29	Correct	8 ms	13268 KB	Output is correct
30	Correct	68 ms	13428 KB	Output is correct
31	Correct	67 ms	13428 KB	Output is correct
32	Correct	8 ms	13272 KB	Output is correct
33	Correct	13 ms	13356 KB	Output is correct
34	Correct	8 ms	13268 KB	Output is correct
35	Correct	101 ms	13424 KB	Output is correct
36	Correct	100 ms	13396 KB	Output is correct
37	Correct	8 ms	13364 KB	Output is correct

Subtask #5

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	289 ms	13440 KB	Output is correct
2	Correct	282 ms	13432 KB	Output is correct
3	Correct	468 ms	13460 KB	Output is correct
4	Correct	299 ms	13556 KB	Output is correct
5	Correct	506 ms	13592 KB	Output is correct
6	Correct	429 ms	13584 KB	Output is correct
7	Correct	504 ms	13576 KB	Output is correct
8	Correct	8 ms	13268 KB	Output is correct
9	Correct	8 ms	13340 KB	Output is correct
10	Correct	10 ms	13316 KB	Output is correct
11	Correct	10 ms	13296 KB	Output is correct
12	Correct	462 ms	13460 KB	Output is correct
13	Correct	457 ms	13472 KB	Output is correct
14	Correct	429 ms	13468 KB	Output is correct
15	Correct	489 ms	13472 KB	Output is correct
16	Correct	8 ms	13268 KB	Output is correct
17	Correct	538 ms	13640 KB	Output is correct
18	Correct	8 ms	13268 KB	Output is correct
19	Correct	8 ms	13320 KB	Output is correct
20	Correct	443 ms	13612 KB	Output is correct
21	Correct	495 ms	13520 KB	Output is correct
22	Correct	621 ms	13524 KB	Output is correct
23	Correct	623 ms	13524 KB	Output is correct
24	Correct	628 ms	13524 KB	Output is correct
25	Correct	461 ms	13500 KB	Output is correct
26	Correct	8 ms	13268 KB	Output is correct
27	Correct	10 ms	13364 KB	Output is correct
28	Correct	8 ms	13308 KB	Output is correct
29	Correct	7 ms	13268 KB	Output is correct
30	Correct	8 ms	13268 KB	Output is correct
31	Correct	8 ms	13268 KB	Output is correct
32	Correct	8 ms	13268 KB	Output is correct
33	Correct	8 ms	13268 KB	Output is correct
34	Correct	8 ms	13268 KB	Output is correct
35	Correct	8 ms	13368 KB	Output is correct
36	Correct	8 ms	13264 KB	Output is correct
37	Correct	8 ms	13268 KB	Output is correct
38	Correct	8 ms	13308 KB	Output is correct
39	Correct	8 ms	13348 KB	Output is correct
40	Correct	8 ms	13268 KB	Output is correct
41	Correct	9 ms	13360 KB	Output is correct
42	Correct	8 ms	13292 KB	Output is correct
43	Correct	8 ms	13340 KB	Output is correct
44	Correct	8 ms	13268 KB	Output is correct
45	Correct	71 ms	13428 KB	Output is correct
46	Correct	8 ms	13268 KB	Output is correct
47	Correct	9 ms	13360 KB	Output is correct
48	Correct	92 ms	13420 KB	Output is correct
49	Correct	92 ms	13424 KB	Output is correct
50	Correct	95 ms	13516 KB	Output is correct
51	Correct	9 ms	13272 KB	Output is correct
52	Correct	9 ms	13268 KB	Output is correct
53	Correct	70 ms	13400 KB	Output is correct
54	Correct	8 ms	13268 KB	Output is correct
55	Correct	68 ms	13428 KB	Output is correct
56	Correct	67 ms	13428 KB	Output is correct
57	Correct	8 ms	13272 KB	Output is correct
58	Correct	13 ms	13356 KB	Output is correct
59	Correct	8 ms	13268 KB	Output is correct
60	Correct	101 ms	13424 KB	Output is correct
61	Correct	100 ms	13396 KB	Output is correct
62	Correct	8 ms	13364 KB	Output is correct
63	Correct	283 ms	13476 KB	Output is correct
64	Correct	309 ms	13600 KB	Output is correct
65	Correct	438 ms	13484 KB	Output is correct
66	Correct	294 ms	13732 KB	Output is correct
67	Correct	440 ms	13612 KB	Output is correct
68	Correct	437 ms	13528 KB	Output is correct
69	Correct	442 ms	13636 KB	Output is correct
70	Correct	7 ms	13268 KB	Output is correct
71	Correct	8 ms	13380 KB	Output is correct
72	Correct	428 ms	13608 KB	Output is correct
73	Correct	457 ms	13508 KB	Output is correct
74	Correct	446 ms	13492 KB	Output is correct
75	Correct	539 ms	13524 KB	Output is correct
76	Correct	8 ms	13360 KB	Output is correct
77	Correct	8 ms	13360 KB	Output is correct
78	Correct	461 ms	13492 KB	Output is correct
79	Correct	487 ms	13500 KB	Output is correct
80	Correct	607 ms	13524 KB	Output is correct
81	Correct	654 ms	13524 KB	Output is correct
82	Correct	635 ms	13524 KB	Output is correct
83	Correct	498 ms	13512 KB	Output is correct
84	Correct	10 ms	13384 KB	Output is correct
85	Correct	67 ms	13424 KB	Output is correct
86	Correct	407 ms	13500 KB	Output is correct
87	Correct	8 ms	13268 KB	Output is correct
88	Correct	9 ms	13312 KB	Output is correct
89	Correct	97 ms	13424 KB	Output is correct
90	Correct	88 ms	13428 KB	Output is correct
91	Correct	91 ms	13396 KB	Output is correct
92	Correct	606 ms	13512 KB	Output is correct
93	Correct	629 ms	13528 KB	Output is correct
94	Correct	581 ms	13512 KB	Output is correct
95	Correct	9 ms	13268 KB	Output is correct
96	Correct	10 ms	13360 KB	Output is correct
97	Correct	521 ms	13516 KB	Output is correct
98	Correct	72 ms	13420 KB	Output is correct
99	Correct	446 ms	13740 KB	Output is correct
100	Correct	8 ms	13268 KB	Output is correct
101	Correct	68 ms	13420 KB	Output is correct
102	Correct	66 ms	13416 KB	Output is correct
103	Correct	450 ms	13496 KB	Output is correct
104	Correct	8 ms	13268 KB	Output is correct
105	Correct	9 ms	13268 KB	Output is correct
106	Correct	7 ms	13364 KB	Output is correct
107	Correct	98 ms	13488 KB	Output is correct
108	Correct	92 ms	13396 KB	Output is correct
109	Correct	603 ms	13524 KB	Output is correct
110	Correct	612 ms	13524 KB	Output is correct
111	Correct	7 ms	13268 KB	Output is correct