oj.uz

Submission #303949

# Submission time Handle Problem Language Result Execution time Memory
303949 2020-09-20T20:13:41 Z rocks03 Cave (IOI13_cave) C++14
100 / 100
 250 ms 596 KB 
#include "cave.h"
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;

void answer(int S[], int D[]);
int tryCombination(int S[]);

pii recur(int res, int l, int r, vector<int>&v, int ans[]){
    if(l == r){
        if(res == -1){
            ans[v[l]] ^= 1;
            res = tryCombination(ans);
        }
        return {v[l], res};
    }
    int m = (l + r) / 2;
    for(int i = l; i <= m; i++){
        ans[v[i]] ^= 1;
    }
    int res2 = tryCombination(ans);
    for(int i = l; i <= m; i++){
        ans[v[i]] ^= 1;
    }
    if(res2 == res){
        return recur(res, m+1, r, v, ans);
    } else if(res2 == -1 || res2 > res){
        return recur(res, l, m, v, ans);
    } else if(res2 < res){
        for(int i = l; i <= m; i++){
            ans[v[i]] ^= 1;
        }
        pii p = recur(res2, l, m, v, ans);
        return p;
    }
}

void exploreCave(int N){
    int ans[N], d[N];
    memset(ans, 0, sizeof(ans));
    memset(d, -1, sizeof(d));
    vector<int> v(N);
    iota(v.begin(), v.end(), 0);
    while(SZ(v)){
        pii p = recur(tryCombination(ans), 0, SZ(v) - 1, v, ans);
        if(p.ss == -1){
            ans[p.ff] ^= 1;
            d[p.ff] = tryCombination(ans);
            ans[p.ff] ^= 1;
        } else{
            d[p.ff] = p.ss;
            ans[p.ff] ^= 1;
        }
        v.erase(find(v.begin(), v.end(), p.ff));
    }
    answer(ans, d);
}

Compilation message

cave.cpp: In function 'std::pair<int, int> recur(int, int, int, std::vector<int>&, int*)':
cave.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 384 KB Output is correct
2 Correct 142 ms 384 KB Output is correct
3 Correct 223 ms 504 KB Output is correct
4 Correct 150 ms 384 KB Output is correct
5 Correct 227 ms 384 KB Output is correct
6 Correct 232 ms 384 KB Output is correct
7 Correct 218 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 218 ms 472 KB Output is correct
13 Correct 220 ms 384 KB Output is correct
14 Correct 221 ms 504 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 192 ms 472 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 231 ms 384 KB Output is correct
7 Correct 236 ms 504 KB Output is correct
8 Correct 176 ms 596 KB Output is correct
9 Correct 177 ms 384 KB Output is correct
10 Correct 178 ms 504 KB Output is correct
11 Correct 230 ms 508 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 29 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 33 ms 384 KB Output is correct
24 Correct 32 ms 412 KB Output is correct
25 Correct 33 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 33 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 28 ms 384 KB Output is correct
31 Correct 28 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 35 ms 384 KB Output is correct
36 Correct 32 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 384 KB Output is correct
2 Correct 142 ms 384 KB Output is correct
3 Correct 223 ms 504 KB Output is correct
4 Correct 150 ms 384 KB Output is correct
5 Correct 227 ms 384 KB Output is correct
6 Correct 232 ms 384 KB Output is correct
7 Correct 218 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 218 ms 472 KB Output is correct
13 Correct 220 ms 384 KB Output is correct
14 Correct 221 ms 504 KB Output is correct
15 Correct 232 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 192 ms 472 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 231 ms 384 KB Output is correct
21 Correct 236 ms 504 KB Output is correct
22 Correct 176 ms 596 KB Output is correct
23 Correct 177 ms 384 KB Output is correct
24 Correct 178 ms 504 KB Output is correct
25 Correct 230 ms 508 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Correct 29 ms 384 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 33 ms 384 KB Output is correct
49 Correct 32 ms 412 KB Output is correct
50 Correct 33 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 33 ms 384 KB Output is correct
54 Correct 1 ms 256 KB Output is correct
55 Correct 28 ms 384 KB Output is correct
56 Correct 28 ms 384 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 35 ms 384 KB Output is correct
61 Correct 32 ms 384 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 145 ms 504 KB Output is correct
64 Correct 137 ms 384 KB Output is correct
65 Correct 214 ms 384 KB Output is correct
66 Correct 148 ms 384 KB Output is correct
67 Correct 229 ms 384 KB Output is correct
68 Correct 223 ms 384 KB Output is correct
69 Correct 213 ms 384 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 214 ms 384 KB Output is correct
73 Correct 219 ms 384 KB Output is correct
74 Correct 221 ms 472 KB Output is correct
75 Correct 193 ms 384 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 225 ms 504 KB Output is correct
79 Correct 230 ms 504 KB Output is correct
80 Correct 176 ms 384 KB Output is correct
81 Correct 179 ms 384 KB Output is correct
82 Correct 178 ms 504 KB Output is correct
83 Correct 235 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 29 ms 504 KB Output is correct
86 Correct 184 ms 504 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 33 ms 384 KB Output is correct
90 Correct 36 ms 416 KB Output is correct
91 Correct 34 ms 504 KB Output is correct
92 Correct 250 ms 504 KB Output is correct
93 Correct 250 ms 384 KB Output is correct
94 Correct 248 ms 384 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 208 ms 384 KB Output is correct
98 Correct 34 ms 384 KB Output is correct
99 Correct 216 ms 384 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 29 ms 420 KB Output is correct
102 Correct 28 ms 384 KB Output is correct
103 Correct 184 ms 384 KB Output is correct
104 Correct 1 ms 256 KB Output is correct
105 Correct 0 ms 256 KB Output is correct
106 Correct 1 ms 256 KB Output is correct
107 Correct 33 ms 384 KB Output is correct
108 Correct 32 ms 384 KB Output is correct
109 Correct 247 ms 468 KB Output is correct
110 Correct 248 ms 504 KB Output is correct
111 Correct 0 ms 256 KB Output is correct