제출 #428485

#제출 시각아이디문제언어결과실행 시간메모리
428485errorgornPark (JOI17_park)C++17
10 / 100
8 ms332 KiB
#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){
	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;
	
}

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);
	}
}
#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...