oj.uz

Submission #889538

# Submission time Handle Problem Language Result Execution time Memory
889538 2023-12-20T00:33:48 Z zeta7532 Railway (BOI17_railway) C++17
23 / 100
 1000 ms 14316 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

vector<ll> bfs(vector<vector<ll>> G){
    ll N=G.size();
    vector<ll> dis(N,-1);
    dis[0]=0;
    queue<ll> que;
    que.push(0);
    while(!que.empty()){
        ll v=que.front();
        que.pop();
        for(ll nv:G[v]){
            if(dis[nv]!=-1) continue;
            dis[nv]=dis[v]+1;
            que.push(nv);
        }
    }
    return dis;
}

int main() {
    ll N,Q,K;
    cin >> N >> Q >> K;
    vector<vector<ll>> G(N);
    vector<ll> A(N-1),B(N-1);
    rep(i,N-1){
        cin >> A[i] >> B[i];
        A[i]--,B[i]--;
        G[A[i]].push_back(B[i]);
        G[B[i]].push_back(A[i]);
    }
    vector<ll> dis=bfs(G);
    vector<ll> par(N,-1);
    vector<ll> Eid(N,-1);
    rep(i,N-1){
        if(dis[A[i]]>dis[B[i]]) par[A[i]]=B[i],Eid[A[i]]=i;
        if(dis[B[i]]>dis[A[i]]) par[B[i]]=A[i],Eid[B[i]]=i;
    }
    vector<ll> ans(N-1,0);
    while(Q--){
        ll x;
        cin >> x;
        vector<ll> t(x);
        vector<ll> cnt(N-1,0);
        rep(i,x) cin >> t[i],t[i]--;
        rep(i,x-1){
            ll u=t[i];
            ll v=t[i+1];
            while(dis[u]>dis[v]){
                cnt[Eid[u]]++;
                u=par[u];
            }
            while(dis[v]>dis[u]){
                cnt[Eid[v]]++;
                v=par[v];
            }
            while(u!=v){
                cnt[Eid[u]]++;
                u=par[u];
                cnt[Eid[v]]++;
                v=par[v];
            }
        }
        rep(i,N-1) if(cnt[i]>0) ans[i]++;
    }
    ll ANS=0;
    rep(i,N-1) if(ans[i]>=K) ANS++;
    cout << ANS << endl;
    rep(i,N-1) if(ans[i]>=K) cout << i+1 << " ";
    cout << endl;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 1876 KB Output is correct
3 Correct 7 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 15 ms 1884 KB Output is correct
7 Correct 7 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct
9 Correct 17 ms 1904 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 1876 KB Output is correct
3 Correct 7 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 15 ms 1884 KB Output is correct
7 Correct 7 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct
9 Correct 17 ms 1904 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 34 ms 1904 KB Output is correct
16 Correct 35 ms 2068 KB Output is correct
17 Correct 37 ms 1904 KB Output is correct
18 Correct 35 ms 1880 KB Output is correct
19 Correct 15 ms 1880 KB Output is correct
20 Correct 30 ms 2324 KB Output is correct
21 Correct 31 ms 2156 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 7 ms 1884 KB Output is correct
24 Correct 8 ms 1972 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 14 ms 1884 KB Output is correct
28 Correct 8 ms 1884 KB Output is correct
29 Correct 12 ms 1984 KB Output is correct
30 Correct 12 ms 1908 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1031 ms 13540 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 14316 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 14316 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 1876 KB Output is correct
3 Correct 7 ms 1884 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 15 ms 1884 KB Output is correct
7 Correct 7 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct
9 Correct 17 ms 1904 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 34 ms 1904 KB Output is correct
16 Correct 35 ms 2068 KB Output is correct
17 Correct 37 ms 1904 KB Output is correct
18 Correct 35 ms 1880 KB Output is correct
19 Correct 15 ms 1880 KB Output is correct
20 Correct 30 ms 2324 KB Output is correct
21 Correct 31 ms 2156 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 7 ms 1884 KB Output is correct
24 Correct 8 ms 1972 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 14 ms 1884 KB Output is correct
28 Correct 8 ms 1884 KB Output is correct
29 Correct 12 ms 1984 KB Output is correct
30 Correct 12 ms 1908 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Execution timed out 1031 ms 13540 KB Time limit exceeded
37 Halted 0 ms 0 KB -