제출 #585095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
585095		Einsitein	동굴 (IOI13_cave)	C++98	100 / 100	233 ms	460 KiB

cave

#include "cave.h"
 
#include <bits/stdc++.h>
 
using namespace std;
 
namespace
{
} // namespace
 
void exploreCave(int N)
{
    vector<int> s(N);
    vector<int> d(N);
 
    vector<int> guess(N, 0);
 
    vector<bool> done(N, 0);
 
    auto toggle = [&](int l, int r) -> void
    {
        for (int i = l; i < r; i++)
        {
            if (!done[i])
                guess[i] ^= 1;
        }
    };
 
    for (int i = 0; i < N; i++)
    {
        int lo = 0, hi = N;
 
        bool last = (tryCombination(guess.data()) + N + 1) % (N + 1) > i;
        while (hi - lo > 1)
        {
            int mid = (lo + hi) / 2;
            toggle(lo, mid);
            if (last != (tryCombination(guess.data()) + N + 1) % (N + 1) > i)
            {
                last = !last;
                hi = mid;
            }
            else
                lo = mid;
        }
 
        s[lo] = last ^ guess[lo] ^ 1;
        d[lo] = i;
        done[lo] = 1;
        guess[lo] = s[lo];
    }
 
    answer(s.data(), d.data());
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:38:74: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
   38 |             if (last != (tryCombination(guess.data()) + N + 1) % (N + 1) > i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

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