oj.uz

Submission #962653

# Submission time Handle Problem Language Result Execution time Memory
962653 2024-04-14T06:19:30 Z n3rm1n Cave (IOI13_cave) C++17
0 / 100
 150 ms 484 KB 
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
    int n = N;
    int s[n];
    int feedback = 0;
    while(true)
    {
        
        feedback = tryCombination(s);
        //cout << feedback << endl;
        if(feedback == -1)break;
        else
        {
            s[feedback] = 1;
            
        }
    }
    int c[n], d[n];
    for (int i = 0; i < n; ++ i)
        c[i] = s[i];
    for (int i = 0; i < n; ++ i)
    {
        c[i] = 1 - c[i];
        feedback = tryCombination(c);
        d[i] = feedback;
        c[i] = 1 - c[i];
    }
    answer(s, d);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 150 ms 484 KB too much calls on tryCombination()
2 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 109 ms 348 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -