oj.uz

Submission #985318

# Submission time Handle Problem Language Result Execution time Memory
985318 2024-05-17T15:02:51 Z SzymonKrzywda Cave (IOI13_cave) C++17
0 / 100
 126 ms 540 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];
    //int S_2[N];
    // 0 0 0 0 0
    // 1 1 1 1 1
    // 1 1 1 1 0

    //1110
    //3102
    int S_1[N];
    int S_2[N];
    for (int i=0; i<N; i++) S_2[i] = 1;
    bool good[N];
    int w = 0,akt=0,w_2=0,ktory=0;
    while (w != -1){
        if (akt == 0){
            w = tryCombination(S_1);
            if (w == -1){
                ktory = 0;
                break;
            }
            for (int i=0; i<N; i++){
                if (!good[i]){
                    S_1[i] = 1;
                    w_2 = tryCombination(S_1);
                    if (w_2 == -1){
                        ktory = 0;
                        break;
                    }
                    if (w_2 < w){
                        S_2[i] = 0;
                        S_1[i] = 0;
                        good[i] = true;
                    }
                    else if(w_2 > w){
                        good[i] = true;
                    }
                    else S_1[i] = 0;
                }
            }
        }
        else{
            w = tryCombination(S_2);
            if (w == -1){
                ktory = 1;
                break;
            }
            for (int i=0; i<N; i++){
                if (!good[i]){
                    S_2[i] = 0;
                    w_2 = tryCombination(S_2);
                    if (w_2 == -1){
                        ktory = 1;
                        break;
                    }
                    if (w_2 < w){
                        S_2[i] = 1;
                        S_1[i] = 1;
                        good[i] = true;
                    }
                    else if(w_2 > w){
                        good[i] = true;
                    }
                    else S_2[i] = 1;
                }
            }
        }
        akt = (akt+1)%2;
    }
    if (ktory == 0){
        for (int i=0; i<N; i++){
            S_1[i] = (S_1[i]+1)%2;
            D[i] = tryCombination(S_1);
            S_1[i] = (S_1[i]+1)%2;
        }
        answer(S_1,D);
    }
    else{
        for (int i=0; i<N; i++){
            S_2[i] = (S_2[i]+1)%2;
            D[i] = tryCombination(S_2);
            S_2[i] = (S_2[i]+1)%2;
        }
        answer(S_2,D);
    }

}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 540 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 8 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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