Submission #1217611

#TimeUsernameProblemLanguageResultExecution timeMemory
1217611LeonidCukCave (IOI13_cave)C++20
100 / 100
444 ms512 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n)
{
    vector<bool>vis(n);
    int res[n],res2[n];
    for(int i=0;i<n;i++)
    {
        res[i]=0;
        res2[i]=0;
    }
    int a,b;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(vis[j]==0)
            {
                res[j]=0;
            }
        }
        a=tryCombination(res);
        if(a==i)b=1;
        else b=0;
        int l=0,r=n-1;
        while(l<r)
        {
            int m=(l+r)/2;
            for(int j=0;j<n;j++)
            {
                if(vis[j])continue;
                if(j<=m)res[j]=b;
                else res[j]=(b+1)%2;
            }
            a=tryCombination(res);
                if(a==i)l=m+1;
                else r=m;
        }
        res[l]=b;
            vis[l]=true;
            res2[l]=i;
    }
    answer(res,res2);
}
#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...