Submission #1310801

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310801		nataliaa	동굴 (IOI13_cave)	C++20	0 / 100	70 ms	508 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int v[N]={};
    int a[N] ={};
    int vis[N]={};
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < N; j++) {
            if(vis[j]==0) a[j] = 0;
        }
        int k = tryCombination(a);
        int ind = 1;
        if(k!=i) ind = 0;
        for(int j = 0; j <N; j++) {
            if(vis[j]==0) a[i] = 1-ind;
        }
        int ok = 0;
        int l = 0, r =N-1;
        while(l<r){
            int m = (l+r)/2;
            for(int j =l; j<= m; j++) {
                if(vis[j]==0) a[j] = ind;
            }
            k = tryCombination(a);
            if(k!=i) {r=m; ok = r;}
            else {l = m+1; ok = l;}
            for(int j = l; j <= m; j++) {
                if(vis[j]==0) a[j] = 1-ind;
            }
            a[ok] = ind;
            v[ok] = i;
            vis[ok] = 1;
        }
    }
     answer( a,v);
}

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