oj.uz

답안 #1003906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003906 2024-06-20T19:47:34 Z vjudge1 Pastiri (COI20_pastiri) C++17
0 / 100
 254 ms 78676 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

const int MAXN = 5e5+10;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);

struct segTree{
	vector<int> tree;
	int N;
	
	void init(int n){
		N=n;
		tree.resize(4*N, INF);
	}
	
	void update(int node, int l, int r, int p, int val){
		if(r<p || l>p) return;
		if(l==r){
			tree[node]=val;
			return;
		}
		
		int mid=(l+r)>>1;
		
		update(node*2, l, mid, p, val);
		update(node*2+1, mid+1, r, p, val);
		
		tree[node]=min(tree[node*2], tree[node*2+1]);
	}
	
	int query(int node, int l, int r, int p, int q){
		if(r<p || l>q) return INF;
		if(l>=p && r<=q) return tree[node];
		int mid=(l+r)>>1;
		return min(query(node*2, l, mid, p, q), query(node*2+1, mid+1, r, p, q));
	}
	
	void upd(int p, int val){ update(1, 1, N, p, val); }
	int getMin(int l, int r){ return query(1, 1, N, l, r); }
};
		

vector<int> adj[MAXN];
int prof[MAXN], dist[MAXN], elim[MAXN], pai[MAXN], tin[MAXN], tout[MAXN];

void build(int ver, int& t, int prev=0){
	prof[ver]=prof[prev]+1;
	pai[ver]=prev;
	tin[ver]=t;
	
	for(auto u : adj[ver]){
		if(u==prev) continue;
		t++;
		build(u, t, ver);
	}
	
	tout[ver]=t;
}

void dfs(int ver, int val, int lim){
	elim[ver]=1;
	if(val==lim) return;
	
	for(auto u : adj[ver]){
		if(u==pai[ver] || elim[u]) continue;
		dfs(u, val+1, lim);
	}
}

void solve(){
	int n, k; cin >> n >> k;
	
	for(int i=0;i<n-1;i++){
		int a, b; cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	
	for(int i=1;i<=n;i++)
		dist[i]=-1;
	
	vector<int> spec(k);
	queue<int> q;
	for(int i=0;i<k;i++){
		cin >> spec[i];
		q.push(spec[i]);
		dist[spec[i]]=0;
	}
	
	while(!q.empty()){
		int curr=q.front();
		q.pop();
		
		for(auto u : adj[curr]){
			if(dist[u]==-1){
				dist[u]=dist[curr]+1;
				q.push(u);
			}
		}
	}
	
	int temp=1;
	build(1, temp);
	sort(all(spec), [&](int a, int b){ return prof[a]>prof[b]; });
	
	segTree arvore;
	arvore.init(n);
	
	vector<int> ans;
	for(auto u : spec){
		if(elim[u]) continue;
		
		int at=u, d=0;
		while(pai[at]!=0 && dist[pai[at]]==d+1){
			d++;
			at=pai[at];
		}
		
		int aux=arvore.getMin(tin[at], tout[at]);
		if(prof[at]-aux>=d){
			dfs(at, 0, prof[at]-aux);
			continue;
		}
		
		ans.pb(at);
		arvore.upd(tin[at], prof[at]-d);
		dfs(at, 0, d);
	}
	
	cout << (int)ans.size() << "\n";
	for(int i=0;i<(int)ans.size();i++) cout << ans[i] << " \n"[i==(int)ans.size()-1];
}

int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	int tt=1;
	//~ cin >> tt;
	while(tt--) solve();
	return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 78672 KB Output is correct
2 Incorrect 127 ms 78676 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 19816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 19804 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 254 ms 48464 KB Output isn't correct
2 Halted 0 ms 0 KB -