Submission #744403

#TimeUsernameProblemLanguageResultExecution timeMemory
744403Elvin_FritlCave (IOI13_cave)C++17
0 / 100
101 ms424 KiB
#include <bits/stdc++.h> using namespace std; #include "cave.h" void exploreCave(int n) { vector<int>chek(n,0),v; int d[n],s[n]; for(int i=0;i<n;i++){ s[i]=0; } int time=1; while(time<=n){ int toto=tryCombination(s); if(toto >= time){ for(int i=0;i<n;i++){ if(chek[i]==0){ s[i]=(s[i]+1)%2; int toto2=tryCombination(s); if(toto2 == toto-1){ v.push_back(i); chek[i]=1; break; } s[i]=(s[i]+1)%2; } } } else{ for(int i=0;i<n;i++){ if(chek[i]==0){ s[i]=(s[i]+1)%2; int toto2=tryCombination(s); if(toto2 == toto){ v.push_back(i); chek[i]=1; break; } s[i]=(s[i]+1)%2; } } } time++; } for(int i=0;i<n;i++){ d[i]=v[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...