oj.uz

답안 #759052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759052 2023-06-15T17:36:09 Z Ronin13 Pastiri (COI20_pastiri) C++14
49 / 100
 1000 ms 85524 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int nmax = 500001;

int x[nmax], d[nmax];
bool active[nmax];
int dp[nmax];
vector <vector <int> > g(nmax);

void dfs(int v, int e = -1){
    for(int to : g[v]){
        if(to == e) continue;
        dfs(to, v);
        d[v] = min(d[v], d[to] + 1);
    }
}

vector <int> ans;

void DFS(int v, int e = -1){
    for(int to : g[v]){
        if(to == e) continue;
        DFS(to, v);
        active[v] |= active[to];
        dp[v] = max(dp[v], dp[to] - 1);
    }
    if(v == 1 && active[v]){
        if(dp[v] >= d[v]) return;
        ans.pb(v);
        dp[v] = -1;
        return;
    }
    if(!active[v])
        return;
    if(x[e] == d[v] + 1){
        if(dp[v] >= d[v]) active[v] = false;
        return;
    }
    active[v] = false;
    if(dp[v] >= d[v])
        return;
    dp[v] = d[v];
    ans.pb(v);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int k; cin >> k;
    for(int i = 1; i < n; i++){
        int u, v; cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    //int k; cin >> k;
    for(int i = 1; i <= n; i++){
        x[i] = d[i] = 1e9;
        dp[i] = -1e9;
    }
    queue <int> q;
    for(int i = 1; i <= k; ++i){
        int y; cin >> y;
        q.push(y);
        active[y] = true;
        x[y] = d[y] = 0;
    }
    while(!q.empty()){
        int v = q.front();
        q.pop();
        for(int to : g[v]){
            if(x[to] <= x[v]) continue;
            x[to] = x[v] + 1;
            q.push(to);
        }
    }
    dfs(1);
    DFS(1);
    cout << ans.size() << "\n";
    sort(ans.begin(), ans.end());
    for(int to : ans)
        cout << to << ' ';
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 73420 KB Output is correct
2 Correct 168 ms 73288 KB Output is correct
3 Correct 165 ms 79820 KB Output is correct
4 Correct 212 ms 85524 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12372 KB Output is correct
2 Correct 7 ms 12340 KB Output is correct
3 Correct 372 ms 41492 KB Output is correct
4 Correct 382 ms 44868 KB Output is correct
5 Correct 502 ms 40780 KB Output is correct
6 Correct 520 ms 44208 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 7 ms 12144 KB Output is correct
3 Correct 8 ms 12224 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 6 ms 12228 KB Output is correct
7 Correct 7 ms 12096 KB Output is correct
8 Correct 6 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 7 ms 12348 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 10 ms 12980 KB Output is correct
14 Correct 6 ms 12244 KB Output is correct
15 Correct 7 ms 12180 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 473 ms 35388 KB Output is correct
2 Correct 436 ms 41728 KB Output is correct
3 Correct 459 ms 44472 KB Output is correct
4 Correct 459 ms 40708 KB Output is correct
5 Execution timed out 1071 ms 37836 KB Time limit exceeded
6 Halted 0 ms 0 KB -