Submission #272678

#TimeUsernameProblemLanguageResultExecution timeMemory
272678shinjanCave (IOI13_cave)C++14
13 / 100
152 ms512 KiB
#include <iostream> #include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int n) { int s[n]; int d[n]; for(int i=0;i<n;i++) { s[i]=0; d[i]=-1; } int tren,prob; tren=tryCombination(s); int x; while(tren!=-1) { prob=tren; s[prob]=!s[prob]; int res=tryCombination(s); while(res<tren) { d[res]=prob; if(res==-1) { tren=-1; break; } s[prob]=!s[prob]; prob=res; s[prob]=!s[prob]; res=tryCombination(s); } if(res>tren) { d[tren]=prob; tren=res; } else if(res==tren) { for(int i=0;i<n;i++) { if(d[i]<0) { s[i]=(!s[i]); x=tryCombination(s); if(x==-1) { d[i]=x; tren=x; break; } if(x<tren) { d[i]=x; s[i]=(!s[i]); } else if(x>tren) { d[i]=tren; tren=x; break; } } } } } for(int i=0;i<n;i++) { if(d[i]<0) { s[i]=(!s[i]); d[i]=tryCombination(s); s[i]=(!s[i]); } } answer(s,d); }
#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...