제출 #272529

#제출 시각아이디문제언어결과실행 시간메모리
272529shinjanCave (IOI13_cave)C++14
46 / 100
20 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; tren=tryCombination(s); int x; while(tren!=-1) { 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; } } } } 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...