oj.uz

Submission #1043393

# Submission time Handle Problem Language Result Execution time Memory
1043393 2024-08-04T09:02:51 Z javotaz LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 128972 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()
#define MN(a, b) ((a < b)? a : b)

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];
pii f[2 * M + 2][2 * M + 2];
bool mrk[N];
vector<int> v, d;

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 dfs2(int u, int rt, int h = 0, int mask = 0, int par = -1) {
	if (mrk[u])
		f[rt][p[u]] = {h, mask};
	for (auto i: g[u])
		if (i.F != par)
			dfs2(i.F, rt, h + 1, (i.S? (mask | (1 << pd[(e[u] < e[i.F])? i.F : u])) : mask), u);
}

void solve() {
	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++)
		dfs2(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;
			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 (char id2 = 0; id2 < c; ++id2)
					if (id1 != id2) {
						char j = bt[id2];
						int v = d[bt[id2]];
						if ((f[p[par[v]]][p[ku]].S | x) == x)
							dp[mask][i] = MN(dp[mask][i], dp[x][j] + f[p[par[v]]][p[ku]].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 (f[p[s]][p[t]].S == 0)
		ans = f[p[s]][p[t]].F;
	cout << ((ans == inf)? -1 : ans) << '\n';
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ip(), solve();
	return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:65:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:76:15: warning: array subscript has type 'char' [-Wchar-subscripts]
   76 |    int i = bt[id1];
      |               ^~~
Main.cpp:86:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |       char j = bt[id2];
      |                   ^~~
Main.cpp:87:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   87 |       int v = d[bt[id2]];
      |                    ^~~
Main.cpp:89:44: warning: array subscript has type 'char' [-Wchar-subscripts]
   89 |        dp[mask][i] = MN(dp[mask][i], dp[x][j] + f[p[par[v]]][p[ku]].F + v1);
      |                                            ^
Main.cpp:17:24: note: in definition of macro 'MN'
   17 | #define MN(a, b) ((a < b)? a : b)
      |                        ^
Main.cpp:89:44: warning: array subscript has type 'char' [-Wchar-subscripts]
   89 |        dp[mask][i] = MN(dp[mask][i], dp[x][j] + f[p[par[v]]][p[ku]].F + v1);
      |                                            ^
Main.cpp:17:32: note: in definition of macro 'MN'
   17 | #define MN(a, b) ((a < b)? a : b)
      |                                ^

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 116060 KB Output is correct
2 Correct 12 ms 116060 KB Output is correct
3 Correct 68 ms 120404 KB Output is correct
4 Correct 84 ms 120524 KB Output is correct
5 Correct 76 ms 120404 KB Output is correct
6 Correct 80 ms 120404 KB Output is correct
7 Correct 70 ms 120516 KB Output is correct
8 Correct 67 ms 120464 KB Output is correct
9 Correct 70 ms 120660 KB Output is correct
10 Correct 77 ms 120476 KB Output is correct
11 Correct 67 ms 120660 KB Output is correct
12 Correct 68 ms 122704 KB Output is correct
13 Correct 69 ms 123472 KB Output is correct
14 Correct 72 ms 122196 KB Output is correct
15 Correct 70 ms 122464 KB Output is correct
16 Correct 72 ms 123700 KB Output is correct
17 Correct 71 ms 123636 KB Output is correct
18 Correct 74 ms 124172 KB Output is correct
19 Correct 85 ms 128720 KB Output is correct
20 Correct 78 ms 128972 KB Output is correct
21 Correct 85 ms 128848 KB Output is correct
22 Correct 15 ms 116184 KB Output is correct
23 Correct 15 ms 116056 KB Output is correct
24 Correct 14 ms 116060 KB Output is correct
25 Correct 15 ms 116036 KB Output is correct
26 Correct 13 ms 116060 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 116056 KB Output is correct
2 Correct 13 ms 115992 KB Output is correct
3 Correct 14 ms 116120 KB Output is correct
4 Correct 16 ms 116180 KB Output is correct
5 Correct 182 ms 116452 KB Output is correct
6 Correct 164 ms 116316 KB Output is correct
7 Correct 200 ms 116472 KB Output is correct
8 Correct 168 ms 116312 KB Output is correct
9 Correct 161 ms 116312 KB Output is correct
10 Correct 122 ms 116312 KB Output is correct
11 Correct 143 ms 116316 KB Output is correct
12 Correct 118 ms 116312 KB Output is correct
13 Correct 138 ms 116312 KB Output is correct
14 Correct 126 ms 116308 KB Output is correct
15 Correct 187 ms 116316 KB Output is correct
16 Correct 168 ms 116312 KB Output is correct
17 Correct 162 ms 116304 KB Output is correct
18 Correct 100 ms 116568 KB Output is correct
19 Correct 129 ms 116572 KB Output is correct
20 Correct 132 ms 116572 KB Output is correct
21 Correct 138 ms 116568 KB Output is correct
22 Correct 122 ms 116828 KB Output is correct
23 Correct 117 ms 116824 KB Output is correct
24 Correct 119 ms 116824 KB Output is correct
25 Correct 550 ms 116056 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 116060 KB Output is correct
2 Correct 12 ms 116060 KB Output is correct
3 Correct 68 ms 120404 KB Output is correct
4 Correct 84 ms 120524 KB Output is correct
5 Correct 76 ms 120404 KB Output is correct
6 Correct 80 ms 120404 KB Output is correct
7 Correct 70 ms 120516 KB Output is correct
8 Correct 67 ms 120464 KB Output is correct
9 Correct 70 ms 120660 KB Output is correct
10 Correct 77 ms 120476 KB Output is correct
11 Correct 67 ms 120660 KB Output is correct
12 Correct 68 ms 122704 KB Output is correct
13 Correct 69 ms 123472 KB Output is correct
14 Correct 72 ms 122196 KB Output is correct
15 Correct 70 ms 122464 KB Output is correct
16 Correct 72 ms 123700 KB Output is correct
17 Correct 71 ms 123636 KB Output is correct
18 Correct 74 ms 124172 KB Output is correct
19 Correct 85 ms 128720 KB Output is correct
20 Correct 78 ms 128972 KB Output is correct
21 Correct 85 ms 128848 KB Output is correct
22 Correct 15 ms 116184 KB Output is correct
23 Correct 15 ms 116056 KB Output is correct
24 Correct 14 ms 116060 KB Output is correct
25 Correct 15 ms 116036 KB Output is correct
26 Correct 13 ms 116060 KB Output is correct
27 Correct 14 ms 116056 KB Output is correct
28 Correct 13 ms 115992 KB Output is correct
29 Correct 14 ms 116120 KB Output is correct
30 Correct 16 ms 116180 KB Output is correct
31 Correct 182 ms 116452 KB Output is correct
32 Correct 164 ms 116316 KB Output is correct
33 Correct 200 ms 116472 KB Output is correct
34 Correct 168 ms 116312 KB Output is correct
35 Correct 161 ms 116312 KB Output is correct
36 Correct 122 ms 116312 KB Output is correct
37 Correct 143 ms 116316 KB Output is correct
38 Correct 118 ms 116312 KB Output is correct
39 Correct 138 ms 116312 KB Output is correct
40 Correct 126 ms 116308 KB Output is correct
41 Correct 187 ms 116316 KB Output is correct
42 Correct 168 ms 116312 KB Output is correct
43 Correct 162 ms 116304 KB Output is correct
44 Correct 100 ms 116568 KB Output is correct
45 Correct 129 ms 116572 KB Output is correct
46 Correct 132 ms 116572 KB Output is correct
47 Correct 138 ms 116568 KB Output is correct
48 Correct 122 ms 116828 KB Output is correct
49 Correct 117 ms 116824 KB Output is correct
50 Correct 119 ms 116824 KB Output is correct
51 Correct 550 ms 116056 KB Output is correct
52 Execution timed out 2070 ms 87224 KB Time limit exceeded
53 Halted 0 ms 0 KB -