Submission #985341

#TimeUsernameProblemLanguageResultExecution timeMemory
985341user736482Cave (IOI13_cave)C++17
12 / 100
35 ms564 KiB
#include<bits/stdc++.h> #include<cave.h> using namespace std; int result[5002],match[5002],sent[5002]; bool iflastopen,fixed_[5002]; int N; void change(int a, int b, bool c){ for(int i=a;i<=b;i++){ if(!fixed_[i]) sent[i]= c; } } void exploreCave(int n){ N = n; for(int j=0;j<n;j++){ change(0,n-1,0); int p=tryCombination(sent); if(!(p==j)) iflastopen=0; else iflastopen=1; int pocz=j; sent[pocz] = iflastopen; match[j]=pocz; fixed_[pocz]=1; } answer(sent,match); }
#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...