Submission #1160214

#TimeUsernameProblemLanguageResultExecution timeMemory
1160214WH8popa (BOI18_popa)C++20
0 / 100
3 ms420 KiB
#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
//~ int query(int a,int b,int c,int d);
//~ int query(int a,int b,int c,int d){
	//~ printf("%d %d %d %d\n",a,b,c,d);
	//~ int ret;cin>>ret;
	//~ return ret;
//~ }

int solve(int n, int * lft, int * rgt){
	int p=0;
	for(int i=0;i<n;i++)lft[i]=rgt[i]=-1;
	for(int i=0;i<n-1;){
		int j=i+1;
		bool done=false;
		for(;j<n;j++){
			int ret=query(i,i,i, j);
			if(ret==0){
				for(int k=i;k<j-1;k++){
					rgt[k]=k+1;
				}
				done=true;
				break;
			}
		}
		if(!done){
			p=i;
			for(int k=i;k<n-1;k++){
				rgt[k]=k+1;
			}
			break;
		}
		else{
			lft[j]=i;
		}			
		i=j;
	}
	return p;
}

//~ int main(){
	//~ int n=6;
	//~ int l[n],r[n]; fill(l,l+n,-1);fill(r,r+n,-1);
	//~ int root=solve(n, l, r);
	//~ for(int i=0;i<n;i++){
		//~ cout<<l[i]<<" "<<r[i]<<endl;
	//~ }
	//~ cout<<root<<endl;
//~ }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...