oj.uz

Submission #306353

# Submission time Handle Problem Language Result Execution time Memory
306353 2020-09-25T09:29:25 Z talant117408 Cave (IOI13_cave) C++17
100 / 100
 576 ms 636 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair

const int N = 5003;
vector <int> used(N);/*

int _0or1[8] = {0, 1, 1, 0, 1, 0, 1, 1}, sw[8] = {7, 1, 4, 6, 5, 3, 0, 2};

int tryCombination(int pos[]){
    int closed = -1;
    vector <int> opened(8);
    for(int i = 0; i < 8; i++)
        if(pos[i] == _0or1[i])
            opened[sw[i]]++;
    for(int i = 0; i < 8; i++){
        if(!opened[i]){
            closed = i;
            break;
        }
    }
    return closed;
}

void answer(int pos[], int door[]){
    int i;
    for(i = 0; i < 8; i++) cout << pos[i] << ' ';
    cout << endl;
    for(i = 0; i < 8; i++) cout << door[i] << ' ';
    exit(0);
}*/

int check(vector <int> pos, int truepos, int l, int r){
    int n = pos.size();
    for(int i = l; i <= r; i++){
        if(used[i]) continue;
        pos[i] = truepos;
    }
    int poss[n];
    for(int i = 0; i < n; i++)
        poss[i] = pos[i];
    return tryCombination(poss);
}
/*
void exploreCave(int n);

int main() {
    int N;
    cin >> N;
	exploreCave(N);
    printf("INCORRECT\nYour solution did not call answer().\n");
	return 0;
}*/

void exploreCave(int n){
    vector <int> pos0(n), pos1(n), doornum(n);
    for(int i = 0; i < n; i++) pos1[i] = 1, pos0[i] = 0;
    
    for(int door = 0; door < n; door++){
        int truepos = 1;
        int poss[n];
        for(int i = 0; i < n; i++) poss[i] = pos0[i];
        int closed = tryCombination(poss);
        if(closed == -1 || closed > door) truepos--;
        
        int l = 0, r = n-1;
        while(l < r){
            int mid = (l+r)>>1;
            closed = check((truepos ? pos0 : pos1), truepos, l, mid);
            
            if(closed == -1 || closed > door){
                r = mid;
            }
            else{
                l = mid+1;
            }
        }
        used[l]++;
        doornum[l] = door;
        pos0[l] = pos1[l] = truepos;
    }
    
    int dooor[n], poss[n];
    for(int i = 0; i < n; i++){
        dooor[i] = doornum[i];
        poss[i] = pos0[i];
    }
    
    answer(poss, dooor);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 632 KB Output is correct
2 Correct 277 ms 512 KB Output is correct
3 Correct 406 ms 512 KB Output is correct
4 Correct 278 ms 532 KB Output is correct
5 Correct 409 ms 632 KB Output is correct
6 Correct 403 ms 548 KB Output is correct
7 Correct 419 ms 632 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 403 ms 632 KB Output is correct
13 Correct 399 ms 512 KB Output is correct
14 Correct 413 ms 632 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 406 ms 632 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 430 ms 544 KB Output is correct
7 Correct 432 ms 548 KB Output is correct
8 Correct 541 ms 544 KB Output is correct
9 Correct 542 ms 548 KB Output is correct
10 Correct 532 ms 488 KB Output is correct
11 Correct 448 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 66 ms 504 KB Output is correct
21 Correct 1 ms 360 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 80 ms 384 KB Output is correct
24 Correct 91 ms 384 KB Output is correct
25 Correct 76 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 60 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 63 ms 460 KB Output is correct
31 Correct 61 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 100 ms 384 KB Output is correct
36 Correct 71 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 632 KB Output is correct
2 Correct 277 ms 512 KB Output is correct
3 Correct 406 ms 512 KB Output is correct
4 Correct 278 ms 532 KB Output is correct
5 Correct 409 ms 632 KB Output is correct
6 Correct 403 ms 548 KB Output is correct
7 Correct 419 ms 632 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 403 ms 632 KB Output is correct
13 Correct 399 ms 512 KB Output is correct
14 Correct 413 ms 632 KB Output is correct
15 Correct 411 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 406 ms 632 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 430 ms 544 KB Output is correct
21 Correct 432 ms 548 KB Output is correct
22 Correct 541 ms 544 KB Output is correct
23 Correct 542 ms 548 KB Output is correct
24 Correct 532 ms 488 KB Output is correct
25 Correct 448 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 66 ms 504 KB Output is correct
46 Correct 1 ms 360 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 80 ms 384 KB Output is correct
49 Correct 91 ms 384 KB Output is correct
50 Correct 76 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 60 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 63 ms 460 KB Output is correct
56 Correct 61 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 100 ms 384 KB Output is correct
61 Correct 71 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 282 ms 532 KB Output is correct
64 Correct 286 ms 512 KB Output is correct
65 Correct 419 ms 512 KB Output is correct
66 Correct 289 ms 512 KB Output is correct
67 Correct 411 ms 632 KB Output is correct
68 Correct 432 ms 548 KB Output is correct
69 Correct 433 ms 632 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 414 ms 636 KB Output is correct
73 Correct 427 ms 512 KB Output is correct
74 Correct 410 ms 512 KB Output is correct
75 Correct 406 ms 512 KB Output is correct
76 Correct 0 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 429 ms 548 KB Output is correct
79 Correct 432 ms 512 KB Output is correct
80 Correct 543 ms 512 KB Output is correct
81 Correct 529 ms 548 KB Output is correct
82 Correct 543 ms 548 KB Output is correct
83 Correct 415 ms 544 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 64 ms 452 KB Output is correct
86 Correct 430 ms 548 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 72 ms 384 KB Output is correct
90 Correct 75 ms 384 KB Output is correct
91 Correct 82 ms 504 KB Output is correct
92 Correct 510 ms 512 KB Output is correct
93 Correct 511 ms 512 KB Output is correct
94 Correct 522 ms 544 KB Output is correct
95 Correct 1 ms 288 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 411 ms 632 KB Output is correct
98 Correct 60 ms 384 KB Output is correct
99 Correct 422 ms 632 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 61 ms 384 KB Output is correct
102 Correct 60 ms 384 KB Output is correct
103 Correct 400 ms 544 KB Output is correct
104 Correct 1 ms 384 KB Output is correct
105 Correct 1 ms 384 KB Output is correct
106 Correct 1 ms 384 KB Output is correct
107 Correct 71 ms 456 KB Output is correct
108 Correct 97 ms 384 KB Output is correct
109 Correct 554 ms 552 KB Output is correct
110 Correct 576 ms 632 KB Output is correct
111 Correct 1 ms 384 KB Output is correct