oj.uz

Submission #447140

# Submission time Handle Problem Language Result Execution time Memory
447140 2021-07-24T17:43:58 Z MOUF_MAHMALAT Pastiri (COI20_pastiri) C++14
31 / 100
 1000 ms 80988 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;
void go(ll u,ll p,ll id)
{
    if(d[u]==0)
    op[u]={h[id],id};
    for(auto z:v[u])
    {
        if(z==p)
            continue;
        if(d[u]==d[z]+1)
            go(z,u,id);
        else
            go(z,u,z);
    }
}
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();
        for(auto z:v[x])
        {
            if(d[z]<=d[x]+1)
                continue;
            d[z]=d[x]+1;
            q.push({z,y});
        }
    }
    go(1,0,1);
    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:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
pastiri.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~
pastiri.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%d",&a[i]),d[a[i]]=0,q.push({a[i],a[i]});
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 74708 KB Output is correct
2 Correct 271 ms 75184 KB Output is correct
3 Correct 274 ms 75372 KB Output is correct
4 Correct 387 ms 80988 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 522 ms 37172 KB Output is correct
4 Correct 543 ms 39652 KB Output is correct
5 Correct 732 ms 36164 KB Output is correct
6 Execution timed out 1022 ms 39948 KB Time limit exceeded

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 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 2 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 3 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 8 ms 528 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 37352 KB Output is correct
2 Correct 632 ms 37348 KB Output is correct
3 Correct 668 ms 40244 KB Output is correct
4 Correct 684 ms 36324 KB Output is correct
5 Correct 545 ms 32808 KB Output is correct
6 Correct 686 ms 53208 KB Output is correct
7 Correct 807 ms 50712 KB Output is correct
8 Correct 767 ms 50096 KB Output is correct
9 Execution timed out 1098 ms 42740 KB Time limit exceeded
10 Halted 0 ms 0 KB -