Submission #1195768

#TimeUsernameProblemLanguageResultExecution timeMemory
1195768NonbangkokCave (IOI13_cave)C++17
100 / 100
544 ms540 KiB
#include <bits/stdc++.h> #include "cave.h" #define coutf(n, m) cout << fixed << setprecision(n) << m #define forr(i, a, n) for (int i = a; i < n; i++) #define forl(i, a, n) for (int i = a; i > n; i--) #define macos ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define endll "\n" #define sp " " typedef long long ll; using namespace std; const int N = 5010; int k; int S[N],D[N],test[N]; bool fix[N]; void exploreCave(int n) { forr(i,0,n){ k = (tryCombination(S)==i); int l = 0, r = n - 1,m; while(l<r){ m = (l+r) >> 1; forr(j,0,n){ if(fix[j])test[j] = S[j]; else if(l<=j&&j<=m)test[j] = 1 - k; else test[j] = k; } if(tryCombination(test)==i)r = m; else l = m + 1; } S[r] = k; D[r] = i; fix[r] = true; } 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...