제출 #781059

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

cave

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

constexpr static int MXSIZE = 5000;
int n;
int s[MXSIZE], d[MXSIZE]; // Result
int c[MXSIZE]; // For queries

bool is_visibly_open(int i, int result)
{
        return result > i || result == -1;
}

void exploreCave(int N)
{
        n = N;
        for (int i = 0; i < n; i++)
                d[i] = -1;
        for (int i = 0; i < n; i++)
        {
                for (int j = 0; j < n; j++)
                        c[j] = (d[j] == -1) ? 0 : s[j];
                int correct = 1;
                if (is_visibly_open(i, tryCombination(c)))
                        correct = 0;
                int l = -1, r = n;
                while (r - l > 1)
                {
                        int m = l+r>>1;
                        for (int j = 0; j <= m; j++)
                                c[j] = (d[j] == -1) ? correct : s[j];
                        for (int j = m+1; j < n; j++)
                                c[j] = (d[j] == -1) ? (1 - correct) : s[j];
                        if (is_visibly_open(i, tryCombination(c)))
                                r = m;
                        else
                                l = m;
                }
                d[r] = i;
                s[r] = correct;
        }
        answer(s, d);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:30:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |                         int m = l+r>>1;
      |                                 ~^~

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