oj.uz

Submission #344327

# Submission time Handle Problem Language Result Execution time Memory
344327 2021-01-05T13:47:09 Z Atill83 Railway (BOI17_railway) C++14
100 / 100
 187 ms 29040 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m, k;
vector<int> mns[MAXN];
vector<pii> adj[MAXN];
int up[MAXN], down[MAXN], sz[MAXN];
int cur = 0;
vector<int> ans;

void dfs(int v, int par){
    sz[v] = 1;

    for(int i = 0; i < adj[v].size(); i++){
        if(adj[v][i].ff == par){
            swap(adj[v][i], adj[v].back());
            adj[v].pop_back();
            break;
        }
    }

    for(pii j: adj[v]){
        dfs(j.ff, v);
        sz[v] += sz[j.ff];
    }

    for(int i = 1; i < adj[v].size(); i++){
        if(sz[adj[v][i].ff] > sz[adj[v][0].ff])
            swap(adj[v][i], adj[v][0]);
    }

}

void add(int v){
    for(int j: mns[v]){
        if(up[j] == 0)
            cur++;
        up[j]++;
        down[j]--;
        if(down[j] == 0)
            cur--;
    }

    for(pii j: adj[v]){
        add(j.ff);
    }
}

void remove(int v){
    for(int j: mns[v]){
        if(down[j] == 0)
            cur++;
        up[j]--;
        down[j]++;
        if(up[j] == 0)
            cur--;
    }

    for(pii j: adj[v])
        remove(j.ff);
}



void dfs2(int v){
    for(int j: mns[v]){
        if(up[j] == 0)
            cur++;
        up[j]++;
        down[j]--;
        if(down[j] == 0)
            cur--;
    }
    if(adj[v].size() == 0) return;

    for(int j = 1; j < adj[v].size(); j++){
        add(adj[v][j].ff);
    }
    
    if(cur >= k){
        ans.push_back(adj[v][0].ss);
    }
    dfs2(adj[v][0].ff);

    for(int i = 1; i < adj[v].size(); i++){
        remove(adj[v][i].ff);
        if(cur >= k){
            ans.push_back(adj[v][i].ss);
        }
        dfs2(adj[v][i].ff);
    }
}







int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>m>>k;

    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin>>a>>b;
        adj[a].push_back({b, i + 1});
        adj[b].push_back({a, i + 1});
    }

    for(int i = 0; i < m; i++){
        int s;
        cin>>s;
        for(int j = 0; j < s; j++){
            int v;
            cin>>v;
            mns[v].push_back(i);
        }
        down[i] = s;
    }

    dfs(1, -1);
    dfs2(1);
    sort(ans.begin(), ans.end());

    cout<<ans.size()<<endl;
    for(int i: ans)
        cout<<i<<" ";


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i = 0; i < adj[v].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
railway.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 1; i < adj[v].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs2(int)':
railway.cpp:86:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int j = 1; j < adj[v].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~
railway.cpp:95:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for(int i = 1; i < adj[v].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 17 ms 14828 KB Output is correct
3 Correct 14 ms 14828 KB Output is correct
4 Correct 9 ms 14444 KB Output is correct
5 Correct 9 ms 14444 KB Output is correct
6 Correct 13 ms 15340 KB Output is correct
7 Correct 13 ms 15100 KB Output is correct
8 Correct 13 ms 15084 KB Output is correct
9 Correct 13 ms 14956 KB Output is correct
10 Correct 9 ms 14444 KB Output is correct
11 Correct 9 ms 14444 KB Output is correct
12 Correct 9 ms 14444 KB Output is correct
13 Correct 9 ms 14444 KB Output is correct
14 Correct 9 ms 14444 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 17 ms 14828 KB Output is correct
3 Correct 14 ms 14828 KB Output is correct
4 Correct 9 ms 14444 KB Output is correct
5 Correct 9 ms 14444 KB Output is correct
6 Correct 13 ms 15340 KB Output is correct
7 Correct 13 ms 15100 KB Output is correct
8 Correct 13 ms 15084 KB Output is correct
9 Correct 13 ms 14956 KB Output is correct
10 Correct 9 ms 14444 KB Output is correct
11 Correct 9 ms 14444 KB Output is correct
12 Correct 9 ms 14444 KB Output is correct
13 Correct 9 ms 14444 KB Output is correct
14 Correct 9 ms 14444 KB Output is correct
15 Correct 32 ms 15596 KB Output is correct
16 Correct 36 ms 15468 KB Output is correct
17 Correct 29 ms 15596 KB Output is correct
18 Correct 14 ms 15340 KB Output is correct
19 Correct 26 ms 14956 KB Output is correct
20 Correct 34 ms 15852 KB Output is correct
21 Correct 32 ms 15724 KB Output is correct
22 Correct 9 ms 14444 KB Output is correct
23 Correct 14 ms 14828 KB Output is correct
24 Correct 14 ms 14828 KB Output is correct
25 Correct 9 ms 14444 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 14 ms 15340 KB Output is correct
28 Correct 13 ms 14956 KB Output is correct
29 Correct 13 ms 14956 KB Output is correct
30 Correct 13 ms 14956 KB Output is correct
31 Correct 9 ms 14444 KB Output is correct
32 Correct 11 ms 14444 KB Output is correct
33 Correct 9 ms 14476 KB Output is correct
34 Correct 9 ms 14444 KB Output is correct
35 Correct 9 ms 14444 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 29028 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 83 ms 28776 KB Output is correct
4 Correct 76 ms 28140 KB Output is correct
5 Correct 78 ms 28920 KB Output is correct
6 Correct 77 ms 28900 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 23424 KB Output is correct
2 Correct 94 ms 19948 KB Output is correct
3 Correct 131 ms 19692 KB Output is correct
4 Correct 128 ms 19692 KB Output is correct
5 Correct 113 ms 19820 KB Output is correct
6 Correct 78 ms 23660 KB Output is correct
7 Correct 78 ms 23532 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 23424 KB Output is correct
2 Correct 94 ms 19948 KB Output is correct
3 Correct 131 ms 19692 KB Output is correct
4 Correct 128 ms 19692 KB Output is correct
5 Correct 113 ms 19820 KB Output is correct
6 Correct 78 ms 23660 KB Output is correct
7 Correct 78 ms 23532 KB Output is correct
8 Correct 87 ms 24300 KB Output is correct
9 Correct 89 ms 24300 KB Output is correct
10 Correct 75 ms 28772 KB Output is correct
11 Correct 79 ms 28648 KB Output is correct
12 Correct 92 ms 20772 KB Output is correct
13 Correct 83 ms 20716 KB Output is correct
14 Correct 106 ms 19308 KB Output is correct
15 Correct 108 ms 19308 KB Output is correct
16 Correct 113 ms 19692 KB Output is correct
17 Correct 112 ms 19564 KB Output is correct
18 Correct 117 ms 19712 KB Output is correct
19 Correct 113 ms 19924 KB Output is correct
20 Correct 84 ms 23916 KB Output is correct
21 Correct 86 ms 23916 KB Output is correct
22 Correct 73 ms 23788 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 17 ms 14828 KB Output is correct
3 Correct 14 ms 14828 KB Output is correct
4 Correct 9 ms 14444 KB Output is correct
5 Correct 9 ms 14444 KB Output is correct
6 Correct 13 ms 15340 KB Output is correct
7 Correct 13 ms 15100 KB Output is correct
8 Correct 13 ms 15084 KB Output is correct
9 Correct 13 ms 14956 KB Output is correct
10 Correct 9 ms 14444 KB Output is correct
11 Correct 9 ms 14444 KB Output is correct
12 Correct 9 ms 14444 KB Output is correct
13 Correct 9 ms 14444 KB Output is correct
14 Correct 9 ms 14444 KB Output is correct
15 Correct 32 ms 15596 KB Output is correct
16 Correct 36 ms 15468 KB Output is correct
17 Correct 29 ms 15596 KB Output is correct
18 Correct 14 ms 15340 KB Output is correct
19 Correct 26 ms 14956 KB Output is correct
20 Correct 34 ms 15852 KB Output is correct
21 Correct 32 ms 15724 KB Output is correct
22 Correct 9 ms 14444 KB Output is correct
23 Correct 14 ms 14828 KB Output is correct
24 Correct 14 ms 14828 KB Output is correct
25 Correct 9 ms 14444 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 14 ms 15340 KB Output is correct
28 Correct 13 ms 14956 KB Output is correct
29 Correct 13 ms 14956 KB Output is correct
30 Correct 13 ms 14956 KB Output is correct
31 Correct 9 ms 14444 KB Output is correct
32 Correct 11 ms 14444 KB Output is correct
33 Correct 9 ms 14476 KB Output is correct
34 Correct 9 ms 14444 KB Output is correct
35 Correct 9 ms 14444 KB Output is correct
36 Correct 94 ms 29028 KB Output is correct
37 Correct 9 ms 14444 KB Output is correct
38 Correct 83 ms 28776 KB Output is correct
39 Correct 76 ms 28140 KB Output is correct
40 Correct 78 ms 28920 KB Output is correct
41 Correct 77 ms 28900 KB Output is correct
42 Correct 69 ms 23424 KB Output is correct
43 Correct 94 ms 19948 KB Output is correct
44 Correct 131 ms 19692 KB Output is correct
45 Correct 128 ms 19692 KB Output is correct
46 Correct 113 ms 19820 KB Output is correct
47 Correct 78 ms 23660 KB Output is correct
48 Correct 78 ms 23532 KB Output is correct
49 Correct 87 ms 24300 KB Output is correct
50 Correct 89 ms 24300 KB Output is correct
51 Correct 75 ms 28772 KB Output is correct
52 Correct 79 ms 28648 KB Output is correct
53 Correct 92 ms 20772 KB Output is correct
54 Correct 83 ms 20716 KB Output is correct
55 Correct 106 ms 19308 KB Output is correct
56 Correct 108 ms 19308 KB Output is correct
57 Correct 113 ms 19692 KB Output is correct
58 Correct 112 ms 19564 KB Output is correct
59 Correct 117 ms 19712 KB Output is correct
60 Correct 113 ms 19924 KB Output is correct
61 Correct 84 ms 23916 KB Output is correct
62 Correct 86 ms 23916 KB Output is correct
63 Correct 73 ms 23788 KB Output is correct
64 Correct 105 ms 24332 KB Output is correct
65 Correct 187 ms 20972 KB Output is correct
66 Correct 164 ms 20588 KB Output is correct
67 Correct 147 ms 20296 KB Output is correct
68 Correct 82 ms 20204 KB Output is correct
69 Correct 77 ms 20204 KB Output is correct
70 Correct 90 ms 24572 KB Output is correct
71 Correct 85 ms 24172 KB Output is correct
72 Correct 9 ms 14444 KB Output is correct
73 Correct 18 ms 14828 KB Output is correct
74 Correct 14 ms 14828 KB Output is correct
75 Correct 9 ms 14444 KB Output is correct
76 Correct 9 ms 14444 KB Output is correct
77 Correct 14 ms 15340 KB Output is correct
78 Correct 13 ms 14956 KB Output is correct
79 Correct 13 ms 14956 KB Output is correct
80 Correct 14 ms 14956 KB Output is correct
81 Correct 9 ms 14444 KB Output is correct
82 Correct 9 ms 14444 KB Output is correct
83 Correct 11 ms 14444 KB Output is correct
84 Correct 9 ms 14444 KB Output is correct
85 Correct 9 ms 14444 KB Output is correct
86 Correct 28 ms 15468 KB Output is correct
87 Correct 30 ms 15616 KB Output is correct
88 Correct 30 ms 15596 KB Output is correct
89 Correct 14 ms 15360 KB Output is correct
90 Correct 16 ms 14956 KB Output is correct
91 Correct 27 ms 15852 KB Output is correct
92 Correct 27 ms 15724 KB Output is correct
93 Correct 9 ms 14444 KB Output is correct
94 Correct 89 ms 29040 KB Output is correct
95 Correct 101 ms 28776 KB Output is correct
96 Correct 73 ms 28140 KB Output is correct
97 Correct 80 ms 28772 KB Output is correct
98 Correct 94 ms 28900 KB Output is correct
99 Correct 133 ms 19692 KB Output is correct
100 Correct 114 ms 19692 KB Output is correct
101 Correct 125 ms 19564 KB Output is correct
102 Correct 94 ms 20076 KB Output is correct
103 Correct 75 ms 23532 KB Output is correct
104 Correct 77 ms 23792 KB Output is correct
105 Correct 92 ms 23404 KB Output is correct
106 Correct 87 ms 24428 KB Output is correct
107 Correct 89 ms 24252 KB Output is correct
108 Correct 81 ms 28992 KB Output is correct
109 Correct 78 ms 28772 KB Output is correct
110 Correct 90 ms 20844 KB Output is correct
111 Correct 97 ms 20716 KB Output is correct
112 Correct 123 ms 19308 KB Output is correct
113 Correct 114 ms 19308 KB Output is correct