제출 #432097

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

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

int tryCombination(int S[]);

void answer(int S[], int D[]);

void exploreCave(int N) {
    int combination[N];
    vector<bool> locked(N, false);

    for (int i = 0; i < N; i++) {
        vector<int> positions;
        for (int j = 0; j < N; j++)
            if (!locked[j])
                positions.push_back(j);

        int current = tryCombination(combination);
        bool need_diff = (current == -1 || current > i);

        int bot = 0, top = (int) positions.size() - 1, pos = -1;
        while (bot <= top) {
            int mid = bot + top >> 1;
            for (int j = 0; j < mid; j++)
                combination[j] ^= 1;
            if (need_diff)
                combination[mid] ^= 1;

            if (tryCombination(combination) == i)
                pos = mid, bot = mid + 1;
            else
                top = mid - 1;

            for (int j = 0; j < mid; j++)
                combination[j] ^= 1;
            if (need_diff)
                combination[mid] ^= 1;
        }

        assert(pos != -1);

        locked[pos] = true;
        combination[pos] ^= 1;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:24:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |             int mid = bot + top >> 1;
      |                       ~~~~^~~~~

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