Submission #64998

#TimeUsernameProblemLanguageResultExecution timeMemory
64998theknife2001Cave (IOI13_cave)C++17
33 / 100
162 ms640 KiB

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

using namespace std;
const int NN=5e3+55;
int a[NN];
int p[NN];
int d[NN];

void exploreCave(int n)
{
    memset(d,-1,sizeof d);
    memset(p, 0,sizeof p);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
            a[j]=p[j];
        int x;
        int q=tryCombination(a);
        if(q==-1)
            q=n;
//        cout<<q<<endl;
        for(int j=0;j<n;j++)
        {
            if(d[j]!=-1)
                continue ;
            a[j]=1;
            x=tryCombination(a);
            if(x==-1)
                x=n;
//            cout<<x<<' ';
            if(q>i&&x==i)
            {
               d[j]=i;
               p[j]=0;
               break;
            }
            if(q==i&&x>i)
            {
                d[j]=i;
                p[j]=1;
                break;
            }
            a[j]=0;
        }
//        cout<<endl;
//        for(int j=0;j<n;j++)
//            cout<<p[j]<<' ';
//        cout<<endl;
    }
    answer(p,d);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...