oj.uz

Submission #570890

# Submission time Handle Problem Language Result Execution time Memory
570890 2022-05-31T13:46:29 Z nohaxjustsoflo Cave (IOI13_cave) C++17
100 / 100
 321 ms 588 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen(-1e9, 1e8); ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN = 1e6+50000;
const int mod = 998244353;
const int mxlogN = 34;
const int mxK = 26;
const int inf = 1e9;
const int K = 100000;
#include "cave.h"
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N)
{
    int n=N;
    int S[n], D[n];
    for(int i=0; i<n; i++) S[i]=0;
    vector<bool> done(n,0);
    for(int i=0; i<n; i++)
    {
        bool b=tryCombination(S)!=i;
        vector<int> pos;
        for(int j=0; j<n; j++) if(!done[j]) pos.push_back(j);
        int l=0, r=n-i;
        while(r-l>1)
        {
            int m=(l+r)/2;
            for(int j=l; j<m; j++) S[pos[j]]=1;
            bool b2=tryCombination(S)!=i;
            for(int j=l; j<m; j++) S[pos[j]]=0;
            if(b==b2) l=m;
            else r=m;

        }
        int p=pos[l];
        //cout << "burag " << p << "\n";
        D[p]=i;
        S[p]=!b;
        done[p]=1;
    }
    answer(S,D);
}
/*
int main()
{
    exploreCave(4);
}*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 396 KB Output is correct
2 Correct 150 ms 468 KB Output is correct
3 Correct 229 ms 480 KB Output is correct
4 Correct 155 ms 468 KB Output is correct
5 Correct 253 ms 468 KB Output is correct
6 Correct 223 ms 468 KB Output is correct
7 Correct 235 ms 468 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 223 ms 468 KB Output is correct
13 Correct 216 ms 480 KB Output is correct
14 Correct 224 ms 468 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 432 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 245 ms 364 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 247 ms 468 KB Output is correct
7 Correct 238 ms 472 KB Output is correct
8 Correct 285 ms 588 KB Output is correct
9 Correct 268 ms 468 KB Output is correct
10 Correct 268 ms 588 KB Output is correct
11 Correct 256 ms 468 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 38 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 39 ms 340 KB Output is correct
24 Correct 41 ms 340 KB Output is correct
25 Correct 41 ms 356 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 37 ms 360 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 37 ms 340 KB Output is correct
31 Correct 38 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 41 ms 360 KB Output is correct
36 Correct 37 ms 320 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 396 KB Output is correct
2 Correct 150 ms 468 KB Output is correct
3 Correct 229 ms 480 KB Output is correct
4 Correct 155 ms 468 KB Output is correct
5 Correct 253 ms 468 KB Output is correct
6 Correct 223 ms 468 KB Output is correct
7 Correct 235 ms 468 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 223 ms 468 KB Output is correct
13 Correct 216 ms 480 KB Output is correct
14 Correct 224 ms 468 KB Output is correct
15 Correct 243 ms 432 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 245 ms 364 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 247 ms 468 KB Output is correct
21 Correct 238 ms 472 KB Output is correct
22 Correct 285 ms 588 KB Output is correct
23 Correct 268 ms 468 KB Output is correct
24 Correct 268 ms 588 KB Output is correct
25 Correct 256 ms 468 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 308 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 38 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 39 ms 340 KB Output is correct
49 Correct 41 ms 340 KB Output is correct
50 Correct 41 ms 356 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 37 ms 360 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 37 ms 340 KB Output is correct
56 Correct 38 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 41 ms 360 KB Output is correct
61 Correct 37 ms 320 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 148 ms 340 KB Output is correct
64 Correct 151 ms 444 KB Output is correct
65 Correct 238 ms 468 KB Output is correct
66 Correct 167 ms 340 KB Output is correct
67 Correct 228 ms 468 KB Output is correct
68 Correct 224 ms 468 KB Output is correct
69 Correct 228 ms 468 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 225 ms 484 KB Output is correct
73 Correct 218 ms 468 KB Output is correct
74 Correct 240 ms 468 KB Output is correct
75 Correct 245 ms 484 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 304 KB Output is correct
78 Correct 246 ms 468 KB Output is correct
79 Correct 241 ms 468 KB Output is correct
80 Correct 274 ms 472 KB Output is correct
81 Correct 271 ms 464 KB Output is correct
82 Correct 271 ms 480 KB Output is correct
83 Correct 241 ms 468 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 41 ms 316 KB Output is correct
86 Correct 246 ms 468 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 44 ms 340 KB Output is correct
90 Correct 41 ms 340 KB Output is correct
91 Correct 43 ms 340 KB Output is correct
92 Correct 321 ms 468 KB Output is correct
93 Correct 275 ms 468 KB Output is correct
94 Correct 258 ms 468 KB Output is correct
95 Correct 1 ms 312 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 232 ms 468 KB Output is correct
98 Correct 37 ms 340 KB Output is correct
99 Correct 223 ms 468 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 36 ms 340 KB Output is correct
102 Correct 37 ms 340 KB Output is correct
103 Correct 231 ms 480 KB Output is correct
104 Correct 1 ms 260 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 38 ms 360 KB Output is correct
108 Correct 41 ms 360 KB Output is correct
109 Correct 263 ms 468 KB Output is correct
110 Correct 266 ms 468 KB Output is correct
111 Correct 1 ms 212 KB Output is correct