Submission #1298456

#TimeUsernameProblemLanguageResultExecution timeMemory
1298456scalifrastico_098Cave (IOI13_cave)C++20
0 / 100
324 ms512 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
    int a[n], b[n], c[n];
    for(int i=0; i<n; i++){a[i]=0; b[i]=-1; c[i]=0;} int s=0;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {    
            if(c[i]==0)a[i]=0;
        }
        int l=0, r=n-1, s=-1; bool p=0, p1=0;
        int u=tryCombination(a);if(u!=i)p=1; p1=p;
        while(l<r)
        {
            int m=(l+r)/2; 
            for(int j=0; j<n; j++){if(c[j]==0)a[j]=0;}
            for(int j=l; j<=m; j++)
            {
                if(c[j]==0){a[j]^=1;}
            }
            int v=tryCombination(a); if(v!=1)p1=1; else p1=0;
            if(p!=p1)r=m; else l=m+1;
        }  
        b[l]=i; if(!p1){a[i]^=1;} c[l]=1;
    } 
    answer(a, b);
}
#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...