oj.uz

답안 #1043629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043629 2024-08-04T12:25:29 Z javotaz LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 132948 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 = 1e9 + 7;
vector<pii> g[N];
int n, s, t, par[N], dp[(1 << M) + 4][M], p[N], kd[N], pd[N], e[N], dis[2 * M + 2][2 * M + 2];
char l[N], r[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}, dis[rt][p[u]] = h;
	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, 63, sizeof dp);
}

bool check(int v, int u, int x) {
	return ((f[l[v]][r[u]].S | x) == x) && ((f[r[u]][l[u]].S | x) == x);
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ip(), solve();
	int c = d.size();
	int ans = inf;
	for (int i = 0; i < c; i++)
		l[i] = p[par[d[i]]], r[i] = p[kd[d[i]]];
	for (int mask = 1; mask < (1 << c); ++mask) 
		for (int i = 0; i < c; ++i) 
			if ((mask >> i) & 1) {
				int x = (mask ^ (1 << i));
				if (!x) {
					if ((f[p[s]][r[i]].S | x) == x && (f[r[i]][l[i]].S | x) == x)
						dp[mask][i] = f[p[s]][r[i]].F + f[r[i]][l[i]].F;
				}
				else {
					int u = __builtin_ctz(x), y = inf;
					auto &s = dis[r[i]];
					if (check(u, i, x)) {
						int z = x;
						char j;
						for (; z; z ^= z & -z)
							y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
					}
					dp[mask][i] = y + s[l[i]];
				}
				if ((f[l[i]][p[t]].S | mask) == mask)
					ans = min(ans, dp[mask][i] + f[l[i]][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 '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: In function 'bool check(int, int, int)':
Main.cpp:71:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   71 |  return ((f[l[v]][r[u]].S | x) == x) && ((f[r[u]][l[u]].S | x) == x);
      |             ~~~^
Main.cpp:71:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   71 |  return ((f[l[v]][r[u]].S | x) == x) && ((f[r[u]][l[u]].S | x) == x);
      |                   ~~~^
Main.cpp:71:48: warning: array subscript has type 'char' [-Wchar-subscripts]
   71 |  return ((f[l[v]][r[u]].S | x) == x) && ((f[r[u]][l[u]].S | x) == x);
      |                                             ~~~^
Main.cpp:71:54: warning: array subscript has type 'char' [-Wchar-subscripts]
   71 |  return ((f[l[v]][r[u]].S | x) == x) && ((f[r[u]][l[u]].S | x) == x);
      |                                                   ~~~^
Main.cpp: In function 'int32_t main()':
Main.cpp:86:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |      if ((f[p[s]][r[i]].S | x) == x && (f[r[i]][l[i]].S | x) == x)
      |                   ~~~^
Main.cpp:86:46: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |      if ((f[p[s]][r[i]].S | x) == x && (f[r[i]][l[i]].S | x) == x)
      |                                           ~~~^
Main.cpp:86:52: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |      if ((f[p[s]][r[i]].S | x) == x && (f[r[i]][l[i]].S | x) == x)
      |                                                 ~~~^
Main.cpp:87:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   87 |       dp[mask][i] = f[p[s]][r[i]].F + f[r[i]][l[i]].F;
      |                             ~~~^
Main.cpp:87:44: warning: array subscript has type 'char' [-Wchar-subscripts]
   87 |       dp[mask][i] = f[p[s]][r[i]].F + f[r[i]][l[i]].F;
      |                                         ~~~^
Main.cpp:87:50: warning: array subscript has type 'char' [-Wchar-subscripts]
   87 |       dp[mask][i] = f[p[s]][r[i]].F + f[r[i]][l[i]].F;
      |                                               ~~~^
Main.cpp:91:23: warning: array subscript has type 'char' [-Wchar-subscripts]
   91 |      auto &s = dis[r[i]];
      |                    ~~~^
Main.cpp:96:24: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                      ~~^~~~~~~~~~~~~~~~~~
Main.cpp:96:42: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                    ~~~~~~~~~~~~~~~~~~~~~~^
Main.cpp:96:53: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                                                     ^
Main.cpp:96:66: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                                                                  ^
Main.cpp:96:67: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                                                                ~~~^
Main.cpp:96:78: warning: array subscript has type 'char' [-Wchar-subscripts]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                                                                              ^
Main.cpp:96:24: warning: operation on 'j' may be undefined [-Wsequence-point]
   96 |        y = ((y < s[l[j = __builtin_ctz(z)]] + dp[x][j])? y : s[l[j]] + dp[x][j]);
      |                      ~~^~~~~~~~~~~~~~~~~~
Main.cpp:98:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   98 |      dp[mask][i] = y + s[l[i]];
      |                          ~~~^
Main.cpp:100:15: warning: array subscript has type 'char' [-Wchar-subscripts]
  100 |     if ((f[l[i]][p[t]].S | mask) == mask)
      |            ~~~^
Main.cpp:101:40: warning: array subscript has type 'char' [-Wchar-subscripts]
  101 |      ans = min(ans, dp[mask][i] + f[l[i]][p[t]].F);
      |                                     ~~~^

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 118104 KB Output is correct
2 Correct 14 ms 118108 KB Output is correct
3 Correct 66 ms 124496 KB Output is correct
4 Correct 75 ms 124496 KB Output is correct
5 Correct 67 ms 124500 KB Output is correct
6 Correct 64 ms 124496 KB Output is correct
7 Correct 63 ms 124496 KB Output is correct
8 Correct 64 ms 124496 KB Output is correct
9 Correct 65 ms 124756 KB Output is correct
10 Correct 65 ms 124492 KB Output is correct
11 Correct 67 ms 124500 KB Output is correct
12 Correct 66 ms 126608 KB Output is correct
13 Correct 71 ms 127572 KB Output is correct
14 Correct 66 ms 126292 KB Output is correct
15 Correct 66 ms 126548 KB Output is correct
16 Correct 69 ms 127824 KB Output is correct
17 Correct 83 ms 127824 KB Output is correct
18 Correct 63 ms 128340 KB Output is correct
19 Correct 72 ms 132948 KB Output is correct
20 Correct 68 ms 132936 KB Output is correct
21 Correct 71 ms 132944 KB Output is correct
22 Correct 13 ms 118108 KB Output is correct
23 Correct 15 ms 118108 KB Output is correct
24 Correct 13 ms 118024 KB Output is correct
25 Correct 15 ms 118104 KB Output is correct
26 Correct 13 ms 118012 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 118108 KB Output is correct
2 Correct 14 ms 118080 KB Output is correct
3 Correct 14 ms 118108 KB Output is correct
4 Correct 14 ms 118140 KB Output is correct
5 Correct 65 ms 120468 KB Output is correct
6 Correct 60 ms 120412 KB Output is correct
7 Correct 63 ms 120412 KB Output is correct
8 Correct 67 ms 120408 KB Output is correct
9 Correct 62 ms 120408 KB Output is correct
10 Correct 67 ms 120412 KB Output is correct
11 Correct 57 ms 120408 KB Output is correct
12 Correct 57 ms 120412 KB Output is correct
13 Correct 56 ms 120408 KB Output is correct
14 Correct 58 ms 120412 KB Output is correct
15 Correct 65 ms 120400 KB Output is correct
16 Correct 67 ms 120408 KB Output is correct
17 Correct 65 ms 120412 KB Output is correct
18 Correct 59 ms 120664 KB Output is correct
19 Correct 58 ms 120668 KB Output is correct
20 Correct 57 ms 120668 KB Output is correct
21 Correct 64 ms 120668 KB Output is correct
22 Correct 58 ms 120924 KB Output is correct
23 Correct 60 ms 120924 KB Output is correct
24 Correct 60 ms 120924 KB Output is correct
25 Correct 192 ms 118104 KB Output is correct

Subtask #3
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 118104 KB Output is correct
2 Correct 14 ms 118108 KB Output is correct
3 Correct 66 ms 124496 KB Output is correct
4 Correct 75 ms 124496 KB Output is correct
5 Correct 67 ms 124500 KB Output is correct
6 Correct 64 ms 124496 KB Output is correct
7 Correct 63 ms 124496 KB Output is correct
8 Correct 64 ms 124496 KB Output is correct
9 Correct 65 ms 124756 KB Output is correct
10 Correct 65 ms 124492 KB Output is correct
11 Correct 67 ms 124500 KB Output is correct
12 Correct 66 ms 126608 KB Output is correct
13 Correct 71 ms 127572 KB Output is correct
14 Correct 66 ms 126292 KB Output is correct
15 Correct 66 ms 126548 KB Output is correct
16 Correct 69 ms 127824 KB Output is correct
17 Correct 83 ms 127824 KB Output is correct
18 Correct 63 ms 128340 KB Output is correct
19 Correct 72 ms 132948 KB Output is correct
20 Correct 68 ms 132936 KB Output is correct
21 Correct 71 ms 132944 KB Output is correct
22 Correct 13 ms 118108 KB Output is correct
23 Correct 15 ms 118108 KB Output is correct
24 Correct 13 ms 118024 KB Output is correct
25 Correct 15 ms 118104 KB Output is correct
26 Correct 13 ms 118012 KB Output is correct
27 Correct 14 ms 118108 KB Output is correct
28 Correct 14 ms 118080 KB Output is correct
29 Correct 14 ms 118108 KB Output is correct
30 Correct 14 ms 118140 KB Output is correct
31 Correct 65 ms 120468 KB Output is correct
32 Correct 60 ms 120412 KB Output is correct
33 Correct 63 ms 120412 KB Output is correct
34 Correct 67 ms 120408 KB Output is correct
35 Correct 62 ms 120408 KB Output is correct
36 Correct 67 ms 120412 KB Output is correct
37 Correct 57 ms 120408 KB Output is correct
38 Correct 57 ms 120412 KB Output is correct
39 Correct 56 ms 120408 KB Output is correct
40 Correct 58 ms 120412 KB Output is correct
41 Correct 65 ms 120400 KB Output is correct
42 Correct 67 ms 120408 KB Output is correct
43 Correct 65 ms 120412 KB Output is correct
44 Correct 59 ms 120664 KB Output is correct
45 Correct 58 ms 120668 KB Output is correct
46 Correct 57 ms 120668 KB Output is correct
47 Correct 64 ms 120668 KB Output is correct
48 Correct 58 ms 120924 KB Output is correct
49 Correct 60 ms 120924 KB Output is correct
50 Correct 60 ms 120924 KB Output is correct
51 Correct 192 ms 118104 KB Output is correct
52 Execution timed out 2085 ms 91024 KB Time limit exceeded
53 Halted 0 ms 0 KB -