Submission #245743

#TimeUsernameProblemLanguageResultExecution timeMemory
245743uacoder123Cave (IOI13_cave)C++14
34 / 100
126 ms640 KiB
#include <bits/stdc++.h> using namespace std; #include <cave.h> void exploreCave(int N) { int n=N; int arr[n]={}; while(tryCombination(arr)!=-1) { int ix,x=tryCombination(arr); int i=0; ix=x; while(ix==x) { arr[i]^=1; int iix=tryCombination(arr); if(iix<=ix&&iix!=-1) arr[i]^=1; else x=iix; i++; } } int d[n]; for(int i=0;i<n;++i) { arr[i]^=1; d[i]=tryCombination(arr); arr[i]^=1; } answer(arr,d); exit(0); }
#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...