Submission #50699

#TimeUsernameProblemLanguageResultExecution timeMemory
50699zetapiCave (IOI13_cave)C++14
12 / 100
22 ms640 KiB
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;

const int MAX=1e5;

void exploreCave(int N) 
{
    /* ... */
    int cur,arr[MAX],other[MAX];
    for(int A=1;A<=N;A++)
    	arr[A]=0,other[A]=A;
    while(true)
    {
    	cur=tryCombination(arr);
    	if(cur==-1)
    	{
    		answer(arr,other);
    		return ;
    	}
    	arr[cur]^=1;
    }
    return ;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...