oj.uz

Submission #428515

# Submission time Handle Problem Language Result Execution time Memory
428515 2021-06-15T12:29:10 Z errorgorn Park (JOI17_park) C++17
10 / 100
 49 ms 468 KB 
#include "park.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int t,n;

int Ask(int i,int j,vector<int> v){
	//cout<<"Ask: "<<i<<" "<<j<<" | "; for (auto &it:v) cout<<it<<" "; cout<<endl;
	
	if (i>j) swap(i,j); //the fuck?
	
	int arr[n];
	memset(arr,0,sizeof(arr));
	
	for (auto &it:v) arr[it]=1;
	return Ask(i,j,arr);
}

void rec(vector<int> v){
	//cout<<"debug: "; for (auto &it:v) cout<<it<<" "; cout<<endl;
	
	if (sz(v)==1) return;
	
	int pivot=v.back(); v.pob();
	
	while (sz(v)){
		vector<int> split;
		vector<int> rest;
		
		split.pub(v.back());
		
		for (auto &it:v){
			if (it==split[0]) continue;
			
			if (Ask(split[0],it,v)==1) split.pub(it);
			else rest.pub(it);
		}
		
		//now we need to find how split is connected to pivot
		vector<int> cset=split;
		while (sz(cset)!=1){
			vector<int> l,r;
			rep(x,0,sz(cset)/2) l.pub(cset[x]);
			rep(x,sz(cset)/2,sz(cset)) r.pub(cset[x]);
			
			l.pub(pivot);
			if (Ask(l[0],pivot,l)){
				l.pob();
				cset=l;
			}
			else{
				cset=r;
			}
		}
		
		if (cset[0]<pivot) Answer(cset[0],pivot);
		else Answer(pivot,cset[0]);
		
		rec(split);
		
		v=rest;
	}
}

void Detect(int T, int N) {
	t=T,n=N;
	
	if (t==1){
		rep(x,0,n) rep(y,x+1,n){
			if (Ask(x,y,{x,y})==1) Answer(x,y);
		}
	}
	else{
		vector<int> proc;
		rep(x,0,n) proc.pub(x);
		
		rec(proc);
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 12 ms 324 KB Output is correct
3 Correct 13 ms 332 KB Output is correct
4 Correct 12 ms 324 KB Output is correct
5 Correct 12 ms 328 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 468 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 396 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 388 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 332 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -