oj.uz

답안 #447132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447132 2021-07-24T16:33:12 Z MOUF_MAHMALAT Pastiri (COI20_pastiri) C++11
49 / 100
 1000 ms 65256 KB 
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
using namespace std;
typedef int ll;
typedef pair<ll,ll>pll;
ll n,x,y,k,d[500009],a[500009],h[500009],c;
pll op[500009];
vector<vector<ll> >v;
queue<pll>q;
vector<ll>ans;
bool b[500009];
void dfs(ll u,ll p)
{
    h[u]=h[p]+1;
    for(auto z:v[u])
        if(z!=p)
            dfs(z,u);
}
bool cmp(ll xo,ll yo)
{
    return h[xo]>h[yo];
}
struct node
{
    ll f,s,t;
};
queue<node>dq;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    scanf("%d%d",&n,&k);
    v.resize(n+1);
    for(ll i=1; i<n; i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(ll i=1; i<=n; i++)
        d[i]=1e9,op[i]= {1e9,1e9};
    for(ll i=1; i<=k; i++)
        scanf("%d",&a[i]),d[a[i]]=0,q.push({a[i],a[i]});
    dfs(1,0);
    while(!q.empty())
    {
        x=q.front().first;
        y=q.front().second;
        q.pop();
        op[y]=min(op[y], {h[x],x});
        for(auto z:v[x])
        {
            if(d[z]<d[x]+1)
                continue;
            d[z]=d[x]+1;
            q.push({z,y});
        }
    }
    sort(a+1,a+k+1,cmp);
    for(ll i=1; i<=k; i++)
    {
        if(b[a[i]])
            continue;
        ans.push_back(op[a[i]].second);
        dq.push({op[a[i]].second,h[a[i]]-op[a[i]].first,0});
        while(!dq.empty())
        {
            x=dq.front().f;
            c=dq.front().s;
            ll p=dq.front().t;
            dq.pop();
            b[x]=1;
            if(c==0)
                continue;
            for(auto z:v[x])
                if(z!=p)
                    dq.push({z,c-1,x});
        }
    }
    cout<<ans.size()<<endl;
    for(auto z:ans)
        cout<<z<<" ";
    return 0;
}

Compilation message

pastiri.cpp: In function 'int main()':
pastiri.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
pastiri.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~
pastiri.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%d",&a[i]),d[a[i]]=0,q.push({a[i],a[i]});
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 59024 KB Output is correct
2 Correct 249 ms 59460 KB Output is correct
3 Correct 246 ms 59436 KB Output is correct
4 Correct 414 ms 65256 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 524 ms 37608 KB Output is correct
4 Correct 599 ms 42748 KB Output is correct
5 Correct 621 ms 36296 KB Output is correct
6 Correct 911 ms 38328 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 4 ms 844 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 13 ms 2164 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 578 ms 37076 KB Output is correct
2 Correct 563 ms 37232 KB Output is correct
3 Correct 658 ms 40468 KB Output is correct
4 Correct 587 ms 36128 KB Output is correct
5 Execution timed out 1097 ms 32276 KB Time limit exceeded
6 Halted 0 ms 0 KB -