oj.uz

Submission #302935

# Submission time Handle Problem Language Result Execution time Memory
302935 2020-09-19T13:02:51 Z mohamedsobhi777 Cave (IOI13_cave) C++14
100 / 100
 549 ms 764 KB 
#include "cave.h"
#include <vector>
#include<bits/stdc++.h>

using namespace std ; 

int n ; 
int *pos, *loc; 
bool vis[10000] ; 
int it, col ;
void flip(){
        for(int i = 0 ;i < n ;i++)
                pos[i]^=1 ; 
}

vector<int> btns ; 

void init(int N){
        n = N ; 
        pos = new int[N] ;
        loc = new int[N] ; 
        memset(pos , 0 , sizeof(int) * N) ; 
        memset(loc , 0 , sizeof(int) * N) ;
        for(int i = 0 ;i < N ;i++)
                btns.push_back(i) ;
}

int go(vector<int> vec, vector<int> vec2, int door){
        int ret = n ; 
        int *qu = pos ; 
        for(auto u : vec){
                qu[u] = col ;
        }
        for(auto u : vec2){
                qu[u] = !col; 
        }
        ret = tryCombination(qu) ;

        return ret != door ; 
}

void solve( vector<int> swi , int door){
        if(swi . size() == 1){
                pos[swi[0]] = 0 ; 
                if(tryCombination(pos) == door){
                        pos[swi[0]] ^= 1 ; 
                }                        
                vis[swi[0]] = 1 ; 

                loc[ swi[0] ] = it ; 
                for(int i = 0 ;i < (int) btns.size() ; ++ i){
                        if(btns[i] == swi[0]){
                                btns.erase(btns.begin() + i) ;
                                break ; 
                        }
                }
                it++ ;
                return ; 
        }
        vector<int> LHS , RHS ; 
        int sz = (int) swi.size() ; 
        for(int i = 0 ;i < sz ;i ++){
                if(i < sz / 2)
                        LHS.push_back(swi[i]) ; 
                else
                        RHS.push_back(swi[i]) ; 
        }

        if(go(LHS, RHS , door)){
                solve(LHS, door) ; 
        }else{
                solve(RHS, door) ; 
        }

}

void exploreCave(int N) {
        init(N); 
        for(int i = 0 ;i < n;i++){
                for(int j = 0 ;j < n ;j ++){
                        if(!vis[j])
                                pos[j] = 0 ; 
                }
                col = (tryCombination(pos) == i) ;
                solve(btns , i) ;         
        }

        answer(pos , loc) ; 
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 512 KB Output is correct
2 Correct 310 ms 700 KB Output is correct
3 Correct 466 ms 760 KB Output is correct
4 Correct 323 ms 632 KB Output is correct
5 Correct 481 ms 760 KB Output is correct
6 Correct 458 ms 632 KB Output is correct
7 Correct 482 ms 628 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 454 ms 756 KB Output is correct
13 Correct 463 ms 632 KB Output is correct
14 Correct 463 ms 512 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 632 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 484 ms 628 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 482 ms 640 KB Output is correct
7 Correct 503 ms 752 KB Output is correct
8 Correct 533 ms 632 KB Output is correct
9 Correct 549 ms 640 KB Output is correct
10 Correct 542 ms 632 KB Output is correct
11 Correct 486 ms 632 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 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 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 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 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 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 79 ms 452 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 87 ms 384 KB Output is correct
24 Correct 87 ms 472 KB Output is correct
25 Correct 88 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 81 ms 384 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 82 ms 384 KB Output is correct
31 Correct 80 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 86 ms 476 KB Output is correct
36 Correct 88 ms 632 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 318 ms 512 KB Output is correct
2 Correct 310 ms 700 KB Output is correct
3 Correct 466 ms 760 KB Output is correct
4 Correct 323 ms 632 KB Output is correct
5 Correct 481 ms 760 KB Output is correct
6 Correct 458 ms 632 KB Output is correct
7 Correct 482 ms 628 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 454 ms 756 KB Output is correct
13 Correct 463 ms 632 KB Output is correct
14 Correct 463 ms 512 KB Output is correct
15 Correct 483 ms 632 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 484 ms 628 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 482 ms 640 KB Output is correct
21 Correct 503 ms 752 KB Output is correct
22 Correct 533 ms 632 KB Output is correct
23 Correct 549 ms 640 KB Output is correct
24 Correct 542 ms 632 KB Output is correct
25 Correct 486 ms 632 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 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 2 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 0 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 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 79 ms 452 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 87 ms 384 KB Output is correct
49 Correct 87 ms 472 KB Output is correct
50 Correct 88 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 81 ms 384 KB Output is correct
54 Correct 1 ms 512 KB Output is correct
55 Correct 82 ms 384 KB Output is correct
56 Correct 80 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 86 ms 476 KB Output is correct
61 Correct 88 ms 632 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 307 ms 632 KB Output is correct
64 Correct 312 ms 632 KB Output is correct
65 Correct 471 ms 632 KB Output is correct
66 Correct 328 ms 632 KB Output is correct
67 Correct 480 ms 632 KB Output is correct
68 Correct 455 ms 632 KB Output is correct
69 Correct 491 ms 628 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 447 ms 628 KB Output is correct
73 Correct 454 ms 764 KB Output is correct
74 Correct 455 ms 628 KB Output is correct
75 Correct 482 ms 632 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 480 ms 632 KB Output is correct
79 Correct 499 ms 752 KB Output is correct
80 Correct 537 ms 628 KB Output is correct
81 Correct 537 ms 632 KB Output is correct
82 Correct 534 ms 628 KB Output is correct
83 Correct 474 ms 632 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 79 ms 384 KB Output is correct
86 Correct 450 ms 760 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 87 ms 384 KB Output is correct
90 Correct 91 ms 504 KB Output is correct
91 Correct 90 ms 384 KB Output is correct
92 Correct 519 ms 628 KB Output is correct
93 Correct 518 ms 632 KB Output is correct
94 Correct 520 ms 640 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 458 ms 636 KB Output is correct
98 Correct 83 ms 504 KB Output is correct
99 Correct 456 ms 628 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 83 ms 384 KB Output is correct
102 Correct 88 ms 472 KB Output is correct
103 Correct 447 ms 628 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 86 ms 384 KB Output is correct
108 Correct 85 ms 384 KB Output is correct
109 Correct 521 ms 764 KB Output is correct
110 Correct 523 ms 624 KB Output is correct
111 Correct 1 ms 384 KB Output is correct