oj.uz

답안 #1043411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043411 2024-08-04T09:10:00 Z javotaz LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 128928 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];
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);
}

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++)
		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, j, v;
			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 (int id2 = 0; id2 < c; ++id2)
					if (id1 != id2) {
						j = bt[id2], v = d[bt[id2]];
						if ((f[p[par[v]]][p[ku]].S | x) == x)
							dd = min(dd, dp[x][j] + bb[p[par[v]]].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';

	return 0;
}

Compilation message

Main.cpp: In function 'int32_t main()':
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:66:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  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];
      |               ^~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 116056 KB Output is correct
2 Correct 13 ms 116060 KB Output is correct
3 Correct 63 ms 120404 KB Output is correct
4 Correct 65 ms 120368 KB Output is correct
5 Correct 64 ms 120556 KB Output is correct
6 Correct 68 ms 120388 KB Output is correct
7 Correct 63 ms 120508 KB Output is correct
8 Correct 71 ms 120456 KB Output is correct
9 Correct 67 ms 120660 KB Output is correct
10 Correct 64 ms 120400 KB Output is correct
11 Correct 64 ms 120472 KB Output is correct
12 Correct 64 ms 122192 KB Output is correct
13 Correct 64 ms 122772 KB Output is correct
14 Correct 61 ms 121808 KB Output is correct
15 Correct 63 ms 122448 KB Output is correct
16 Correct 64 ms 123324 KB Output is correct
17 Correct 65 ms 123352 KB Output is correct
18 Correct 63 ms 123972 KB Output is correct
19 Correct 69 ms 128928 KB Output is correct
20 Correct 65 ms 128592 KB Output is correct
21 Correct 78 ms 128340 KB Output is correct
22 Correct 14 ms 116060 KB Output is correct
23 Correct 15 ms 116060 KB Output is correct
24 Correct 13 ms 116132 KB Output is correct
25 Correct 13 ms 116076 KB Output is correct
26 Correct 15 ms 116084 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 116060 KB Output is correct
2 Correct 14 ms 116060 KB Output is correct
3 Correct 15 ms 116060 KB Output is correct
4 Correct 15 ms 116176 KB Output is correct
5 Correct 185 ms 116456 KB Output is correct
6 Correct 173 ms 116464 KB Output is correct
7 Correct 205 ms 116316 KB Output is correct
8 Correct 175 ms 116312 KB Output is correct
9 Correct 177 ms 116364 KB Output is correct
10 Correct 134 ms 116316 KB Output is correct
11 Correct 132 ms 116316 KB Output is correct
12 Correct 125 ms 116312 KB Output is correct
13 Correct 127 ms 116316 KB Output is correct
14 Correct 150 ms 116312 KB Output is correct
15 Correct 194 ms 116316 KB Output is correct
16 Correct 200 ms 116312 KB Output is correct
17 Correct 175 ms 116316 KB Output is correct
18 Correct 100 ms 116568 KB Output is correct
19 Correct 130 ms 116568 KB Output is correct
20 Correct 128 ms 116548 KB Output is correct
21 Correct 136 ms 116700 KB Output is correct
22 Correct 118 ms 116828 KB Output is correct
23 Correct 121 ms 116824 KB Output is correct
24 Correct 114 ms 117004 KB Output is correct
25 Correct 781 ms 116136 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 116056 KB Output is correct
2 Correct 13 ms 116060 KB Output is correct
3 Correct 63 ms 120404 KB Output is correct
4 Correct 65 ms 120368 KB Output is correct
5 Correct 64 ms 120556 KB Output is correct
6 Correct 68 ms 120388 KB Output is correct
7 Correct 63 ms 120508 KB Output is correct
8 Correct 71 ms 120456 KB Output is correct
9 Correct 67 ms 120660 KB Output is correct
10 Correct 64 ms 120400 KB Output is correct
11 Correct 64 ms 120472 KB Output is correct
12 Correct 64 ms 122192 KB Output is correct
13 Correct 64 ms 122772 KB Output is correct
14 Correct 61 ms 121808 KB Output is correct
15 Correct 63 ms 122448 KB Output is correct
16 Correct 64 ms 123324 KB Output is correct
17 Correct 65 ms 123352 KB Output is correct
18 Correct 63 ms 123972 KB Output is correct
19 Correct 69 ms 128928 KB Output is correct
20 Correct 65 ms 128592 KB Output is correct
21 Correct 78 ms 128340 KB Output is correct
22 Correct 14 ms 116060 KB Output is correct
23 Correct 15 ms 116060 KB Output is correct
24 Correct 13 ms 116132 KB Output is correct
25 Correct 13 ms 116076 KB Output is correct
26 Correct 15 ms 116084 KB Output is correct
27 Correct 14 ms 116060 KB Output is correct
28 Correct 14 ms 116060 KB Output is correct
29 Correct 15 ms 116060 KB Output is correct
30 Correct 15 ms 116176 KB Output is correct
31 Correct 185 ms 116456 KB Output is correct
32 Correct 173 ms 116464 KB Output is correct
33 Correct 205 ms 116316 KB Output is correct
34 Correct 175 ms 116312 KB Output is correct
35 Correct 177 ms 116364 KB Output is correct
36 Correct 134 ms 116316 KB Output is correct
37 Correct 132 ms 116316 KB Output is correct
38 Correct 125 ms 116312 KB Output is correct
39 Correct 127 ms 116316 KB Output is correct
40 Correct 150 ms 116312 KB Output is correct
41 Correct 194 ms 116316 KB Output is correct
42 Correct 200 ms 116312 KB Output is correct
43 Correct 175 ms 116316 KB Output is correct
44 Correct 100 ms 116568 KB Output is correct
45 Correct 130 ms 116568 KB Output is correct
46 Correct 128 ms 116548 KB Output is correct
47 Correct 136 ms 116700 KB Output is correct
48 Correct 118 ms 116828 KB Output is correct
49 Correct 121 ms 116824 KB Output is correct
50 Correct 114 ms 117004 KB Output is correct
51 Correct 781 ms 116136 KB Output is correct
52 Execution timed out 2016 ms 87228 KB Time limit exceeded
53 Halted 0 ms 0 KB -