Submission #396632

#TimeUsernameProblemLanguageResultExecution timeMemory
396632ak2006Cave (IOI13_cave)C++14
13 / 100
21 ms516 KiB
#include <bits/stdc++.h> #include <cave.h> using namespace std; using ll = long long; using vb = vector<bool>; using vvb = vector<vb>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vc = vector<char>; using vvc = vector<vc>; const ll mod = 1e9 + 7,inf = 1e18; #define pb push_back #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); void exploreCave(int n) { int is[n],val[n]; for (int i = 0;i<n;i++)is[i] = 0,val[i] = -1; bool done = false; for (int i = 0;i<n;i++){ int pos = tryCombination(is); if (pos == -1){done = true;break;} for (int j = 0;j<n;j++){ is[j] = !is[j]; int pos2 = tryCombination(is); if (pos2 == -1){done = true;break;} if (pos2 > pos) val[j] = pos; is[j] = !is[j]; } } assert(done); for (int i = 0;i<n;i++){ if (val[i] != -1)continue; is[i] = !is[i]; val[i] = tryCombination(is); is[i] = !is[i]; } answer(is,val); }
#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...