Submission #991056

#	Time	Username	Problem	Language	Result	Execution time	Memory
991056		Muhammet	동굴 (IOI13_cave)	C++17	0 / 100	397 ms	548 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int n) {
    int s[n], a[n], b[n], vis[n];
    for(int i = 0; i < n; i++) vis[i] = a[i] = b[i] = 0;
    for(int i = 0; i < n; i++){
        bool tr1 = 0;
        int l = 0, r = n-1;
        int x = tryCombination(a);
        while(l < r){
            int md = (l + r) / 2;
            for(int j = 0; j < n; j++){
                if(vis[j] == 0){
                    if(j >= l and j <= md) s[j] = 1;
                    else s[j] = 0;
                }
                else {
                    s[j] = a[j];
                }
            }
            int y = tryCombination(s);
            bool tr = 0;
            if(x == i){
                tr1 = 1;
                if(y != i){
                    tr = 1;
                }
            }
            else {
                if(y == i){
                    tr = 1;
                }
            }
             if(tr == 1){
                r = md;
            }
            else {
                l = md+1;
            }
        }
        vis[l] = 1;
        a[l] = tr1;
        b[i] = l;
    }

    answer(a, b);

    return;
}

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