oj.uz

Submission #316522

# Submission time Handle Problem Language Result Execution time Memory
316522 2020-10-26T14:00:43 Z nandonathaniel Cave (IOI13_cave) C++14
0 / 100
 11 ms 384 KB 
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;
const int MAXN=5005;
int S[MAXN],arr[MAXN];

void exploreCave(int N) {
    for(int i=0;i<N;i++){
    	arr[i]=i;
    	S[i]=0;
    	if(tryCombination(S)>i)continue;
    	else S[i]=1;
	}
	answer(S,arr);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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