Submission #1055553

#TimeUsernameProblemLanguageResultExecution timeMemory
1055553MrPavlitoCave (IOI13_cave)C++17
0 / 100
190 ms524 KiB
#include "cave.h" #include <bits/stdc++.h> //#define int long long #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define sc second #define endl "\n" #define pii pair<int,int> using namespace std; const int MAXN = 5e3+5; const int mod7 = 1e9+7; const long long inf = 1e18; void exploreCave(int N) { int n = N; int trenutnacomb[n]; int solved[n]; for(int i=0; i<n; i++)trenutnacomb[i] = 0, solved[i] = 0; for(int i=0; i<n; i++) { int t = tryCombination(trenutnacomb); int l = 0; int r = n-1; while(l<r) { int mid = l+r >> 1; int pre[n]; for(int i=0; i<n; i++)pre[i] = trenutnacomb[i]; for(int i=l; i<= mid; i++)if(!solved[i])trenutnacomb[i] ^= 1; int p = tryCombination(trenutnacomb); bool pomoc; if(p == i && t == i)pomoc = true; else if(p != i && t == i)pomoc = false; else if(p == i && t !=i) pomoc = false; else pomoc = true; if(pomoc)r = mid; else l = mid+1; for(int i=0; i<n; i++)trenutnacomb[i] = pre[i]; t = p; } solved[i] = l; if(t == i)trenutnacomb[l] ^= 1; } answer(trenutnacomb, solved); }

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:31:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |             int mid = l+r >> 1;
      |                       ~^~
#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...