Submission #1195767

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195767		Nonbangkok	Cave (IOI13_cave)	C++17	0 / 100	349 ms	524 KiB

cave

#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[l-1] = k;
        D[l-1] = i;
        fix[l-1] = true;   
    }
    answer(S,D);
}

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