oj.uz

Submission #970604

# Submission time Handle Problem Language Result Execution time Memory
970604 2024-04-26T18:46:25 Z Acanikolic Cave (IOI13_cave) C++14
21 / 100
 25 ms 600 KB 
#include <bits/stdc++.h>
 
#include "cave.h"
 
using namespace std;
 
void exploreCave(int N) {
    int S[N],D[N];
    for(int i = 0; i < N; i++) {
        S[i] = 0;
        D[i] = -1;
    }
    for(int k = 0; k < N; k++) {
        int index = tryCombination(S);
        if(index == -1) break;
        for(int j = 0; j < N; j++) {
            if(D[j] != -1) continue;
            S[j] ^= 1;
            if(tryCombination(S) > index || tryCombination(S) == -1) {
                D[j] = index;
                break;
            }
            S[j] ^= 1;
        }
    }
    int SS[N];
    for(int i = 0; i < N; i++) {
        SS[i] = 1;
    }
    for(int i = 0; i < N; i++) if(D[i] != -1) SS[i] = S[i];
    for(int k = 0; k < N; k++) {
        int index = tryCombination(SS);
        if(index == -1) break;
        for(int j = 0; j < N; j++) {
            if(D[j] != -1) continue;
            SS[j] ^= 1;
            if(tryCombination(SS) > index || tryCombination(SS) == -1) {
                D[j] = index;
                break;
            }
            SS[j] ^= 1;
        }
    }
    answer(S,D);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB too much calls on tryCombination()
4 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Incorrect 1 ms 348 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -