Submission #981135

#	Time	Username	Problem	Language	Result	Execution time	Memory
981135		aaaaaarroz	Cave (IOI13_cave)	C++17	100 / 100	547 ms	912 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
     
using namespace std;
     
typedef vector<int> vi;
     
int tryCombination(int S[]);   
void answer(int S[],int D[]);
     
void exploreCave(int N) {
    int s[N],d[N];
    int a[N];int ans[N];
    int pos=0;int p=0;int g;
    while(pos<N){
        for(int i=0;i<N;i++)a[i]=0;
        for(int i=0;i<pos;i++)a[d[i]]=s[d[i]];
        p=tryCombination(a);
        if(p==pos)g=1;
        else g=0;
        int l=0;int r=N-1;
        while(N){
            int k=(l+r)/2;
            if(g==0){
                for(int i=0;i<N;i++)a[i]=1;
                for(int i=0;i<k+1;i++)a[i]=0;
            }
            else{
                for(int i=0;i<N;i++)a[i]=0;
                for(int i=0;i<k+1;i++)a[i]=1;
            }
            for(int i=0;i<pos;i++)a[d[i]]=s[d[i]];
            p=tryCombination(a);
            if(p==pos)l=k+1;
            else r=k;
            if(l==r)break;
        }
        d[pos]=l;
        s[d[pos]]=g;
        pos++;
    }
    for(int i=0;i<N;i++)ans[d[i]]=i;
    answer(s,ans);
}

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