제출 #432138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432138		MilosMilutinovic	Cave (IOI13_cave)	C++14	100 / 100	1063 ms	580 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];
    for (int i = 0; i < N; i++)
        combination[i] = 0;

    bool locked[N];
    for (int i = 0; i < N; i++)
        locked[i] = false;

    int position[N];
    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 is_correct = (current == -1 || current > i);

        if (!is_correct) {
            assert(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[positions[j]] ^= 1;

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

                for (int j = 0; j <= mid; j++)
                    combination[positions[j]] ^= 1;
            }
            assert(pos != -1);
            combination[positions[pos]] = 1;
            locked[positions[pos]] = true;
            position[positions[pos]] = i;
        } else {
            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[positions[j]] ^= 1;

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

                for (int j = 0; j <= mid; j++)
                    combination[positions[j]] ^= 1;
            }
            assert(pos != -1);
            locked[positions[pos]] = true;
            position[positions[pos]] = i;
        }
    }
    answer(combination, position);
}

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

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

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