| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1105171 | jadai007 | Cave (IOI13_cave) | C++17 | 12 ms | 532 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int state[N] = {0}, link[N] = {0}, wrong = -1, s = -1;
    for(int i = 0; i < N; ++i){
		int ft = tryCombination(state);
		state[i] = 1;
		int nd = tryCombination(state);
		if(ft == -1){
			state[i] = 0;
			break;
		}
		else if(nd == -1) break;
		if(ft != nd){
            if(wrong == ft) state[i] = 1;
            else if(wrong == nd) state[i] = 0;
        }
        else wrong = ft, s = i;
	}
	for(int i = 0; i < N; ++i){
		state[i] = !state[i];
		int ck = tryCombination(state);
		link[i] = ck;
		state[i] = !state[i];
	}
	answer(state, link);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
