제출 #204729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204729		bogdan_ogorodniy	동굴 (IOI13_cave)	C++14	0 / 100	560 ms	732 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
const int inf = 1e9 + 7;
int N;
int _S[5001], _P[5001];
// void answer(int a[], int b[]) {
//     for (int i = 0; i < N; i++) cout << a[i] << ' '; cout << '\t'; for (int i = 0; i < N; i++) cout << _S[i] << ' '; cout << '\n';
//     for (int i = 0; i < N; i++) cout << b[i] << ' '; cout << '\t'; for (int i = 0; i < N; i++) cout << _P[i] << ' '; cout << '\n';
// }
// int tryCombination(int a[]) {
//     int ans = 0;
//     vector <int> op(N + 1, 0);
//     for (int i = 0; i < N; i++) {
//         if (_S[i] == a[i]) op[_P[i]] = true;
//     }
//     while (op[ans++]);
//     return ans - 1;
// }
int temp[5001];
int s[5001], p[5001];
bool fnd[5001];
void sett(int pos, int f) {
    memset(temp, 0, sizeof temp);
    for (int i = 0; i < pos; i++) {
        if (!fnd[i]) {
            temp[i] = f;
        }
        else {
            temp[i] = s[i];
        }
    }
    for (int i = pos; i < N; i++) {
        if (!fnd[i]) {
            temp[i] = !f;
        }
        else {
            temp[i] = s[i];
        }
    }
}
void exploreCave(int n) {
    N = n;
    for (int i = 0; i < n; i++) {
        // find the switch connected with i-th door
        // find the switch position 1/0
        sett(n, 1);
        int k = tryCombination(temp);
        // in (fnd) -- already used swithces
        bool f = 0;
        if (k >= i + 1) {
            f = true;
        }
        else {
            f = false;
        }
        int l = 0, 
            r = n;
        while (r - l > 1) {
            int m = (l + r) / 2;
            sett(m + 1, f);
            int k = tryCombination(temp);
            if (k >= i + 1) {
                r = m;
            }
            else {
                l = m;
            }
        }
        sett(l + 1, f);
        k = tryCombination(temp);
        if (k >= i + 1) {
            p[l] = i;
            s[l] = f;
            fnd[l] = true;
        }
        else {
            p[r] = i;
            s[r] = f;
            fnd[r] = true;
        }
    }
    answer(s, p);
}
// signed main() {
//     N = 4;
//     _P[0] = 3; _P[1] = 1; _P[2] = 0; _P[3] = 2;
//     _S[0] = 1; _S[1] = 1; _S[2] = 1;
//     exploreCave(N);
//     return 0;
// } 

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