Submission #972313

#	Time	Username	Problem	Language	Result	Execution time	Memory
972313		c2zi6	Railway (BOI17_railway)	C++14	36 / 100	109 ms	26968 KiB

railway

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

VVPI gp;
VI val;

VI vec;

VI tin, tout;
void increment(int u, int v) {
	vec[tin[u]]--;
	vec[tin[v]]++;

	/* val[u]--; */
	/* val[v]++; */
}

void getall(int u = 0, int p = -1) {
	for (auto[v, i] : gp[u]) if (v != p) {
		getall(v, u);
		val[u] += val[v];
	}
}

VI paredge;
int tc  = 0;
VVI par; 
void dfs(int u = 0, int p = 0, int pi = -1) {
	tin[u] = tc++;
	paredge[u] = pi;
	par[u][0] = p;
	replr(i, 1, 19) par[u][i] = par[par[u][i-1]][i-1];
	for (auto[v, i] : gp[u]) if (v != p) {
		dfs(v, u, i);
	}
	tout[u] = tc++;
}
bool isanc(int u, int v) {
	return tin[u] <= tin[v] && tout[v] <= tout[u];
}
int LCA(int u, int v) {
	if (isanc(u, v)) return u;
	reprl(i, 19, 0) if (!isanc(par[u][i], v)) u = par[u][i];
	return par[u][0];
}

void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	gp = VVPI(n);
	rep(i, n-1) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		gp[u].pb({v, i});
		gp[v].pb({u, i});
	}
	tin = tout = VI(n);
	par = VVI(n, VI(20));
	paredge = VI(n);
	tc = 1;
	dfs();

	val = VI(n);
	vec = VI(2*n+1);
	rep(i, m) {
		int s;
		cin >> s;
		VPI a(s);
		for (auto&[t, u] : a) {
			cin >> u;
			u--;
			t = tin[u];
		}
		sort(all(a));
		rep(i, s) {
			int j = (i+1)%a.size();
			int lca = LCA(a[i].ss, a[j].ss);
			increment(lca, a[i].ss);
			increment(lca, a[j].ss);
			/* cout << lca+1 << " -> " << a[i].ss+1 << endl; */
			/* cout << lca+1 << " -> " << a[j].ss+1 << endl; */
		}
		/* rep(i, s-1) { */
		/* 	int lca = LCA(a[i].ss, a[i+1].ss); */
		/* 	a.pb({tin[lca], lca}); */
		/* } */
		/* sort(all(a)); */
		/*  */
			/* unique */
		/* VPI b{a[0]}; */
		/* for (int i = 1; i < a.size(); i++) if (a[i] != a[i-1]) b.pb(a[i]); */
		/* a = b; */
		/*  */
			/* for (auto&[t, u] : a) cout << u+1 << " "; cout << endl; */
		/* for (auto&[t, u] : a) { */
		/* 	int cur = tin[u]; */
		/* 	while (true) { */
		/* 		auto it = upper_bound(all(a), mkp(cur, (int)+2e9)); */
		/* 		if (it == a.end() || tin[it->ss] > tout[u]) break; */
		/* 		cout << u+1 << " -> " << it->ss+1 << endl; */
		/* 		increment(u, it->ss); */
		/* 		cur = tout[it->ss]; */
		/* 	} */
		/* } */
	}
	/* getall(); */
	/* rep(u, n) cout << u+1 << ": " << val[u] << endl; */

	/* replr(i, 1, 2*n) cout << vec[i] << " "; cout << endl; */
	replr(i, 1, 2*n) vec[i] += vec[i-1];
	/* replr(i, 1, 2*n) cout << vec[i] << " "; cout << endl; */


	/* rep(u, n) cout << vec[tout[u]] - vec[tin[u]-1] << " "; cout << endl; */

	VI ans;
	rep(u, n) if (vec[tout[u]] - vec[tin[u]-1] >= 2*k) ans.pb(paredge[u]+1);

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


	/* VI ans; */
	/* rep(u, n) if (val[u] >= 2*k) ans.pb(paredge[u]+1); */
	/* cout << ans.size() << endl; */
	/* for (int x : ans) cout << x << " "; cout << endl; */
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    /* cin >> t; */
    while (t--) solve();
}

Compilation message (stderr)

railway.cpp: In function 'void getall(int, int)':
railway.cpp:48:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |  for (auto[v, i] : gp[u]) if (v != p) {
      |           ^
railway.cpp: In function 'void dfs(int, int, int)':
railway.cpp:62:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   62 |  for (auto[v, i] : gp[u]) if (v != p) {
      |           ^
railway.cpp: In function 'void solve()':
railway.cpp:99:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |   for (auto&[t, u] : a) {
      |             ^
railway.cpp:150:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  150 |  for (int x : ans) cout << x << " "; cout << endl;
      |  ^~~
railway.cpp:150:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  150 |  for (int x : ans) cout << x << " "; cout << endl;
      |                                      ^~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 7 / 7
• Subtask 4: 29 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25