Submission #650778

#TimeUsernameProblemLanguageResultExecution timeMemory
650778LitusianoCave (IOI13_cave)C++14
25 / 100
18 ms428 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; //#define int long long void exploreCave(int N) { /* ... */ int v[N]; for(int i = 0; i<N; i++){ v[i] = 0; } int s[N]; for(int i = 0; i<N; i++) s[i] = i; if(tryCombination(v) == -1){ for(int i = 0; i<N; i++){ v[i] = 1; s[i] = tryCombination(v); v[i] = 0; } } else{ for(int i = 0; i<N; i++){ if(tryCombination(v) == i){ v[i]^=1; } } } answer(v,s); //for(int i = 0; i<N; i++) cout<<v[i]<<" "; cout<<endl; //for(int i = 0; i<N; i++) cout<<s[i]<<" "; cout<<endl; 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...