oj.uz

답안 #1043469

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043469 2024-08-04T09:50:06 Z javotaz LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 134200 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], l[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 i = 0; i < c; i++)
		l[i] = p[par[d[i]]];
	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);
			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 + f[p[ku]][p[par[u]]].F;
			}
			else if ((f[p[ku]][p[par[u]]].S | x) == x) {
				for (char id2 = 0; id2 < c; ++id2)
					if (id2 != id1) {
						char j = bt[id2];
						if ((f[l[j]][p[ku]].S | x) == x)
							dp[mask][i] = min(dp[mask][i], dp[x][j] + f[l[j]][p[ku]].F + f[p[ku]][l[i]].F);
					}
			}
			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:62:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for (int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:77:15: warning: array subscript has type 'char' [-Wchar-subscripts]
   77 |    int i = bt[id1];
      |               ^~~
Main.cpp:86:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |       char j = bt[id2];
      |                   ^~~
Main.cpp:87:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   87 |       if ((f[l[j]][p[ku]].S | x) == x)
      |                ^
Main.cpp:88:45: warning: array subscript has type 'char' [-Wchar-subscripts]
   88 |        dp[mask][i] = min(dp[mask][i], dp[x][j] + f[l[j]][p[ku]].F + f[p[ku]][l[i]].F);
      |                                             ^
Main.cpp:88:54: warning: array subscript has type 'char' [-Wchar-subscripts]
   88 |        dp[mask][i] = min(dp[mask][i], dp[x][j] + f[l[j]][p[ku]].F + f[p[ku]][l[i]].F);
      |                                                      ^

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 117848 KB Output is correct
2 Correct 14 ms 117852 KB Output is correct
3 Correct 76 ms 125692 KB Output is correct
4 Correct 66 ms 125780 KB Output is correct
5 Correct 63 ms 125776 KB Output is correct
6 Correct 64 ms 125704 KB Output is correct
7 Correct 68 ms 125780 KB Output is correct
8 Correct 70 ms 125780 KB Output is correct
9 Correct 65 ms 125980 KB Output is correct
10 Correct 69 ms 125992 KB Output is correct
11 Correct 71 ms 125776 KB Output is correct
12 Correct 68 ms 127828 KB Output is correct
13 Correct 68 ms 128596 KB Output is correct
14 Correct 68 ms 127624 KB Output is correct
15 Correct 70 ms 127828 KB Output is correct
16 Correct 64 ms 129092 KB Output is correct
17 Correct 73 ms 128852 KB Output is correct
18 Correct 67 ms 129360 KB Output is correct
19 Correct 76 ms 133964 KB Output is correct
20 Correct 78 ms 134104 KB Output is correct
21 Correct 72 ms 134200 KB Output is correct
22 Correct 15 ms 117944 KB Output is correct
23 Correct 13 ms 117848 KB Output is correct
24 Correct 14 ms 117852 KB Output is correct
25 Correct 14 ms 118032 KB Output is correct
26 Correct 14 ms 118044 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 117852 KB Output is correct
2 Correct 15 ms 118024 KB Output is correct
3 Correct 15 ms 117988 KB Output is correct
4 Correct 15 ms 117852 KB Output is correct
5 Correct 153 ms 118364 KB Output is correct
6 Correct 164 ms 118396 KB Output is correct
7 Correct 170 ms 118352 KB Output is correct
8 Correct 153 ms 118612 KB Output is correct
9 Correct 145 ms 118188 KB Output is correct
10 Correct 108 ms 118364 KB Output is correct
11 Correct 115 ms 118360 KB Output is correct
12 Correct 105 ms 118408 KB Output is correct
13 Correct 117 ms 118404 KB Output is correct
14 Correct 97 ms 118364 KB Output is correct
15 Correct 149 ms 118364 KB Output is correct
16 Correct 156 ms 118364 KB Output is correct
17 Correct 159 ms 118432 KB Output is correct
18 Correct 86 ms 118364 KB Output is correct
19 Correct 122 ms 118364 KB Output is correct
20 Correct 117 ms 118364 KB Output is correct
21 Correct 123 ms 118620 KB Output is correct
22 Correct 103 ms 118876 KB Output is correct
23 Correct 106 ms 118984 KB Output is correct
24 Correct 99 ms 118876 KB Output is correct
25 Correct 543 ms 118008 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 117848 KB Output is correct
2 Correct 14 ms 117852 KB Output is correct
3 Correct 76 ms 125692 KB Output is correct
4 Correct 66 ms 125780 KB Output is correct
5 Correct 63 ms 125776 KB Output is correct
6 Correct 64 ms 125704 KB Output is correct
7 Correct 68 ms 125780 KB Output is correct
8 Correct 70 ms 125780 KB Output is correct
9 Correct 65 ms 125980 KB Output is correct
10 Correct 69 ms 125992 KB Output is correct
11 Correct 71 ms 125776 KB Output is correct
12 Correct 68 ms 127828 KB Output is correct
13 Correct 68 ms 128596 KB Output is correct
14 Correct 68 ms 127624 KB Output is correct
15 Correct 70 ms 127828 KB Output is correct
16 Correct 64 ms 129092 KB Output is correct
17 Correct 73 ms 128852 KB Output is correct
18 Correct 67 ms 129360 KB Output is correct
19 Correct 76 ms 133964 KB Output is correct
20 Correct 78 ms 134104 KB Output is correct
21 Correct 72 ms 134200 KB Output is correct
22 Correct 15 ms 117944 KB Output is correct
23 Correct 13 ms 117848 KB Output is correct
24 Correct 14 ms 117852 KB Output is correct
25 Correct 14 ms 118032 KB Output is correct
26 Correct 14 ms 118044 KB Output is correct
27 Correct 15 ms 117852 KB Output is correct
28 Correct 15 ms 118024 KB Output is correct
29 Correct 15 ms 117988 KB Output is correct
30 Correct 15 ms 117852 KB Output is correct
31 Correct 153 ms 118364 KB Output is correct
32 Correct 164 ms 118396 KB Output is correct
33 Correct 170 ms 118352 KB Output is correct
34 Correct 153 ms 118612 KB Output is correct
35 Correct 145 ms 118188 KB Output is correct
36 Correct 108 ms 118364 KB Output is correct
37 Correct 115 ms 118360 KB Output is correct
38 Correct 105 ms 118408 KB Output is correct
39 Correct 117 ms 118404 KB Output is correct
40 Correct 97 ms 118364 KB Output is correct
41 Correct 149 ms 118364 KB Output is correct
42 Correct 156 ms 118364 KB Output is correct
43 Correct 159 ms 118432 KB Output is correct
44 Correct 86 ms 118364 KB Output is correct
45 Correct 122 ms 118364 KB Output is correct
46 Correct 117 ms 118364 KB Output is correct
47 Correct 123 ms 118620 KB Output is correct
48 Correct 103 ms 118876 KB Output is correct
49 Correct 106 ms 118984 KB Output is correct
50 Correct 99 ms 118876 KB Output is correct
51 Correct 543 ms 118008 KB Output is correct
52 Execution timed out 2028 ms 107900 KB Time limit exceeded
53 Halted 0 ms 0 KB -