제출 #548313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548313		chirathnirodha	동굴 (IOI13_cave)	C++17	13 / 100	346 ms	65536 KiB

cave

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

int n;
int matched[5000];
int door[5000];
int det[5000][3];
bool fp=false;
void foundpath(int arr[]){
    for(int i=0;i<n;i++){
        if(matched[i]==-1){
            matched[i]=arr[i];
            arr[i]=(arr[i]+1)%2;
            int val=tryCombination(arr);
            door[i]=val;
            arr[i]=(arr[i]+1)%2;
        }
    }
    return;
}
void calc(int x){
    if(fp==true)return;
    int a=det[x][0],b=det[x][1],c=det[x][2];
    if(b==c){
        matched[b]=a;
        door[b]=x;
        return;
    }
    int arr[n];
    for(int i=0;i<n;i++){
        if(matched[i]!=-1)arr[i]=matched[i];
        else arr[i]=(a+1)%2;
    }
    for(int i=b;i<=(b+c)/2;i++)if(matched[i]==-1)arr[i]=a;
    int val=tryCombination(arr);

    if(val==-1){
        foundpath(arr);
        fp=true;
        return;
    }
    else if(val>x){
        det[x][2]=(b+c)/2;
        calc(x);
    }
    else if(val==x){
        det[x][1]=(b+c)/2+1;
        calc(x);
    }
    else {  
        det[val][0]=(a+1)%2;
        det[val][1]=b;
        det[val][2]=(b+c)/2;
        calc(val);
        calc(x);
    }
    return;
}
void exploreCave(int N) {
   n=N;
   for(int i=0;i<n;i++){
       matched[i]=door[i]=-1;
       det[i][0]=-1;
       det[i][1]=0;det[i][2]=n-1;
   }
   int arr[n];memset(arr,0,sizeof(arr));
   while(true){
       for(int i=0;i<n;i++)if(matched[i]!=-1)arr[i]=matched[i];
       int val=tryCombination(arr);
       if(val==-1){foundpath(arr);break;}
       det[val][0]=1;
       calc(val);
   }
   int S[n];
   int D[n];
   for(int i=0;i<n;i++){S[i]=matched[i];D[i]=door[i];}
   answer(S,D);
   return;
}
/*
./compile_cpp.sh
*/

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