제출 #1015004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015004		Mardonbekhazratov	Cave (IOI13_cave)	C++17	100 / 100	245 ms	1112 KiB

cave

#include "cave.h"
#include<iostream>
#include<set>
#include<vector>
const int maxN=5e3+1;

int n;
int S[maxN],D[maxN];
std::set<int>s;

void solve(int x){
    int ans=tryCombination(S);
    std::vector<int>a;
    for(int k:s) a.push_back(k);
    if(ans==x){
        int l=0,r=(int)a.size()-1;
        while(r>l){
            int mid=(l+r)/2;
            for(int j=0;j<=mid;j++){
                S[a[j]]=1;
            }
            if(tryCombination(S)!=x) r=mid;
            else l=mid+1;
            for(int j=0;j<=mid;j++){
                S[a[j]]=0;
            }
        }
        D[a[l]]=x;
        S[a[l]]=1;
        s.erase(a[l]);
        return;
    }
        int l=0,r=(int)a.size()-1;
        while(r>l){
            int mid=(l+r)/2;
            for(int j=0;j<=mid;j++){
                S[a[j]]=1;
            }
            if(tryCombination(S)==x) r=mid;
            else l=mid+1;
            for(int j=0;j<=mid;j++){
                S[a[j]]=0;
            }
        }
        D[a[l]]=x;
        S[a[l]]=0;
        s.erase(a[l]);
}

void exploreCave(int N) {
    n=N;
    for(int i=0;i<n;i++) s.insert(i),D[i]=-1,S[i]=0;
    for(int i=0;i<n;i++){
        solve(i);
    }
    answer(S,D);
}

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