Submission #413872

#	Time	Username	Problem	Language	Result	Execution time	Memory
413872		LouayFarah	Cave (IOI13_cave)	C++14	13 / 100	15 ms	416 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;

void exploreCave(int N)
{
    int S[N];
    int D[N];
    visited.assign(N, false);
    for(int i = 0; i<N; i++)
    {
        S[i] = 0;
        D[i] = i;
    }
 
    int res = tryCombination(S);
    for(int door = 0; door<N; door++)
    {
        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);
        }
        if(res==door)
        {
            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!=door)
                    {
                        D[i] = door;
                        S[i] = 1 - S[i];
                        visited[i] = true;
                        res = curr;
                        break;
                    }
                }
            }
        }
        else
        {
            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<=door)
                    {
                        D[i] = door;
                        visited[i] = true;
                    }
                    /*if(curr==door)
                    {
                        D[i] = door;
                        visited[i] = true;
                        break;
                    }*/
                }
            }
        }
    }
    answer(S, D);
}

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