Submission #413890

#	Time	Username	Problem	Language	Result	Execution time	Memory
413890		LouayFarah	Cave (IOI13_cave)	C++14	46 / 100	37 ms	420 KiB

cave

#include "bits/stdc++.h"
#include "cave.h"
using namespace std;
 
int tryCombination(int S[]);
void answer(int S[], int D[]);

vector<bool> visited, opened;
 
void exploreCave(int N)
{
    int S[N];
    int D[N];
    visited.assign(N, false);
    opened.assign(N, false);
    
    for(int i = 0; i<N; i++)
    {
        S[i] = 0;
        D[i] = i;
    }
 
    int res = 0;
    int door = 0;
    while(door<N)
    {
        res = tryCombination(S);
        
        if(res==-1)
        {
            for(int i = 0; i<N; i++)
            {
                S[i] = 1 - S[i];
                int d = tryCombination(S);
                S[i] = 1 - S[i];
                D[i] = d;
            }
            answer(S, D);
        }
        
        for(int i = 0; i<N; i++)
        {
            if(!visited[i])
            {
                S[i] = 1 - S[i];
                int curr = tryCombination(S);
                S[i] = 1 - S[i];
                if(curr==-1)
                {
                    S[i] = 1 - S[i];
                    break;
                }
                if(curr<res&&(!opened[curr]))
                {
                    D[i] = curr;
                    visited[i] = true;
                    opened[curr] = true;
                }
                else if(curr>res)
                {
                    D[i] = res;
                    S[i] = 1 - S[i];
                    visited[i] = true;
                    opened[res] = true;
                    break;
                }
            }
        }
        
        door++;
    }
    
    answer(S, D);
}

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