oj.uz

답안 #759066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759066 2023-06-15T17:57:15 Z Ronin13 Pastiri (COI20_pastiri) C++14
49 / 100
 1000 ms 76864 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];
int p[nmax];
vector <vector <int> > g(nmax);


vector <int> ans;

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

int main(){
    //ios_base::sync_with_stdio(false); cin.tie(0);
    int n, k;
    scanf("%d%d",&n, &k);
    for(int i = 1; i < n; i++){
        int u, v; scanf("%d%d", &u, &v);
        g[u].pb(v);
        g[v].pb(u);
    }
    //int k; cin >> k;
    for(int i = 1; i <= n; i++){
        x[i] = 1e9;
        d[i] = -1e9;
        dp[i] = -1e9;
    }
    queue <int> q;
    for(int i = 1; i <= k; ++i){
        int y; scanf("%d", &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);
        }
    }
    x[0] = 1e9;
    DFS(1, 0);

    printf("%d\n", ans.size()); //ans.size() << "\n";
    sort(ans.begin(), ans.end());
    for(int to : ans)
        printf("%d ", to);
    return 0;
}

Compilation message

pastiri.cpp: In function 'int main()':
pastiri.cpp:78:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   78 |     printf("%d\n", ans.size()); //ans.size() << "\n";
      |             ~^     ~~~~~~~~~~
      |              |             |
      |              int           std::vector<int>::size_type {aka long unsigned int}
      |             %ld
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:49:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         int u, v; scanf("%d%d", &u, &v);
      |                   ~~~~~^~~~~~~~~~~~~~~~
pastiri.cpp:61:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         int y; scanf("%d", &y);
      |                ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 72648 KB Output is correct
2 Correct 158 ms 73092 KB Output is correct
3 Correct 188 ms 73196 KB Output is correct
4 Correct 210 ms 76864 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 9 ms 12244 KB Output is correct
3 Correct 336 ms 34424 KB Output is correct
4 Correct 378 ms 38152 KB Output is correct
5 Correct 426 ms 33764 KB Output is correct
6 Correct 469 ms 37272 KB Output is correct

Subtask #3
23.0 / 23.0

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

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 35280 KB Output is correct
2 Correct 400 ms 34916 KB Output is correct
3 Correct 417 ms 36556 KB Output is correct
4 Correct 434 ms 34092 KB Output is correct
5 Execution timed out 1082 ms 31284 KB Time limit exceeded
6 Halted 0 ms 0 KB -