Submission #507343

# Submission time Handle Problem Language Result Execution time Memory
507343 2022-01-12T11:01:23 Z amukkalir Cave (IOI13_cave) C++17
46 / 100
15 ms 448 KB
#include "cave.h"
#include <bits/stdc++.h> 
using namespace std; 

int ud[5005]; 

void exploreCave(int N) {
    int S[N], D[N]; 
    for(int i=0; i<N; i++){
        S[i] = 0; 
        D[i] = -1; 
    }

    int rep = tryCombination(S); 
 
    while(rep != -1) {
        for(int i=0; i<N; i++) { 
            if(ud[i]) continue; //alr asked
            ud[i] = true; 
            S[i] ^= 1; 
            int nrep = tryCombination(S); 
            if(nrep == -1) {
                rep = -1;  
                break; 
            }
            else if(nrep < rep) {
                S[i] ^= 1; 
                D[i] = nrep; 
            } else if(nrep > rep) {
                D[i] = rep; 
                rep = nrep; //rep is like the farthest we can go
            }
            else ud[i] = false; 
        } 
    }

    for(int i=0; i<N; i++) {
        if(D[i] == -1) {
            S[i] ^= 1; 
            D[i] = tryCombination(S); 
            S[i] ^= 1; 
        }
    }

    answer(S, D);
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 308 KB Output is correct
2 Correct 9 ms 332 KB Output is correct
3 Correct 10 ms 448 KB Output is correct
4 Correct 7 ms 424 KB Output is correct
5 Correct 14 ms 352 KB Output is correct
6 Correct 10 ms 436 KB Output is correct
7 Correct 10 ms 440 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 13 ms 380 KB Output is correct
13 Correct 9 ms 436 KB Output is correct
14 Correct 9 ms 444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 324 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 12 ms 412 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 332 KB Output is correct
7 Correct 9 ms 424 KB Output is correct
8 Correct 10 ms 428 KB Output is correct
9 Correct 10 ms 408 KB Output is correct
10 Correct 15 ms 432 KB Output is correct
11 Correct 10 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Incorrect 8 ms 360 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 308 KB Output is correct
2 Correct 9 ms 332 KB Output is correct
3 Correct 10 ms 448 KB Output is correct
4 Correct 7 ms 424 KB Output is correct
5 Correct 14 ms 352 KB Output is correct
6 Correct 10 ms 436 KB Output is correct
7 Correct 10 ms 440 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 13 ms 380 KB Output is correct
13 Correct 9 ms 436 KB Output is correct
14 Correct 9 ms 444 KB Output is correct
15 Correct 11 ms 324 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 12 ms 412 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 12 ms 332 KB Output is correct
21 Correct 9 ms 424 KB Output is correct
22 Correct 10 ms 428 KB Output is correct
23 Correct 10 ms 408 KB Output is correct
24 Correct 15 ms 432 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 300 KB Output is correct
45 Incorrect 8 ms 360 KB too much calls on tryCombination()
46 Halted 0 ms 0 KB -