oj.uz

Submission #633782

# Submission time Handle Problem Language Result Execution time Memory
633782 2022-08-23T08:39:25 Z NothingXD LOSTIKS (INOI20_lostiks) C++17
59 / 100
 2000 ms 196264 KB 
        #include<bits/stdc++.h>
        using namespace std;
         
        typedef long long ll;
        typedef long double ld;
        typedef unsigned long long ull;
        //typedef __uint128_t L;
        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
         
        void debug_out() { cerr << endl; }
         
        template <typename Head, typename... Tail>
        void debug_out(Head H, Tail... T) {
        	cerr << " " << H;
        	debug_out(T...);
        }
         
        #define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
        #define all(x) x.begin(), x.end()
        #define MP(x, y) make_pair(x, y)
        #define F first
        #define S second
         
        const int maxn = 1e6 + 10;
        const int maxm = 20;
        const int mask = (1 << 20);
        const int inf = 1e9;
         
        int n, m, S, T, edge[maxm][3], comp[maxn], cnt, sz, par[mask][maxm+1], h[maxm+1][maxn], dp[mask][maxm+1];
        vector<int> g[maxn], G[maxm+1];
        bool vis[maxn];
         
        int first[maxn], to[maxn << 1], nxt[maxn << 1], ecnt;
         
        void add(int u, int v){
        	nxt[++ecnt] = first[u];
        	to[ecnt] = v;
        	first[u] = ecnt;
        }
         
        void dfs(int v, int *h, int p = -1){
        	for (int i = first[v]; i; i = nxt[i]){
        		int u = to[i];
        		if (u != p){
        			h[u] = h[v] + 1;
        			dfs(u, h, v);
        		}
        	}
        }
         
        void getcomp(int v, int p = -1){
        	vis[v] = true;
        	comp[v] = cnt;
        	for (auto u: g[v]) if (u != p) getcomp(u, v);
        }
         
        void getpar(int v, int *par, int p = -1){
        	vis[v] = true;
        	par[v] = sz;
        	for (auto u : G[v]) if (u != p) getpar(u, par, v);
        }
         
        int main(){
        	//ios_base::sync_with_stdio(false); cin.tie(0);
         
        	scanf("%d%d%d", &n, &S, &T);
        	for (int i = 1; i < n; i++){
        		int u, v, w; scanf("%d%d%d", &u, &v, &w);
        		add(u, v);
        		add(v, u);
        		if (w == 0){
        			g[u].push_back(v);
        			g[v].push_back(u);
        		}
        		else{
        			edge[m][0] = u;
        			edge[m][1] = v;
        			edge[m][2] = w;
        			m++;
        		}
        	}
         
        	dfs(S, h[m]);
         
        	for (int i = 0; i < m; i++){
        		if (h[m][edge[i][0]] > h[m][edge[i][1]]) swap(edge[i][0], edge[i][1]);
        		dfs(edge[i][0], h[i]);
        	}
         
        	assert(m <= 20);
         
        	for (int i = 1; i <= n; i++){
        		if (!vis[i]){
        			getcomp(i);
        			cnt++;
        		}
        	}
         
        	for (int i = 0; i < (1 << m); i++){
        		for (int j = 0; j < m+1; j++){
        			G[j].clear();
        			vis[j] = false;
        		}
        		for (int j = 0; j < m; j++){
        			if (!((i >> j) & 1)){
        				G[comp[edge[j][0]]].push_back(comp[edge[j][1]]);
        				G[comp[edge[j][1]]].push_back(comp[edge[j][0]]);
        			}
        		}
        		sz = 0;
        		for (int j = 0; j < m+1; j++){
        			if (!vis[j]){
        				sz++;
        				getpar(j, par[i]);
        			}
        		}
        	}
         
        	for (int i = 0; i <= m; i++){
        		dp[0][i] = h[i][T];
        	}
         
        	for (int msk = 1; msk < (1 << m); msk++){
        		for (int i = 0; i <= m; i++){
        			int v = (i == m? S: edge[i][0]);
        			dp[msk][i] = inf;
        			if (par[msk][comp[T]] == par[msk][comp[v]]){
        				dp[msk][i] = h[i][T];
        				continue;
        			}
        			for (int tmp = msk; tmp; tmp ^= tmp & -tmp){
        				int j = __builtin_ctz(tmp);
        				if (par[msk][comp[edge[j][2]]] == par[msk][comp[v]] && par[msk][comp[edge[j][0]]] == par[msk][comp[v]]){
        					dp[msk][i] = min(dp[msk][i], dp[msk^(1 << j)][j] + h[i][edge[j][2]] + h[j][edge[j][2]]);
        				}
        			}
        		}
        	}
         
        	printf("%d\n", (dp[(1 << m) - 1][m] == inf? -1: dp[(1 << m) - 1][m]));
         
         
         
        	return 0;
        }

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:67:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |          scanf("%d%d%d", &n, &S, &T);
      |          ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:69:29: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |           int u, v, w; scanf("%d%d%d", &u, &v, &w);
      |                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23876 KB Output is correct
3 Correct 102 ms 32856 KB Output is correct
4 Correct 84 ms 32816 KB Output is correct
5 Correct 81 ms 32896 KB Output is correct
6 Correct 81 ms 32864 KB Output is correct
7 Correct 103 ms 32896 KB Output is correct
8 Correct 89 ms 32872 KB Output is correct
9 Correct 83 ms 33268 KB Output is correct
10 Correct 80 ms 32856 KB Output is correct
11 Correct 78 ms 32932 KB Output is correct
12 Correct 73 ms 34856 KB Output is correct
13 Correct 70 ms 35144 KB Output is correct
14 Correct 90 ms 34764 KB Output is correct
15 Correct 73 ms 35144 KB Output is correct
16 Correct 71 ms 35712 KB Output is correct
17 Correct 71 ms 35660 KB Output is correct
18 Correct 77 ms 36208 KB Output is correct
19 Correct 83 ms 40280 KB Output is correct
20 Correct 93 ms 40100 KB Output is correct
21 Correct 75 ms 39984 KB Output is correct
22 Correct 13 ms 23892 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23896 KB Output is correct
25 Correct 12 ms 23892 KB Output is correct
26 Correct 16 ms 23892 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23768 KB Output is correct
2 Correct 14 ms 23792 KB Output is correct
3 Correct 13 ms 24100 KB Output is correct
4 Correct 14 ms 24116 KB Output is correct
5 Correct 714 ms 111132 KB Output is correct
6 Correct 685 ms 111132 KB Output is correct
7 Correct 733 ms 111056 KB Output is correct
8 Correct 672 ms 111088 KB Output is correct
9 Correct 708 ms 111096 KB Output is correct
10 Correct 541 ms 111044 KB Output is correct
11 Correct 533 ms 111152 KB Output is correct
12 Correct 554 ms 111076 KB Output is correct
13 Correct 528 ms 111048 KB Output is correct
14 Correct 533 ms 111260 KB Output is correct
15 Correct 770 ms 111096 KB Output is correct
16 Correct 663 ms 111180 KB Output is correct
17 Correct 703 ms 111116 KB Output is correct
18 Correct 548 ms 111324 KB Output is correct
19 Correct 556 ms 111356 KB Output is correct
20 Correct 556 ms 111188 KB Output is correct
21 Correct 525 ms 111296 KB Output is correct
22 Correct 517 ms 111732 KB Output is correct
23 Correct 544 ms 111564 KB Output is correct
24 Correct 550 ms 111592 KB Output is correct
25 Correct 1056 ms 196264 KB Output is correct

Subtask #3
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23876 KB Output is correct
3 Correct 102 ms 32856 KB Output is correct
4 Correct 84 ms 32816 KB Output is correct
5 Correct 81 ms 32896 KB Output is correct
6 Correct 81 ms 32864 KB Output is correct
7 Correct 103 ms 32896 KB Output is correct
8 Correct 89 ms 32872 KB Output is correct
9 Correct 83 ms 33268 KB Output is correct
10 Correct 80 ms 32856 KB Output is correct
11 Correct 78 ms 32932 KB Output is correct
12 Correct 73 ms 34856 KB Output is correct
13 Correct 70 ms 35144 KB Output is correct
14 Correct 90 ms 34764 KB Output is correct
15 Correct 73 ms 35144 KB Output is correct
16 Correct 71 ms 35712 KB Output is correct
17 Correct 71 ms 35660 KB Output is correct
18 Correct 77 ms 36208 KB Output is correct
19 Correct 83 ms 40280 KB Output is correct
20 Correct 93 ms 40100 KB Output is correct
21 Correct 75 ms 39984 KB Output is correct
22 Correct 13 ms 23892 KB Output is correct
23 Correct 13 ms 23892 KB Output is correct
24 Correct 13 ms 23896 KB Output is correct
25 Correct 12 ms 23892 KB Output is correct
26 Correct 16 ms 23892 KB Output is correct
27 Correct 14 ms 23768 KB Output is correct
28 Correct 14 ms 23792 KB Output is correct
29 Correct 13 ms 24100 KB Output is correct
30 Correct 14 ms 24116 KB Output is correct
31 Correct 714 ms 111132 KB Output is correct
32 Correct 685 ms 111132 KB Output is correct
33 Correct 733 ms 111056 KB Output is correct
34 Correct 672 ms 111088 KB Output is correct
35 Correct 708 ms 111096 KB Output is correct
36 Correct 541 ms 111044 KB Output is correct
37 Correct 533 ms 111152 KB Output is correct
38 Correct 554 ms 111076 KB Output is correct
39 Correct 528 ms 111048 KB Output is correct
40 Correct 533 ms 111260 KB Output is correct
41 Correct 770 ms 111096 KB Output is correct
42 Correct 663 ms 111180 KB Output is correct
43 Correct 703 ms 111116 KB Output is correct
44 Correct 548 ms 111324 KB Output is correct
45 Correct 556 ms 111356 KB Output is correct
46 Correct 556 ms 111188 KB Output is correct
47 Correct 525 ms 111296 KB Output is correct
48 Correct 517 ms 111732 KB Output is correct
49 Correct 544 ms 111564 KB Output is correct
50 Correct 550 ms 111592 KB Output is correct
51 Correct 1056 ms 196264 KB Output is correct
52 Execution timed out 2053 ms 121504 KB Time limit exceeded
53 Halted 0 ms 0 KB -