oj.uz

답안 #651031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651031 2022-10-16T14:09:38 Z kym Pastiri (COI20_pastiri) C++14
0 / 100
 494 ms 44068 KB 
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 	
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 500005;
int n,k;
vector<int> V[MAXN];
int dist[MAXN];
int32_t main() 
{
	IAMSPEED
	cin >> n >> k;
	queue<int> q;
	vector<int> sheep;
	FOR(i,1,n-1) {
		int a,b; cin >> a >> b;
		V[a].pb(b);
		V[b].pb(a);
	}
	FOR(i,1,k) {
		int x; cin >> x;
		sheep.pb(x);
	}
	FOR(i,0,MAXN-1)dist[i]=oo;
	for(auto i:sheep){
		q.push(i);
		dist[i]=0;
	}
	map<int,vector<int>> mp;
	int pre=0;
	vector<int> out;
	vector<int> push;
	int curdist=0;
	//if(q.empty())break;
	while(q.size()) {
		int x=q.front(); q.pop();
		bool extend=0;
		for(auto v:V[x]) {
			if(dist[v]==oo||dist[v]==dist[x]+1){
				extend=1;
			}
			if(dist[v]==oo){
				dist[v]=dist[x]+1;
				q.push(v);
			}
			
		}
		//push.pb(x);
		if(!extend)out.pb(x);
		
	}
	
	/*
	for(auto i:push) {
		for(auto v:V[i]) {
			if(dist[v]==oo)dist[v]=dist[i]+1;
			q.push(v);
		}
	} */
	cout << out.size() << '\n';
	for(auto i:out)cout<<i<<' ';
}

Compilation message

pastiri.cpp: In function 'int32_t main()':
pastiri.cpp:68:6: warning: unused variable 'pre' [-Wunused-variable]
   68 |  int pre=0;
      |      ^~~
pastiri.cpp:71:6: warning: unused variable 'curdist' [-Wunused-variable]
   71 |  int curdist=0;
      |      ^~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 51.0

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