oj.uz

Submission #558842

# Submission time Handle Problem Language Result Execution time Memory
558842 2022-05-08T16:26:26 Z urosk Cave (IOI13_cave) C++14
100 / 100
 1058 ms 568 KB 
#include "cave.h"
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
#define ld double
#define ll int
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define here; cerr<<"===========================\n";
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
#define maxn 5005
ll n;
ll a[maxn];
ll b[maxn];
ll c[maxn];
ll cans[maxn];
ll cur[maxn];
bool vis[maxn];
void exploreCave(int N) {
    n = N;
    for(ll i = 0;i<n;i++) b[i] = -1;
    for(ll i = 0;i<n;i++) c[i] = 0;
    for(ll i = 0;i<n;i++){
        ll col = 0;
        //if(j==-1) j = n;
        fill(c,c+n+1,col);
        for(ll j = 0;j<n;j++) if(b[j]!=-1) c[j] = cans[j];
        ll j = tryCombination(c);
        if(j==-1) j = n;
        if(j>i) col = 1;
        fill(c,c+n+1,col);
        for(ll j = 0;j<n;j++) if(b[j]!=-1) c[j] = cans[j];
        ll l = 0,r = n-1,mid,rez;
        //here;
        //cerr<<"j: "<<i<<" "<<col<<endl;
        //ceri(c,0,n-1);
        //cerr<<j<<endl;
        while(l<=r){
            ll mid = (l+r)/2;
            for(ll i = 0;i<n;i++){
                if(b[i]!=-1) c[i] = cans[i];
                else c[i] = 1^col;
            }
            for(ll i = l;i<=mid;i++){
                if(b[i]!=-1) c[i] = cans[i];
                else c[i] = col;
            }
            //cerr<<l<< " "<<r<< " "<<mid<<endl;
            ll e = tryCombination(c);
            if(e==-1) e = n;
            //ceri(c,0,n-1);
            //cerr<<e<<endl;
            if(e==i){
                rez = mid;
                r = mid-1;
            }else l = mid+1;
        }
        cans[rez] = !col;
        b[rez] = i;
    }
    answer(cans,b);
}

Compilation message

cave.cpp:20:9: warning: ISO C++11 requires whitespace after the macro name
   20 | #define here; cerr<<"===========================\n";
      |         ^~~~
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:49:26: warning: unused variable 'mid' [-Wunused-variable]
   49 |         ll l = 0,r = n-1,mid,rez;
      |                          ^~~
cave.cpp:75:16: warning: 'rez' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |         b[rez] = i;
      |         ~~~~~~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 424 KB Output is correct
2 Correct 241 ms 428 KB Output is correct
3 Correct 452 ms 436 KB Output is correct
4 Correct 276 ms 416 KB Output is correct
5 Correct 423 ms 424 KB Output is correct
6 Correct 394 ms 444 KB Output is correct
7 Correct 484 ms 428 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 308 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 376 ms 500 KB Output is correct
13 Correct 374 ms 448 KB Output is correct
14 Correct 385 ms 432 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 436 ms 560 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 442 ms 448 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 464 ms 560 KB Output is correct
7 Correct 378 ms 440 KB Output is correct
8 Correct 1004 ms 460 KB Output is correct
9 Correct 1058 ms 444 KB Output is correct
10 Correct 1000 ms 452 KB Output is correct
11 Correct 391 ms 552 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 56 ms 372 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 126 ms 372 KB Output is correct
24 Correct 126 ms 340 KB Output is correct
25 Correct 131 ms 368 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 58 ms 388 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 63 ms 468 KB Output is correct
31 Correct 54 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 308 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 119 ms 340 KB Output is correct
36 Correct 132 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 424 KB Output is correct
2 Correct 241 ms 428 KB Output is correct
3 Correct 452 ms 436 KB Output is correct
4 Correct 276 ms 416 KB Output is correct
5 Correct 423 ms 424 KB Output is correct
6 Correct 394 ms 444 KB Output is correct
7 Correct 484 ms 428 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 308 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 376 ms 500 KB Output is correct
13 Correct 374 ms 448 KB Output is correct
14 Correct 385 ms 432 KB Output is correct
15 Correct 436 ms 560 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 442 ms 448 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 464 ms 560 KB Output is correct
21 Correct 378 ms 440 KB Output is correct
22 Correct 1004 ms 460 KB Output is correct
23 Correct 1058 ms 444 KB Output is correct
24 Correct 1000 ms 452 KB Output is correct
25 Correct 391 ms 552 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 56 ms 372 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 126 ms 372 KB Output is correct
49 Correct 126 ms 340 KB Output is correct
50 Correct 131 ms 368 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 58 ms 388 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 63 ms 468 KB Output is correct
56 Correct 54 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 308 KB Output is correct
59 Correct 1 ms 312 KB Output is correct
60 Correct 119 ms 340 KB Output is correct
61 Correct 132 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 308 ms 340 KB Output is correct
64 Correct 254 ms 420 KB Output is correct
65 Correct 405 ms 340 KB Output is correct
66 Correct 274 ms 432 KB Output is correct
67 Correct 421 ms 560 KB Output is correct
68 Correct 379 ms 464 KB Output is correct
69 Correct 415 ms 452 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 375 ms 432 KB Output is correct
73 Correct 364 ms 460 KB Output is correct
74 Correct 442 ms 436 KB Output is correct
75 Correct 434 ms 448 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 413 ms 432 KB Output is correct
79 Correct 384 ms 444 KB Output is correct
80 Correct 958 ms 444 KB Output is correct
81 Correct 975 ms 456 KB Output is correct
82 Correct 1004 ms 460 KB Output is correct
83 Correct 389 ms 560 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 54 ms 376 KB Output is correct
86 Correct 367 ms 440 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 316 KB Output is correct
89 Correct 130 ms 340 KB Output is correct
90 Correct 120 ms 372 KB Output is correct
91 Correct 118 ms 384 KB Output is correct
92 Correct 970 ms 440 KB Output is correct
93 Correct 944 ms 464 KB Output is correct
94 Correct 976 ms 440 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 403 ms 376 KB Output is correct
98 Correct 55 ms 340 KB Output is correct
99 Correct 375 ms 568 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 56 ms 340 KB Output is correct
102 Correct 62 ms 376 KB Output is correct
103 Correct 387 ms 440 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 123 ms 340 KB Output is correct
108 Correct 120 ms 372 KB Output is correct
109 Correct 1018 ms 444 KB Output is correct
110 Correct 963 ms 440 KB Output is correct
111 Correct 1 ms 340 KB Output is correct