oj.uz

Submission #1043428

# Submission time Handle Problem Language Result Execution time Memory
1043428 2024-08-04T09:25:44 Z javotaz LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 216500 KB 
// In the Name of Allah

#include<bits/stdc++.h>
using namespace std;

//#pragma GCC optimize("Ofast,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,avx,avx2,sse4.2,popcnt,tune=native")

typedef long long ll;

#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()

const int N = 1e6 + 12, M = 20, inf = 2e9 + 7;
vector<pii> g[N];
int n, s, t, par[N], dp[(1 << M) + 4][M], p[N], kd[N], bt[M], sz, pd[N], e[N];
vector<int> q[(1 << M)];
pii f[2 * M + 2][2 * M + 2];
bool mrk[N];
vector<int> v, d;

struct node {
	int u, h, mask, par;
};

void ip() {
	cin >> n >> s >> t;
	for (int i = 1; i < n; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
}

void dfs(int u) {
	for (auto i: g[u])
		if (i.F != par[u]) { 
			par[i.F] = u;
			e[i.F] = e[u] + 1;
			if (i.S) {
				pd[i.F] = d.size(), d.pb(i.F), kd[i.F] = i.S;
				v.pb(u), v.pb(i.S);
			}
			dfs(i.F);
		}
}

void bfs(int u, int rt) {
	node st;
	st.par = st.u = u, st.h = st.mask = 0;
	vector<node> v;
	v.pb(st);
	while (!v.empty()) {
		node tmp = v.back();
		v.pp();
		if (mrk[tmp.u])
			f[rt][p[tmp.u]] = {tmp.h, tmp.mask};
		for (auto i: g[tmp.u])
			if (i.F != tmp.par) {
				node tmp2;
				tmp2.u = i.F, tmp2.h = tmp.h + 1, tmp2.par = tmp.u;
				tmp2.mask = (i.S? (tmp.mask | (1 << pd[(e[tmp.u] < e[i.F])? i.F : tmp.u])) : tmp.mask);
				v.pb(tmp2);
			}
	}
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ip();
	par[s] = s;
	dfs(s);
	v.pb(s), v.pb(t);
	sort(all(v));
	v.resize(unique(all(v)) - v.begin());
	for (int i = 0; i < v.size(); i++) 
		p[v[i]] = i, mrk[v[i]] = true;
	for (int i = 0; i < v.size(); i++)
		bfs(v[i], i);
	memset(dp, 127, sizeof dp);
	int c = d.size();
	int ans = inf;
	for (int mask = 1; mask < (1 << c); ++mask) {
		sz = 0;
		for (char i = 0; i < c; i++)
			if ((mask >> i) & 1)
				bt[sz++] = i;
		for (char id1 = 0; id1 < sz; ++id1) {
			int i = bt[id1];
			int u = d[i], ku = kd[d[i]], x = mask ^ (1 << i);
			int v1 = f[p[ku]][p[par[u]]].F;
			auto &dd = dp[mask][i];
			auto &bb = f[p[ku]];
			if (__builtin_popcount(mask) == 1) {
				if (f[p[s]][p[ku]].S == x && f[p[ku]][p[par[u]]].S == x)
					dp[mask][i] = f[p[s]][p[ku]].F + v1;
			}
			else if ((f[p[ku]][p[par[u]]].S | x) == x) 
				for (auto j: q[x])
					if ((f[p[par[d[j]]]][p[ku]].S | x) == x)
						dd = min(dd, dp[x][j] + bb[p[par[d[j]]]].F + v1);
			if ((f[p[par[u]]][p[t]].S | mask) == mask)
				ans = min(ans, dp[mask][i] + f[p[par[u]]][p[t]].F);
			if (dp[mask][i] != inf)
				q[mask].pb(i);
		}
	}
	if (f[p[s]][p[t]].S == 0)
		ans = f[p[s]][p[t]].F;
	cout << ((ans == inf)? -1 : ans) << '\n';

	return 0;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:81:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:94:15: warning: array subscript has type 'char' [-Wchar-subscripts]
   94 |    int i = bt[id1];
      |               ^~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 142684 KB Output is correct
2 Correct 20 ms 142760 KB Output is correct
3 Correct 86 ms 146616 KB Output is correct
4 Correct 77 ms 146768 KB Output is correct
5 Correct 80 ms 146644 KB Output is correct
6 Correct 74 ms 146628 KB Output is correct
7 Correct 77 ms 146772 KB Output is correct
8 Correct 76 ms 146748 KB Output is correct
9 Correct 79 ms 147028 KB Output is correct
10 Correct 78 ms 146772 KB Output is correct
11 Correct 78 ms 146772 KB Output is correct
12 Correct 78 ms 148560 KB Output is correct
13 Correct 79 ms 148068 KB Output is correct
14 Correct 78 ms 147536 KB Output is correct
15 Correct 81 ms 148820 KB Output is correct
16 Correct 82 ms 149588 KB Output is correct
17 Correct 80 ms 149588 KB Output is correct
18 Correct 79 ms 150212 KB Output is correct
19 Correct 90 ms 155216 KB Output is correct
20 Correct 89 ms 154960 KB Output is correct
21 Correct 83 ms 154572 KB Output is correct
22 Correct 16 ms 142684 KB Output is correct
23 Correct 17 ms 142680 KB Output is correct
24 Correct 19 ms 142680 KB Output is correct
25 Correct 16 ms 142680 KB Output is correct
26 Correct 17 ms 142684 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 142728 KB Output is correct
2 Correct 18 ms 142680 KB Output is correct
3 Correct 19 ms 142684 KB Output is correct
4 Correct 19 ms 142876 KB Output is correct
5 Correct 199 ms 178704 KB Output is correct
6 Correct 207 ms 178764 KB Output is correct
7 Correct 210 ms 178600 KB Output is correct
8 Correct 191 ms 178516 KB Output is correct
9 Correct 190 ms 178512 KB Output is correct
10 Correct 158 ms 178516 KB Output is correct
11 Correct 178 ms 178676 KB Output is correct
12 Correct 166 ms 178512 KB Output is correct
13 Correct 159 ms 178516 KB Output is correct
14 Correct 156 ms 178772 KB Output is correct
15 Correct 201 ms 178516 KB Output is correct
16 Correct 198 ms 178768 KB Output is correct
17 Correct 199 ms 178512 KB Output is correct
18 Correct 146 ms 178840 KB Output is correct
19 Correct 170 ms 178768 KB Output is correct
20 Correct 162 ms 178772 KB Output is correct
21 Correct 165 ms 179028 KB Output is correct
22 Correct 172 ms 179156 KB Output is correct
23 Correct 162 ms 179100 KB Output is correct
24 Correct 158 ms 179300 KB Output is correct
25 Correct 508 ms 216500 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 142684 KB Output is correct
2 Correct 20 ms 142760 KB Output is correct
3 Correct 86 ms 146616 KB Output is correct
4 Correct 77 ms 146768 KB Output is correct
5 Correct 80 ms 146644 KB Output is correct
6 Correct 74 ms 146628 KB Output is correct
7 Correct 77 ms 146772 KB Output is correct
8 Correct 76 ms 146748 KB Output is correct
9 Correct 79 ms 147028 KB Output is correct
10 Correct 78 ms 146772 KB Output is correct
11 Correct 78 ms 146772 KB Output is correct
12 Correct 78 ms 148560 KB Output is correct
13 Correct 79 ms 148068 KB Output is correct
14 Correct 78 ms 147536 KB Output is correct
15 Correct 81 ms 148820 KB Output is correct
16 Correct 82 ms 149588 KB Output is correct
17 Correct 80 ms 149588 KB Output is correct
18 Correct 79 ms 150212 KB Output is correct
19 Correct 90 ms 155216 KB Output is correct
20 Correct 89 ms 154960 KB Output is correct
21 Correct 83 ms 154572 KB Output is correct
22 Correct 16 ms 142684 KB Output is correct
23 Correct 17 ms 142680 KB Output is correct
24 Correct 19 ms 142680 KB Output is correct
25 Correct 16 ms 142680 KB Output is correct
26 Correct 17 ms 142684 KB Output is correct
27 Correct 18 ms 142728 KB Output is correct
28 Correct 18 ms 142680 KB Output is correct
29 Correct 19 ms 142684 KB Output is correct
30 Correct 19 ms 142876 KB Output is correct
31 Correct 199 ms 178704 KB Output is correct
32 Correct 207 ms 178764 KB Output is correct
33 Correct 210 ms 178600 KB Output is correct
34 Correct 191 ms 178516 KB Output is correct
35 Correct 190 ms 178512 KB Output is correct
36 Correct 158 ms 178516 KB Output is correct
37 Correct 178 ms 178676 KB Output is correct
38 Correct 166 ms 178512 KB Output is correct
39 Correct 159 ms 178516 KB Output is correct
40 Correct 156 ms 178772 KB Output is correct
41 Correct 201 ms 178516 KB Output is correct
42 Correct 198 ms 178768 KB Output is correct
43 Correct 199 ms 178512 KB Output is correct
44 Correct 146 ms 178840 KB Output is correct
45 Correct 170 ms 178768 KB Output is correct
46 Correct 162 ms 178772 KB Output is correct
47 Correct 165 ms 179028 KB Output is correct
48 Correct 172 ms 179156 KB Output is correct
49 Correct 162 ms 179100 KB Output is correct
50 Correct 158 ms 179300 KB Output is correct
51 Correct 508 ms 216500 KB Output is correct
52 Execution timed out 2067 ms 115412 KB Time limit exceeded
53 Halted 0 ms 0 KB -