Submission #488398

#TimeUsernameProblemLanguageResultExecution timeMemory
488398SlavicGCave (IOI13_cave)C++17
0 / 100
381 ms420 KiB
#include "bits/stdc++.h" #include"cave.h" using namespace std; #define ll long long #define forn(i,n) for(int i=0;i<n;i++) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(),v.rend() #define pb push_back #define sz(a) (int)a.size() /* int tryCombination(vector<int> s){return 0;} void answer(vector<int> s, vector<int> k){return;} */ void exploreCave(int n){ vector<int> v; vector<int> k; vector<int> a(n, -1); while(sz(v) < n){ int cur = sz(v); int c[n]; for(int i = 0;i < sz(a);++i)c[i] = a[i]; for(int i = 0;i < n; ++i){ if(c[i] == -1)c[i] = 1; } int f = tryCombination(c); int x = (f > sz(v) || f == -1); int l = 0, r = n - 1, idx = -1; while(l <= r){ int mid = l + r >> 1; for(int i = 0;i < sz(a);++i)c[i] = a[i]; for(int i = 0;i < mid; ++i){ if(c[i] == -1)c[i] = x; } for(int i = mid;i < n; ++i){ if(c[i] == -1)c[i] = (!x); } f = tryCombination(c); if(f > sz(v) || f == -1){ idx = mid; r = mid - 1; }else l = mid + 1; } v.pb(idx); k.pb(x); } int s[n], d[n]; for(int i = 0;i < n; ++i){ s[i] = v[i], d[i] = k[i]; } answer(s, d); } /* void solve() { } int32_t main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; //cin >> t; while(t--) { solve(); } } */

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:35:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |             int mid = l + r >> 1;
      |                       ~~^~~
cave.cpp:24:13: warning: unused variable 'cur' [-Wunused-variable]
   24 |         int cur = sz(v);
      |             ^~~
#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...