제출 #256529

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

cave

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
#include "cave.h"

typedef int ll;

using namespace std;

void exploreCave(int n)
{
    ll sw[n];
    memset(sw,0,n);
    ll odg[n];
    memset(odg,-1,n);
    for (int j = 0; j < n; j++){
        ll t[n];
        for (int i = 0; i < n; i++)
         t[i] = sw[i];
        vector <ll> free;
        for (int i = 0; i < n; i++)
            if (odg[i] == -1)
             free.push_back(i), t[i] = 1;
        ll ask = tryCombination(t);
        ll trig;
        if (ask == j)
            trig = 0;
        else
            trig = 1;
        ll l = 0, r = free.size() - 1;
        while (l < r){
            ll mid = (l+r)/2;
            for (int i = l; i <= mid; i++)
                t[free[i]] = trig;
            for (int i = 0; i < l; i++)
                t[free[i]] = (trig+1)%2;
            for (int i = mid + 1; i < free.size(); i++)
                t[free[i]] = (trig+1)%2;
            ask = tryCombination(t);
            if (ask == j)
                 l = mid + 1;
            else
                 r = mid;
        }
        sw[l] = trig;
        odg[l] = j;
    }
    answer(sw,odg);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:39:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i = mid + 1; i < free.size(); i++)
                                   ~~^~~~~~~~~~~~~

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