oj.uz

Submission #985357

# Submission time Handle Problem Language Result Execution time Memory
985357 2024-05-17T16:42:10 Z SzymonKrzywda Cave (IOI13_cave) C++17
13 / 100
 33 ms 564 KB 
#include"cave.h"
#include <bits/stdc++.h>
using namespace std;

int tryCombination(int S[]);

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

void exploreCave(int N){
    int D[N],S[N],w=0;
    //int S_2[N];
    // 0 0 0 0 0
    // 1 1 1 1 1
    // 1 1 1 1 0

    //1110
    //3102
    
    
    for (int i=0; i<N; i++){
        if(w==-1) break;
        if (w > i) continue;
        
        for (int j=0; j<N; j++){
            S[j] = (S[j]+1)%2;
            w = tryCombination(S);
            if(w==-1) break;
            if (w>i) break;
            S[j] = (S[j]+1)%2;
        }
    }
    
    for (int i=0; i<N; i++){
            S[i] = (S[i]+1)%2;
            D[i] = tryCombination(S);
            S[i] = (S[i]+1)%2;
        }
    answer(S,D);
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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