제출 #1158283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158283		Sofiatpc	Cave (IOI13_cave)	C++20	100 / 100	271 ms	536 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN =5005;
int ans[MAXN], v[MAXN], s[MAXN];

void exploreCave(int n) {
    for(int i = 0; i < n; i++)ans[i] = -1;

    for(int i = 0; i < n; i++){
        int l = 0, r = n-1;

        int x;
        for(int j = 0; j < n; j++){
            if(ans[j] == -1)s[j] = 1;
            else s[j] = ans[j];
        }
        int temp = tryCombination(s);
        if(temp > i || temp == -1)x = 1;
        else x = 0;
        
        while(l != r){
            int mid = (l+r)/2;

            for(int j = 0; j <= mid; j++){
                if(ans[j] == -1)s[j] = x;
                else s[j] = ans[j];
            }
            for(int j = mid+1; j < n; j++){
                if(ans[j] == -1)s[j] = (x+1)%2;
                else s[j] = ans[j];
            }

            temp = tryCombination(s);
            if(temp > i || temp == -1)r = mid;
            else l = mid+1;
        }
        ans[l] = x;
        v[l] = i;
    }
    answer(ans,v);
}

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