oj.uz

Submission #877231

# Submission time Handle Problem Language Result Execution time Memory
877231 2023-11-23T04:10:02 Z CDuong Pastiri (COI20_pastiri) C++17
49 / 100
 1000 ms 63420 KB 
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname "SHEEP"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 5e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

int n, k;
int dis[mxN], par[mxN], dep[mxN];
bool vis[mxN], visbfs[mxN];
vector<int> G[mxN], res, cand;

void dfs(int v, int p) {
    par[v] = p;
    dep[v] = dep[p] + 1;

    for (int u : G[v]) {
        if (u == p) continue;
        dfs(u, v);
    }
}

void bfs(int v, int len) {
    vector<int> reset;
    queue<pair<int, int>> q;
    q.emplace(v, 0); visbfs[v] = true;
    while (not q.empty()) {
        int v = q.front().ff, cdis = q.front().ss; q.pop();
        reset.emplace_back(v);
        if (cdis < len) {
            for (int u : G[v]) if (!visbfs[u]) {
                q.emplace(u, cdis + 1);
                visbfs[u] = true;
            }
        }
        else {
            vis[v] = false;
        }
    }
    for (int v : reset) visbfs[v] = false;
}

void solve() {
    cin >> n >> k;
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    fill(dis + 1, dis + n + 1, -1);
    queue<int> q;
    for (int i = 1; i <= k; ++i) {
        int v; cin >> v;
        vis[v] = true;
        q.emplace(v); dis[v] = 0;
        cand.emplace_back(v);
    }
    while (not q.empty()) {
        int v = q.front(); q.pop();
        for (int u : G[v]) {
            if (dis[u] == -1) {
                dis[u] = dis[v] + 1;
                q.emplace(u);
            }
        }
    }

    dfs(1, 0);

    sort(all(cand), [&](int x, int y) {
        return dep[x] > dep[y];
    });
    for (int v : cand) if (vis[v]) {
        // cout << v << endl;
        int cur = 0;
        while (v != 1 && dis[par[v]] == cur + 1) {
            ++cur, v = par[v];
        }
        // cout << "chosen: " << v << " " << endl;
        res.emplace_back(v);
        bfs(v, dis[v]);
    }
    cout << isz(res) << "\n";
    for (int v : res) cout << v << " ";
    cout << "\n";
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 58440 KB Output is correct
2 Correct 176 ms 58092 KB Output is correct
3 Correct 153 ms 58420 KB Output is correct
4 Correct 226 ms 63420 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 6 ms 15196 KB Output is correct
3 Correct 369 ms 36004 KB Output is correct
4 Correct 335 ms 38400 KB Output is correct
5 Correct 432 ms 35636 KB Output is correct
6 Correct 812 ms 44784 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 4 ms 14952 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 7 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 15056 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 35520 KB Output is correct
2 Correct 410 ms 39508 KB Output is correct
3 Correct 376 ms 42320 KB Output is correct
4 Correct 389 ms 38484 KB Output is correct
5 Correct 302 ms 38088 KB Output is correct
6 Correct 390 ms 45760 KB Output is correct
7 Correct 463 ms 44228 KB Output is correct
8 Correct 476 ms 43624 KB Output is correct
9 Execution timed out 1045 ms 42412 KB Time limit exceeded
10 Halted 0 ms 0 KB -