Submission #230871

#	Time	Username	Problem	Language	Result	Execution time	Memory
230871		AASG	Cave (IOI13_cave)	C++17	0 / 100	156 ms	504 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int n=N;
    int R[n];int P[n];
    int aux1[n],aux2[n];
    for(int i=0;i<n;i++){
        R[i]=1;
        P[i]=0;
    }
    for(int i=0;i<n;i++){
        for(int i=0;i<n;i++)aux2[i]=R[i];
        int p1=0,p2=n;
        int x=tryCombination(aux2);
        while(abs(p1-p2)!=1){
            int p3=(p1+p2)/2;
            for(int i=0;i<p3;i++){
                if(P[i]==0){
                    aux2[i]=0;
                }
            }
            int y=tryCombination(aux2);
            if(x>i && y>i){
                p1=p3;
            }else{
            p2=p3-1;
            }
        }
        if(aux2[p2]==1){aux2[p2]=0;}
        else aux2[p2]=1;
        if(tryCombination(aux2)<n+1){
            if(aux2[p2]==1){aux2[p2]=0;}
            else aux2[p2]=1;
            R[p2]=aux2[p2];
            P[p2]=n+1;
        }else{
        R[p1]=aux2[p1];
        P[p1]=n+1;
        }
    }
    answer(R,P);
}

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:7:9: warning: unused variable 'aux1' [-Wunused-variable]
     int aux1[n],aux2[n];
         ^~~~

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