Submission #830440

#	Time	Username	Problem	Language	Result	Execution time	Memory
830440		irmuun	동굴 (IOI13_cave)	C++17	13 / 100	10 ms	504 KiB

cave

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

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

void exploreCave(int n){
    int s[n],d[n];
    fill(s,s+n,0);
    int x=tryCombination(s);
    if(x==-1){//subtask 2
        for(int i=0;i<n;i++){
            s[i]=1;
            x=tryCombination(s);
            d[i]=x;
            s[i]=0;
        }
        answer(s,d);
    }
    if(n<=100){
        fill(s,s+n,0);
        x=tryCombination(s);
        while(x>-1){
            for(int i=0;i<n;i++){
                s[i]=1-s[i];
                int y=tryCombination(s);
                if(y==-1) y=n;
                if(y>x){
                    break;
                }
                s[i]=1-s[i];
            }
        }
        for(int i=0;i<n;i++){
            s[i]=1-s[i];
            x=tryCombination(s);
            d[i]=x;
            s[i]=1-s[i];
        }
        answer(s,d);
    }
    fill(s,s+n,0);
    iota(d,d+n,0);
    x=tryCombination(s);
    while(x>-1){
        s[x]=1-s[x];
        x=tryCombination(s);
    }
    answer(s,d);
}

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