제출 #154676

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

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int point[5010];
bool ch[5010];
int p[5010], n;
int binopen(int st, int fin, int num){
    if(st==fin)return st;
    int mid=(st+fin)/2;
    for(int i=st; i<=mid; i++)
        if(!ch[i])p[i]*=-1;
    int t=tryCombination(p);
    for(int i=st; i<=mid; i++)
        if(!ch[i])p[i]*=-1;
    if(t==num)return binopen(st, mid, num);
    return binopen(mid+1, fin, num);
}
int binclose(int st, int fin, int num){
    if(st==fin)return st;
    int mid=(st+fin)/2;
    for(int i=st; i<=mid; i++)
        if(!ch[i])p[i]*=-1;
    int t=tryCombination(p);
    for(int i=st; i<=mid; i++)
        if(!ch[i])p[i]*=-1;
    if(t>num)return binclose(st, mid, num);
    return binclose(mid+1, fin, num);
}
void exploreCave(int N){
    n=N;
    for(int i=0; i<n; i++){
        int temp=tryCombination(p);
        if(temp==i){
            int num=binclose(0, n-1, i);
            point[num]=i;
            ch[num]=true;
            p[num]*=-1;
        }
        else{
            int num=binopen(0, n-1, i);
            point[num]=i;
            ch[num]=true;
        }
    }
    answer(point, p);
}

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