Submission #1006257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1006257		Tymond	Cave (IOI13_cave)	C++14	100 / 100	219 ms	816 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}

const int MAXN = 5e3 + 7;
int s[MAXN];
int d[MAXN];
bool f[MAXN];

void update(int l, int p){
    for(int i = l; i <= p; i++){
        if(!f[i]){
            s[i] = (s[i] ^ 1);
        }
    }
}
 
void exploreCave(int n) {
    for(int i = 0; i < n; i++){
        int res = tryCombination(s);
        int z = ((res > i || res == -1) ? 0 : 1);
        
        int l = 0;
        int p = n - 1;
        int mid;
        while(l < p){
            mid = (l + p) / 2;
            update(l, mid);
            res = tryCombination(s);
            update(l, mid);
            int nz = ((res > i || res == -1) ? 0 : 1);
            if(nz != z){
                p = mid;
            }else{
                l = mid + 1;
            }
        }
        
        f[l] = 1;
        s[l] = z;
        d[l] = i;
    }
    
    answer(s, d);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24