oj.uz

Submission #465558

# Submission time Handle Problem Language Result Execution time Memory
465558 2021-08-16T10:54:32 Z Khizri ICC (CEOI16_icc) C++17
0 / 100
 316 ms 588 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=100+5;
int t=1,arr[mxn][mxn];
bool qq=false;
int ask(int u,int l,int r,vector<int>vt){
	int x[mxn],y[mxn];
	int idx=0;
	for(int i=l;i<=r;i++){
		x[idx]=vt[i];
		idx++;
	}
	y[0]=u;
	int ans=query(1,r-l+1,y,x);
	for(int i=l;i<=r;i++){
		ans-=arr[u][vt[i]];
	}
	return ans;
}
void solve(int a,vector<int>vt){
	int l=0,r=vt.size()-1;
	int q=ask(a,l,r,vt);
	if(q==0){
		return;
	}
	int ans=0;
	while(l<=r){
		int m=(l+r)/2;
		q=ask(a,l,m,vt);
		if(q>0){
			ans=m;
			r=m-1;
		}
		else{
			l=m+1;
		}
	}
	arr[a][vt[ans]]=arr[vt[ans]][a]=1;
	qq=true;
	setRoad(a,vt[ans]);
}
void run(int n){
	for(int k=1;k<n;k++){
		//bool q=true;
		vector<int>vt;
		for(int i=1;i<=n;i++){
			vt.pb(i);
		}
		qq=false;
		for(int i=1;i<n&&!qq;i++){
			vt.erase(vt.begin());
			solve(i,vt);
			if(qq){
				break;
			}
		}
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 460 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 128 ms 492 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 297 ms 504 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 262 ms 588 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 316 ms 504 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 222 ms 500 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -