Submission #784721

#TimeUsernameProblemLanguageResultExecution timeMemory
784721vjudge1Cave (IOI13_cave)C++17
100 / 100
200 ms508 KiB
#include <bits/stdc++.h>
#include "cave.h"
 
using namespace std;
bool visited[5001];
int R[5001], D[5001];
 
void change(int start, int end)
{
    for(int i=start; i<=end; i++)
    {
        if(!visited[i])
        {
            if(R[i]==0)
                R[i]=1;
            else
                R[i]=0;
        }
    }
}
void exploreCave(int N)
{
    int n=N;
    for(int i=0; i<n; i++)
    {
        int x=tryCombination(R);
        int kiki, kiki1;
        if(x>i || x==-1)
            kiki=0;
        else 
            kiki=1;
        int start=0, end=n-1;
        while(start<end)
        {
            int mid=(start+end)/2;
            change(start, mid);
            x=tryCombination(R);
            if(x>i || x==-1)
                kiki1=0;
            else
                kiki1=1;
            change(start, mid);
            if(kiki==kiki1)
                start=mid+1;
            else
                end=mid;
        }
        R[start]=kiki;
        D[start]=i;
        visited[start]=true;
    }
    answer(R, 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...