oj.uz

Submission #638067

# Submission time Handle Problem Language Result Execution time Memory
638067 2022-09-04T14:36:35 Z ojoConmigo Railway (BOI17_railway) C++17
23 / 100
 1000 ms 15140 KB 
#include <bits/stdc++.h>
using namespace std;

vector<vector<pair<int,int>>> g;
vector<int> ask;

bool dfs(int nodo, int p, set<int> & vecindarios){
    bool b = false;
    if(vecindarios.find(nodo) != vecindarios.end()){
        b = true;
        vecindarios.erase(nodo);
        if(vecindarios.empty()) return true;
    }
    for(auto pareja : g[nodo]){
        int v = pareja.first;
        if(v == p)continue;
        int ind = pareja.second;
        if(dfs(v,nodo,vecindarios)){
            b = true;
            ask[ind]++;
        }
    }
    return b;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n,m,k;
    cin >> n >> m >> k;
    //vector<pair<int,int>> tracks(n-1);
    g.resize(n);
    for(int i=0; i<n-1; i++){
        int a,b;
        cin >> a >> b;
        a--;b--;
        //tracks[i] = {a,b};
        g[a].emplace_back(b,i);
        g[b].emplace_back(a,i);
    }
    
    ask.assign(n-1,0);
    for(int i=0; i<m; i++){
        int len;
        cin >> len;
        set<int> vecindarios;
        int x;
        for(int j=0; j<len; j++){
            cin >> x;
            x--;
            vecindarios.insert(x);
        }
        //dfs
        vecindarios.erase(x);
        dfs(x,-1,vecindarios);
    }
    
    vector<int> ans;
    for(int i=0; i<n-1; i++){
        if(ask[i] < k)continue;
        ans.push_back(i);
    }
    cout << ans.size() << endl;
    for(int x : ans){
        cout << x+1 << " ";
    }
    cout << endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 46 ms 1064 KB Output is correct
3 Correct 48 ms 980 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 59 ms 1460 KB Output is correct
7 Correct 32 ms 1108 KB Output is correct
8 Correct 65 ms 972 KB Output is correct
9 Correct 60 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 46 ms 1064 KB Output is correct
3 Correct 48 ms 980 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 59 ms 1460 KB Output is correct
7 Correct 32 ms 1108 KB Output is correct
8 Correct 65 ms 972 KB Output is correct
9 Correct 60 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 414 ms 1556 KB Output is correct
16 Correct 436 ms 1436 KB Output is correct
17 Correct 440 ms 1444 KB Output is correct
18 Correct 174 ms 1484 KB Output is correct
19 Correct 160 ms 1148 KB Output is correct
20 Correct 110 ms 1612 KB Output is correct
21 Correct 139 ms 1500 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 56 ms 1072 KB Output is correct
24 Correct 47 ms 1100 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 55 ms 1460 KB Output is correct
28 Correct 26 ms 1204 KB Output is correct
29 Correct 54 ms 980 KB Output is correct
30 Correct 63 ms 1108 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 15140 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 1082 ms 11852 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 1082 ms 11852 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 212 KB Output is correct
2 Correct 46 ms 1064 KB Output is correct
3 Correct 48 ms 980 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 59 ms 1460 KB Output is correct
7 Correct 32 ms 1108 KB Output is correct
8 Correct 65 ms 972 KB Output is correct
9 Correct 60 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 414 ms 1556 KB Output is correct
16 Correct 436 ms 1436 KB Output is correct
17 Correct 440 ms 1444 KB Output is correct
18 Correct 174 ms 1484 KB Output is correct
19 Correct 160 ms 1148 KB Output is correct
20 Correct 110 ms 1612 KB Output is correct
21 Correct 139 ms 1500 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 56 ms 1072 KB Output is correct
24 Correct 47 ms 1100 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 55 ms 1460 KB Output is correct
28 Correct 26 ms 1204 KB Output is correct
29 Correct 54 ms 980 KB Output is correct
30 Correct 63 ms 1108 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Execution timed out 1078 ms 15140 KB Time limit exceeded
37 Halted 0 ms 0 KB -