제출 #849815

#제출 시각아이디문제언어결과실행 시간메모리
849815JooDdae동굴 (IOI13_cave)C++17
33 / 100
99 ms600 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int a[N], b[N], c[N]; for(int i=0;i<N;i++) a[i] = b[i] = c[i] = -1; for(int i=0;i<N;i++) { vector<int> v; for(int j=0;j<N;j++) if(b[j] == -1) { a[j] = 0, v.push_back(j); } int re = tryCombination(a); int flag = (re < 0 || re > i ? 0 : 1); for(int x : v) a[x] = flag; // assert(-1 == tryCombination(a) || tryCombination(a) > i); for(int x : v) { a[x] = !flag; re = tryCombination(a); if(-1 < re && re <= i) { c[x] = i; b[x] = a[x] = flag; break; } a[x] = flag; } // while(v.size() > 1) { // int mid = v.size()/2; // for(int i=0;i<v.size();i++) a[v[i]] = (i < mid) ^ flag; // int re = tryCombination(a); // for(int i=0;i<v.size();i++) a[v[i]] = flag; // if(re == -1 || re > i) v = vector(v.begin()+mid, v.end()); // else v = vector(v.begin(), v.begin()+mid); // } // c[v[0]] = i, b[c[i]] = a[c[i]] = flag; } answer(b, c); }
#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...