oj.uz

Submission #921934

# Submission time Handle Problem Language Result Execution time Memory
921934 2024-02-04T14:21:49 Z Aiperiii Cave (IOI13_cave) C++14
13 / 100
 9 ms 560 KB 
#include <bits/stdc++.h>
#include "cave.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;

void exploreCave(int N) {
   int q[N],g[N];
   for(int i=0;i<N;i++){
      q[i]=0;
   }
   for(int i=0;i<N;i++){
      q[i]=1;
      int res=tryCombination(q);
      g[i]=res;
      q[i]=0;
   }
   answer(q,g);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 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 344 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 9 ms 560 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 9 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 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -