oj.uz

Submission #306324

# Submission time Handle Problem Language Result Execution time Memory
306324 2020-09-25T08:23:19 Z amunduzbaev Cave (IOI13_cave) C++14
0 / 100
 4 ms 384 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
 
void exploreCave(int n) {
	int v[n],ans[n];
  memset(v,0,sizeof(v));
    for(int i=0;i<n;i++){
        ans[i]=i;
    }
 
    int cor = tryCombination(v);
    while(cor!=-1){
        v[cor]=1;
        tryCombination(v);
    }
    answer(v,ans);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 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 2 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 2 ms 384 KB Answer is wrong
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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