oj.uz

답안 #1043416

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

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

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 142680 KB Output is correct
2 Correct 16 ms 142680 KB Output is correct
3 Correct 78 ms 146776 KB Output is correct
4 Correct 69 ms 146768 KB Output is correct
5 Correct 69 ms 146768 KB Output is correct
6 Correct 68 ms 146652 KB Output is correct
7 Correct 69 ms 146768 KB Output is correct
8 Correct 77 ms 146732 KB Output is correct
9 Correct 72 ms 147024 KB Output is correct
10 Correct 69 ms 146772 KB Output is correct
11 Correct 74 ms 147024 KB Output is correct
12 Correct 71 ms 148704 KB Output is correct
13 Correct 70 ms 149040 KB Output is correct
14 Correct 70 ms 148048 KB Output is correct
15 Correct 72 ms 148820 KB Output is correct
16 Correct 72 ms 149588 KB Output is correct
17 Correct 73 ms 149624 KB Output is correct
18 Correct 69 ms 150356 KB Output is correct
19 Correct 74 ms 155220 KB Output is correct
20 Correct 88 ms 154960 KB Output is correct
21 Correct 71 ms 154704 KB Output is correct
22 Correct 19 ms 142696 KB Output is correct
23 Correct 20 ms 142684 KB Output is correct
24 Correct 18 ms 142684 KB Output is correct
25 Correct 16 ms 142684 KB Output is correct
26 Correct 20 ms 142684 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 142684 KB Output is correct
2 Correct 18 ms 142680 KB Output is correct
3 Correct 18 ms 142680 KB Output is correct
4 Correct 18 ms 142684 KB Output is correct
5 Correct 192 ms 178528 KB Output is correct
6 Correct 197 ms 178512 KB Output is correct
7 Correct 203 ms 178732 KB Output is correct
8 Correct 187 ms 178712 KB Output is correct
9 Correct 195 ms 178528 KB Output is correct
10 Correct 168 ms 178584 KB Output is correct
11 Correct 164 ms 178768 KB Output is correct
12 Correct 171 ms 178512 KB Output is correct
13 Correct 153 ms 178516 KB Output is correct
14 Correct 147 ms 178620 KB Output is correct
15 Correct 199 ms 178772 KB Output is correct
16 Correct 218 ms 178604 KB Output is correct
17 Correct 216 ms 178580 KB Output is correct
18 Correct 149 ms 178848 KB Output is correct
19 Correct 174 ms 178768 KB Output is correct
20 Correct 164 ms 178864 KB Output is correct
21 Correct 169 ms 178772 KB Output is correct
22 Correct 162 ms 179284 KB Output is correct
23 Correct 166 ms 179120 KB Output is correct
24 Correct 160 ms 179120 KB Output is correct
25 Correct 506 ms 216416 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 142680 KB Output is correct
2 Correct 16 ms 142680 KB Output is correct
3 Correct 78 ms 146776 KB Output is correct
4 Correct 69 ms 146768 KB Output is correct
5 Correct 69 ms 146768 KB Output is correct
6 Correct 68 ms 146652 KB Output is correct
7 Correct 69 ms 146768 KB Output is correct
8 Correct 77 ms 146732 KB Output is correct
9 Correct 72 ms 147024 KB Output is correct
10 Correct 69 ms 146772 KB Output is correct
11 Correct 74 ms 147024 KB Output is correct
12 Correct 71 ms 148704 KB Output is correct
13 Correct 70 ms 149040 KB Output is correct
14 Correct 70 ms 148048 KB Output is correct
15 Correct 72 ms 148820 KB Output is correct
16 Correct 72 ms 149588 KB Output is correct
17 Correct 73 ms 149624 KB Output is correct
18 Correct 69 ms 150356 KB Output is correct
19 Correct 74 ms 155220 KB Output is correct
20 Correct 88 ms 154960 KB Output is correct
21 Correct 71 ms 154704 KB Output is correct
22 Correct 19 ms 142696 KB Output is correct
23 Correct 20 ms 142684 KB Output is correct
24 Correct 18 ms 142684 KB Output is correct
25 Correct 16 ms 142684 KB Output is correct
26 Correct 20 ms 142684 KB Output is correct
27 Correct 20 ms 142684 KB Output is correct
28 Correct 18 ms 142680 KB Output is correct
29 Correct 18 ms 142680 KB Output is correct
30 Correct 18 ms 142684 KB Output is correct
31 Correct 192 ms 178528 KB Output is correct
32 Correct 197 ms 178512 KB Output is correct
33 Correct 203 ms 178732 KB Output is correct
34 Correct 187 ms 178712 KB Output is correct
35 Correct 195 ms 178528 KB Output is correct
36 Correct 168 ms 178584 KB Output is correct
37 Correct 164 ms 178768 KB Output is correct
38 Correct 171 ms 178512 KB Output is correct
39 Correct 153 ms 178516 KB Output is correct
40 Correct 147 ms 178620 KB Output is correct
41 Correct 199 ms 178772 KB Output is correct
42 Correct 218 ms 178604 KB Output is correct
43 Correct 216 ms 178580 KB Output is correct
44 Correct 149 ms 178848 KB Output is correct
45 Correct 174 ms 178768 KB Output is correct
46 Correct 164 ms 178864 KB Output is correct
47 Correct 169 ms 178772 KB Output is correct
48 Correct 162 ms 179284 KB Output is correct
49 Correct 166 ms 179120 KB Output is correct
50 Correct 160 ms 179120 KB Output is correct
51 Correct 506 ms 216416 KB Output is correct
52 Execution timed out 2045 ms 111828 KB Time limit exceeded
53 Halted 0 ms 0 KB -