oj.uz

답안 #113756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113756 2019-05-28T07:18:04 Z ckodser CEOI16_icc (CEOI16_icc) C++14
100 / 100
 140 ms 636 KB 
#include<bits/stdc++.h>
#include<icc.h>

#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll mod=1e9+7;
const ll maxn=500;
const ll inf=1e9+900;

vector<ll> vec[maxn];
ll par[maxn];

int soal(vector<ll> a,vector<ll> b){
    ll A[maxn];
    ll B[maxn];
    for(ll i=0;i<(ll)a.size();i++){
	A[i]=a[i];
    }
    for(ll i=0;i<b.size();i++){
	B[i]=b[i];
    }
    return query(a.size(),b.size(),A,B);
}
vector<ll> kamel(vector<ll> v){
    vector<ll> ans;
    for(auto e:v){
	for(auto r:vec[e]){
	    ans.pb(r);
	}
    }
    return ans;
}
ll find_sar(vector<ll> a,vector<ll> b){
    while(a.size()>1){
	vector<ll> aa,aaa;
	for(ll i=0;i<(ll)a.size()/2;i++){
	    aa.pb(a[i]);
	}
	for(ll i=(ll)a.size()/2;i<a.size();i++){
	    aaa.pb(a[i]);
	}
	bool bo=soal(aa,b);
	if(bo){
	    a=aa;	    
	}else{
	    a=aaa;
	}
    }
    return a[0];
}
void run(ll n){
    for(ll i=1;i<=n;i++){
	vec[i].pb(i);
	par[i]=i;
    }
    for(ll w=1;w<=n-1;w++){
	vector<ll> imp;
	for(ll i=1;i<=n;i++){
	    if(vec[i].size()){
		imp.pb(i);
	    }
	}
	ll m=imp.size();
	vector<ll> v1,v0;
	for(ll i=0;(1<<i)<m;i++){
	    v0.clear();
	    v1.clear();
	    for(ll j=0;j<m;j++){
		if((j>>i)&1){
		    v1.pb(imp[j]);
		}else{
		    v0.pb(imp[j]);
		}
	    }
	    if((1<<(i+1))>=m){
		break;
	    }
	    int b=soal(kamel(v0),kamel(v1));
	    if(b){
		break;
	    }
	}
	ll s=find_sar(kamel(v0),kamel(v1));
	ll t=find_sar(kamel(v1),kamel(v0));
	setRoad(s,t);
	s=par[s];
	t=par[t];
	for(auto e:vec[s]){
	    vec[t].pb(e);
	    par[e]=t;
	}
	vec[s].clear();
    }   
}

Compilation message

icc.cpp: In function 'int soal(std::vector<int>, std::vector<int>)':
icc.cpp:27:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll i=0;i<b.size();i++){
                ~^~~~~~~~~
icc.cpp: In function 'int find_sar(std::vector<int>, std::vector<int>)':
icc.cpp:47:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ll i=(ll)a.size()/2;i<a.size();i++){
                          ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 512 KB Ok! 93 queries used.
2 Correct 7 ms 512 KB Ok! 100 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 512 KB Ok! 540 queries used.
2 Correct 46 ms 632 KB Ok! 640 queries used.
3 Correct 42 ms 568 KB Ok! 648 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 636 KB Ok! 1451 queries used.
2 Correct 132 ms 632 KB Ok! 1605 queries used.
3 Correct 138 ms 512 KB Ok! 1573 queries used.
4 Correct 126 ms 632 KB Ok! 1514 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 632 KB Ok! 1544 queries used.
2 Correct 122 ms 512 KB Ok! 1477 queries used.
3 Correct 134 ms 512 KB Ok! 1535 queries used.
4 Correct 127 ms 512 KB Ok! 1531 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 512 KB Ok! 1536 queries used.
2 Correct 133 ms 632 KB Ok! 1535 queries used.
3 Correct 131 ms 584 KB Ok! 1535 queries used.
4 Correct 133 ms 572 KB Ok! 1592 queries used.
5 Correct 122 ms 512 KB Ok! 1493 queries used.
6 Correct 131 ms 512 KB Ok! 1561 queries used.

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 632 KB Ok! 1535 queries used.
2 Correct 140 ms 576 KB Ok! 1605 queries used.