Submission #107095

#TimeUsernameProblemLanguageResultExecution timeMemory
107095thebesPark (JOI17_park)C++14
20 / 100
143 ms636 KiB
#include <bits/stdc++.h>
#include "park.h"
using namespace std;

int *arr;
bool cmp(int i,int j){
    int heh;
    arr[i]=0;
    if(Ask(0,j,arr)) heh = 0;
    else heh = 1;
    arr[i]=1;
    return heh;
}
void Detect(int T, int N){
    if(T==1){
        arr = (int*)malloc(N*sizeof(int));
        for(int i=0;i<N;i++){
            for(int j=i+1;j<N;j++){
                arr[i]=arr[j]=1;
                if(Ask(i,j,arr)) Answer(i,j);
                arr[i]=arr[j]=0;
            }
        }
    }
    else if(T==2){
        arr = (int*)malloc(N*sizeof(int));
        for(int i=0;i<N;i++) arr[i]=1;
        int lol[2000];
        for(int i=1;i<N-1;i++) lol[i-1]=i;
        sort(lol,lol+N-2,cmp);
        Answer(0,lol[0]);
        for(int i=0;i<N-3;i++) Answer(min(lol[i],lol[i+1]),max(lol[i],lol[i+1]));
        Answer(lol[N-3],N-1);
    }
}
#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...