oj.uz

Submission #210483

# Submission time Handle Problem Language Result Execution time Memory
210483 2020-03-17T14:03:39 Z bash Railway (BOI17_railway) C++17
100 / 100
 164 ms 46964 KB 
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}

int deg[MAXN];
int up[MAXN][22];
int cnt[MAXN];
int timer = 0;
int u[MAXN];
int v[MAXN];
int tin[MAXN];
vector<int> g[MAXN];

void dfs(int v, int par = 0) {
	deg[v] = deg[par] + 1;
	up[v][0] = par;
	timer++;
	tin[v] = timer;
	for (int i = 1; i <= 20; i++) {
		up[v][i] = up[up[v][i-1]][i-1];
	}
	for (int j : g[v]) {
		if (j == par) continue;
		dfs(j, v);
	}
}

int lca(int a, int b) {
    if (deg[a] > deg[b]) swap(a, b);
    for (int i = 20; i >= 0; i--) {
        if (deg[up[b][i]] >= deg[a]) {
            b = up[b][i];
        }
    }
    if (a == b) return a;
    for (int i = 20; i >= 0; i--) {
        if (up[b][i] != up[a][i]) {
            a = up[a][i];
            b = up[b][i];
        }
    }
    return up[a][0];
}

void add(int x, int y) {
	cnt[x]++;
	cnt[y]++;
	cnt[lca(x, y)] -= 2;
}
void dfs2(int v, int par = 0) {
	for(int j : g[v]) {
		if (j == par) continue;
		dfs2(j, v);
		cnt[v] += cnt[j];			
	}
}
bool cmp(const int &i, const int &j) {
	return tin[i] < tin[j];
}
 
int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    int n = readInt(), m = readInt(), k = readInt();
    for (int i = 1; i < n; i++) {
		u[i] = readInt(), v[i] = readInt();
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
    }
    dfs(1);
    for (int i = 1; i <= m; i++) {
		int sz = readInt();
		vector<int> tmp;
		for (int j = 1; j <= sz; j++) {
			tmp.pb(readInt());
		}    	
		sort(tmp.begin(), tmp.end(), cmp);
		for (int j = 0; j < tmp.size(); j++) {
			add(tmp[j], tmp[(j + 1) % tmp.size()]);
		}
    }
    dfs2(1);
	vector<int> ans;
	for (int i = 1; i < n; i++) {
		if (tin[u[i]] > tin[v[i]]) swap(u[i], v[i]);
		if (cnt[v[i]] >= 2 * k) ans.pb(i);	
	}
	cout << ans.size() << endl;
	for (int i : ans) {
		cout << i << ' ';
	}
	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:154:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < tmp.size(); j++) {
                   ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 27 ms 25304 KB Output is correct
3 Correct 24 ms 25336 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 19 ms 23928 KB Output is correct
6 Correct 28 ms 25720 KB Output is correct
7 Correct 24 ms 25464 KB Output is correct
8 Correct 23 ms 25336 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 21 ms 23928 KB Output is correct
11 Correct 18 ms 23928 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 27 ms 25304 KB Output is correct
3 Correct 24 ms 25336 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 19 ms 23928 KB Output is correct
6 Correct 28 ms 25720 KB Output is correct
7 Correct 24 ms 25464 KB Output is correct
8 Correct 23 ms 25336 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 21 ms 23928 KB Output is correct
11 Correct 18 ms 23928 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 53 ms 25724 KB Output is correct
16 Correct 52 ms 25720 KB Output is correct
17 Correct 51 ms 25848 KB Output is correct
18 Correct 27 ms 25720 KB Output is correct
19 Correct 25 ms 25336 KB Output is correct
20 Correct 58 ms 25848 KB Output is correct
21 Correct 61 ms 25848 KB Output is correct
22 Correct 19 ms 23928 KB Output is correct
23 Correct 25 ms 25336 KB Output is correct
24 Correct 25 ms 25336 KB Output is correct
25 Correct 19 ms 23800 KB Output is correct
26 Correct 19 ms 23800 KB Output is correct
27 Correct 25 ms 25720 KB Output is correct
28 Correct 24 ms 25336 KB Output is correct
29 Correct 23 ms 25336 KB Output is correct
30 Correct 24 ms 25336 KB Output is correct
31 Correct 19 ms 23800 KB Output is correct
32 Correct 18 ms 23800 KB Output is correct
33 Correct 19 ms 23800 KB Output is correct
34 Correct 19 ms 23800 KB Output is correct
35 Correct 21 ms 23800 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 46580 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 144 ms 46328 KB Output is correct
4 Correct 132 ms 45688 KB Output is correct
5 Correct 164 ms 46580 KB Output is correct
6 Correct 143 ms 46964 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 42488 KB Output is correct
2 Correct 140 ms 39800 KB Output is correct
3 Correct 137 ms 39416 KB Output is correct
4 Correct 142 ms 39416 KB Output is correct
5 Correct 141 ms 39416 KB Output is correct
6 Correct 113 ms 42744 KB Output is correct
7 Correct 114 ms 42616 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 42488 KB Output is correct
2 Correct 140 ms 39800 KB Output is correct
3 Correct 137 ms 39416 KB Output is correct
4 Correct 142 ms 39416 KB Output is correct
5 Correct 141 ms 39416 KB Output is correct
6 Correct 113 ms 42744 KB Output is correct
7 Correct 114 ms 42616 KB Output is correct
8 Correct 128 ms 42616 KB Output is correct
9 Correct 133 ms 42744 KB Output is correct
10 Correct 139 ms 46880 KB Output is correct
11 Correct 128 ms 46580 KB Output is correct
12 Correct 114 ms 39288 KB Output is correct
13 Correct 111 ms 39288 KB Output is correct
14 Correct 139 ms 39372 KB Output is correct
15 Correct 137 ms 39392 KB Output is correct
16 Correct 139 ms 39416 KB Output is correct
17 Correct 135 ms 39416 KB Output is correct
18 Correct 138 ms 39416 KB Output is correct
19 Correct 130 ms 39800 KB Output is correct
20 Correct 116 ms 42872 KB Output is correct
21 Correct 112 ms 43000 KB Output is correct
22 Correct 114 ms 42872 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 27 ms 25304 KB Output is correct
3 Correct 24 ms 25336 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 19 ms 23928 KB Output is correct
6 Correct 28 ms 25720 KB Output is correct
7 Correct 24 ms 25464 KB Output is correct
8 Correct 23 ms 25336 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 21 ms 23928 KB Output is correct
11 Correct 18 ms 23928 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 53 ms 25724 KB Output is correct
16 Correct 52 ms 25720 KB Output is correct
17 Correct 51 ms 25848 KB Output is correct
18 Correct 27 ms 25720 KB Output is correct
19 Correct 25 ms 25336 KB Output is correct
20 Correct 58 ms 25848 KB Output is correct
21 Correct 61 ms 25848 KB Output is correct
22 Correct 19 ms 23928 KB Output is correct
23 Correct 25 ms 25336 KB Output is correct
24 Correct 25 ms 25336 KB Output is correct
25 Correct 19 ms 23800 KB Output is correct
26 Correct 19 ms 23800 KB Output is correct
27 Correct 25 ms 25720 KB Output is correct
28 Correct 24 ms 25336 KB Output is correct
29 Correct 23 ms 25336 KB Output is correct
30 Correct 24 ms 25336 KB Output is correct
31 Correct 19 ms 23800 KB Output is correct
32 Correct 18 ms 23800 KB Output is correct
33 Correct 19 ms 23800 KB Output is correct
34 Correct 19 ms 23800 KB Output is correct
35 Correct 21 ms 23800 KB Output is correct
36 Correct 152 ms 46580 KB Output is correct
37 Correct 25 ms 23800 KB Output is correct
38 Correct 144 ms 46328 KB Output is correct
39 Correct 132 ms 45688 KB Output is correct
40 Correct 164 ms 46580 KB Output is correct
41 Correct 143 ms 46964 KB Output is correct
42 Correct 114 ms 42488 KB Output is correct
43 Correct 140 ms 39800 KB Output is correct
44 Correct 137 ms 39416 KB Output is correct
45 Correct 142 ms 39416 KB Output is correct
46 Correct 141 ms 39416 KB Output is correct
47 Correct 113 ms 42744 KB Output is correct
48 Correct 114 ms 42616 KB Output is correct
49 Correct 128 ms 42616 KB Output is correct
50 Correct 133 ms 42744 KB Output is correct
51 Correct 139 ms 46880 KB Output is correct
52 Correct 128 ms 46580 KB Output is correct
53 Correct 114 ms 39288 KB Output is correct
54 Correct 111 ms 39288 KB Output is correct
55 Correct 139 ms 39372 KB Output is correct
56 Correct 137 ms 39392 KB Output is correct
57 Correct 139 ms 39416 KB Output is correct
58 Correct 135 ms 39416 KB Output is correct
59 Correct 138 ms 39416 KB Output is correct
60 Correct 130 ms 39800 KB Output is correct
61 Correct 116 ms 42872 KB Output is correct
62 Correct 112 ms 43000 KB Output is correct
63 Correct 114 ms 42872 KB Output is correct
64 Correct 128 ms 42876 KB Output is correct
65 Correct 160 ms 39492 KB Output is correct
66 Correct 156 ms 39364 KB Output is correct
67 Correct 147 ms 39416 KB Output is correct
68 Correct 103 ms 39372 KB Output is correct
69 Correct 101 ms 39288 KB Output is correct
70 Correct 130 ms 43128 KB Output is correct
71 Correct 133 ms 42488 KB Output is correct
72 Correct 19 ms 23800 KB Output is correct
73 Correct 24 ms 25336 KB Output is correct
74 Correct 24 ms 25336 KB Output is correct
75 Correct 19 ms 23800 KB Output is correct
76 Correct 18 ms 23800 KB Output is correct
77 Correct 25 ms 25720 KB Output is correct
78 Correct 25 ms 25464 KB Output is correct
79 Correct 23 ms 25336 KB Output is correct
80 Correct 24 ms 25464 KB Output is correct
81 Correct 19 ms 23800 KB Output is correct
82 Correct 18 ms 23800 KB Output is correct
83 Correct 19 ms 23800 KB Output is correct
84 Correct 18 ms 23928 KB Output is correct
85 Correct 20 ms 23800 KB Output is correct
86 Correct 51 ms 25720 KB Output is correct
87 Correct 50 ms 25720 KB Output is correct
88 Correct 52 ms 25852 KB Output is correct
89 Correct 25 ms 25720 KB Output is correct
90 Correct 24 ms 25464 KB Output is correct
91 Correct 57 ms 25848 KB Output is correct
92 Correct 58 ms 25848 KB Output is correct
93 Correct 19 ms 23800 KB Output is correct
94 Correct 146 ms 46580 KB Output is correct
95 Correct 142 ms 46200 KB Output is correct
96 Correct 135 ms 45688 KB Output is correct
97 Correct 157 ms 46580 KB Output is correct
98 Correct 139 ms 46960 KB Output is correct
99 Correct 136 ms 39544 KB Output is correct
100 Correct 133 ms 39416 KB Output is correct
101 Correct 136 ms 39420 KB Output is correct
102 Correct 130 ms 39928 KB Output is correct
103 Correct 118 ms 42616 KB Output is correct
104 Correct 114 ms 43000 KB Output is correct
105 Correct 111 ms 42616 KB Output is correct
106 Correct 131 ms 42876 KB Output is correct
107 Correct 125 ms 42616 KB Output is correct
108 Correct 135 ms 46580 KB Output is correct
109 Correct 129 ms 46680 KB Output is correct
110 Correct 108 ms 39416 KB Output is correct
111 Correct 109 ms 39416 KB Output is correct
112 Correct 137 ms 39416 KB Output is correct
113 Correct 133 ms 39416 KB Output is correct