제출 #83014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83014		updown1	동굴 (IOI13_cave)	C++17	100 / 100	428 ms	516 KiB

cave

//#include "grader.h" /// yandex
#include "cave.h" /// oj.uz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, N)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e endl
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const int MAXN = 5000;
//500,000,000 operations
int S[MAXN], D[MAXN];
bool done[MAXN];
void toggle (int a, int b) {
    For (i, a, b+1) if (!done[i]) S[i] = 1-S[i];
}
void exploreCave(int N) {
    ffi {
        /// determine which switch effects this door
        ffj if (!done[j]) S[j] = 0;
        int x = tryCombination(S);
        bool pp = (x == -1 || x > i);
        int a = 0, b = N-1;
        while (a != b) {
            int mid = (a+b)/2;
            toggle(a, mid);
            x = tryCombination(S);
            bool p = (x == -1 || x > i);
            if (pp != p) b = mid;
            else a = mid+1;
            pp = p;
        }
        D[a] = i;
        done[a] = true;
        if (!pp) S[a] = 1-S[a];
    }
    answer(S, D);
}

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