oj.uz

Submission #469279

# Submission time Handle Problem Language Result Execution time Memory
469279 2021-08-31T10:45:46 Z sinamhdv LOSTIKS (INOI20_lostiks) C++11
23 / 100
 927 ms 214824 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define fast_io ios::sync_with_stdio(0); cin.tie(0);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fr first
#define sc second
#define endl '\n'

const int MAXN = 1000010;
const int MAXE = 22;
const int LOGN = 23;

int n, s, t, m;
int ef[MAXN], eto[MAXN], ky[MAXN], kind[MAXN];
vector<int> adj[MAXN];
int lpar[LOGN][MAXN];
int h[MAXN];
int pth[MAXN];
int lck[MAXE];
int dp[1 << 20][20];
int inp[MAXE];
int cost[MAXE][MAXE];
int tot;

void dfs(int v)
{
	for (int e : adj[v])
	{
		int u = ef[e] ^ eto[e] ^ v;
		if (u == lpar[0][v]) continue;
		lpar[0][u] = v;
		h[u] = h[v] + 1;
		pth[u] = pth[v] | (ky[e] ? (1 << kind[e]) : 0);
		dfs(u);
	}
}

void bkdfs(int v)
{
	tot |= (1 << v);
	FOR(i, 0, m) if ((inp[v] >> i & 1) && !(tot >> i & 1)) bkdfs(i);
}

inline int getpar(int x, int d)
{
	FOR(i, 0, LOGN) if (d >> i & 1) x = lpar[i][x];
	return x;
}

inline int getlca(int x, int y)
{
	if (h[x] > h[y]) swap(x, y);
	y = getpar(y, h[y] - h[x]);
	if (x == y) return x;
	for (int i = LOGN - 1; i >= 0; i--)
	{
		if (lpar[i][x] != lpar[i][y])
		{
			x = lpar[i][x];
			y = lpar[i][y];
		}
	}
	return lpar[0][x];
}

int32_t main(void)
{
	fast_io;
	cin >> n >> s >> t;
	FOR(i, 0, n - 1)
	{
		cin >> ef[i] >> eto[i] >> ky[i];
		adj[ef[i]].pb(i);
		adj[eto[i]].pb(i);
		if (ky[i])
		{
			lck[m] = i;
			kind[i] = m;
			m++;
		}
	}

	dbg(m);

	dfs(s);

	dbgr(pth + 1, pth + n + 1);
	if (pth[t] == 0)
	{
		return cout << h[t] << endl, 0;
	}

	FOR(i, 0, n - 1) if (h[ef[i]] > h[eto[i]]) swap(ef[i], eto[i]);

	FOR(i, 1, LOGN) FOR(j, 1, n + 1) lpar[i][j] = lpar[i - 1][lpar[i - 1][j]];

	FOR(i, 0, m)
	{
		int e = lck[i];
		inp[i] = (pth[ef[e]] | pth[ky[e]]);
	}

	FOR(i, 0, m) FOR(j, 0, m) if (i != j)
	{
		int x = ef[lck[i]];
		int y = ky[lck[j]];
		int z = ef[lck[j]];
		cost[i][j] = h[x] + h[y] - 2 * h[getlca(x, y)] + h[y] + h[z] - 2 * h[getlca(y, z)];

//		cout << i << ' ' << j << ' ' << cost[i][j] << endl;
	}

	dbgr(h + 1, h + n + 1);
	dbgr(pth + 1, pth + n + 1);
	dbgr(lck, lck + m);
	dbgr(inp, inp + m);

	FOR(mask, 1, 1 << m) fill(dp[mask], dp[mask] + MAXE, INF);

	FOR(mask, 1, 1 << m)
	{
		if (__builtin_popcount(mask) == 1)
		{
			int v = __lg(mask);
			if (!(inp[v] & mask)) dp[mask][v] = 0;
			continue;
		}
		FOR(v, 0, m)
		{
			if ((mask >> v & 1) && (inp[v] & mask) == 0)
			{
				int sub = mask ^ (1 << v);
				FOR(x, 0, m) if (sub >> x & 1)
				{
					dp[mask][v] = min(dp[mask][v], dp[sub][x] + cost[v][x]);
				}
			}
		}
	}

//	FOR(mask, 0, 1 << m) FOR(v, 0, m) cout << v << ' ' << mask << ' ' << dp[mask][v] << endl;

	int laste = -1;
	FOR(i, 0, m) if (pth[t] >> i & 1) if (laste == -1 || h[ef[lck[i]]] > h[ef[lck[laste]]]) laste = i;

	bkdfs(laste);
	int ans = INF;
	FOR(v, 0, m)
	{
		int cs = h[ky[lck[v]]] + h[ky[lck[v]]] + h[ef[lck[v]]] - 2 * h[getlca(ky[lck[v]], ef[lck[v]])];
		ans = min(ans, cs + dp[tot][v]);
	}

	if (ans >= INF) return cout << "-1\n", 0;
	ans += h[t] - h[ef[lck[laste]]];

	cout << ans << endl;

	return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24012 KB Output is correct
2 Correct 13 ms 24004 KB Output is correct
3 Correct 78 ms 38400 KB Output is correct
4 Correct 72 ms 38392 KB Output is correct
5 Correct 75 ms 38376 KB Output is correct
6 Correct 75 ms 38468 KB Output is correct
7 Correct 75 ms 38416 KB Output is correct
8 Correct 74 ms 38436 KB Output is correct
9 Correct 80 ms 38652 KB Output is correct
10 Correct 80 ms 38468 KB Output is correct
11 Correct 87 ms 38496 KB Output is correct
12 Correct 67 ms 40304 KB Output is correct
13 Correct 69 ms 40028 KB Output is correct
14 Correct 67 ms 39616 KB Output is correct
15 Correct 67 ms 40512 KB Output is correct
16 Correct 67 ms 41188 KB Output is correct
17 Correct 68 ms 41320 KB Output is correct
18 Correct 71 ms 41796 KB Output is correct
19 Correct 71 ms 45796 KB Output is correct
20 Correct 81 ms 45692 KB Output is correct
21 Correct 79 ms 45472 KB Output is correct
22 Correct 13 ms 24012 KB Output is correct
23 Correct 14 ms 24012 KB Output is correct
24 Correct 13 ms 24012 KB Output is correct
25 Correct 13 ms 23964 KB Output is correct
26 Correct 13 ms 23876 KB Output is correct

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24036 KB Output is correct
2 Correct 14 ms 23928 KB Output is correct
3 Correct 14 ms 24140 KB Output is correct
4 Correct 14 ms 24140 KB Output is correct
5 Correct 162 ms 66076 KB Output is correct
6 Correct 134 ms 66100 KB Output is correct
7 Correct 182 ms 65988 KB Output is correct
8 Correct 141 ms 66096 KB Output is correct
9 Correct 159 ms 66084 KB Output is correct
10 Correct 105 ms 66084 KB Output is correct
11 Correct 106 ms 66108 KB Output is correct
12 Correct 103 ms 65988 KB Output is correct
13 Correct 106 ms 66124 KB Output is correct
14 Correct 108 ms 66120 KB Output is correct
15 Correct 166 ms 66120 KB Output is correct
16 Correct 177 ms 66076 KB Output is correct
17 Correct 147 ms 66124 KB Output is correct
18 Correct 107 ms 66372 KB Output is correct
19 Correct 103 ms 66272 KB Output is correct
20 Correct 103 ms 66244 KB Output is correct
21 Correct 104 ms 66244 KB Output is correct
22 Correct 103 ms 66596 KB Output is correct
23 Correct 108 ms 66628 KB Output is correct
24 Correct 106 ms 66548 KB Output is correct
25 Runtime error 927 ms 214824 KB Execution killed with signal 11

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24012 KB Output is correct
2 Correct 13 ms 24004 KB Output is correct
3 Correct 78 ms 38400 KB Output is correct
4 Correct 72 ms 38392 KB Output is correct
5 Correct 75 ms 38376 KB Output is correct
6 Correct 75 ms 38468 KB Output is correct
7 Correct 75 ms 38416 KB Output is correct
8 Correct 74 ms 38436 KB Output is correct
9 Correct 80 ms 38652 KB Output is correct
10 Correct 80 ms 38468 KB Output is correct
11 Correct 87 ms 38496 KB Output is correct
12 Correct 67 ms 40304 KB Output is correct
13 Correct 69 ms 40028 KB Output is correct
14 Correct 67 ms 39616 KB Output is correct
15 Correct 67 ms 40512 KB Output is correct
16 Correct 67 ms 41188 KB Output is correct
17 Correct 68 ms 41320 KB Output is correct
18 Correct 71 ms 41796 KB Output is correct
19 Correct 71 ms 45796 KB Output is correct
20 Correct 81 ms 45692 KB Output is correct
21 Correct 79 ms 45472 KB Output is correct
22 Correct 13 ms 24012 KB Output is correct
23 Correct 14 ms 24012 KB Output is correct
24 Correct 13 ms 24012 KB Output is correct
25 Correct 13 ms 23964 KB Output is correct
26 Correct 13 ms 23876 KB Output is correct
27 Correct 14 ms 24036 KB Output is correct
28 Correct 14 ms 23928 KB Output is correct
29 Correct 14 ms 24140 KB Output is correct
30 Correct 14 ms 24140 KB Output is correct
31 Correct 162 ms 66076 KB Output is correct
32 Correct 134 ms 66100 KB Output is correct
33 Correct 182 ms 65988 KB Output is correct
34 Correct 141 ms 66096 KB Output is correct
35 Correct 159 ms 66084 KB Output is correct
36 Correct 105 ms 66084 KB Output is correct
37 Correct 106 ms 66108 KB Output is correct
38 Correct 103 ms 65988 KB Output is correct
39 Correct 106 ms 66124 KB Output is correct
40 Correct 108 ms 66120 KB Output is correct
41 Correct 166 ms 66120 KB Output is correct
42 Correct 177 ms 66076 KB Output is correct
43 Correct 147 ms 66124 KB Output is correct
44 Correct 107 ms 66372 KB Output is correct
45 Correct 103 ms 66272 KB Output is correct
46 Correct 103 ms 66244 KB Output is correct
47 Correct 104 ms 66244 KB Output is correct
48 Correct 103 ms 66596 KB Output is correct
49 Correct 108 ms 66628 KB Output is correct
50 Correct 106 ms 66548 KB Output is correct
51 Runtime error 927 ms 214824 KB Execution killed with signal 11