oj.uz

Submission #248942

# Submission time Handle Problem Language Result Execution time Memory
248942 2020-07-13T18:30:01 Z patrikpavic2 Beads and wires (APIO14_beads) C++17
57 / 100
 678 ms 108144 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
 
#define X first
#define Y second
#define PB push_back
 
using namespace std;
using namespace __gnu_pbds;
 
typedef pair < int, int > pii;
typedef long long ll;
 
const int N = 2e5 + 500;
const int INF = 2e9;
 
vector < pii > v[N];
gp_hash_table < int, int > dp[3];
gp_hash_table < int, int > vr;
ll zbr[N];
vector < pair < int, int > > kand[N];
int n, jesam[N];
 
 
 
ll f(int x, int fl, int lst){
	if(dp[fl][x * (N - 37) + lst] != 0) 
		return dp[fl][x * (N - 37) + lst] - 1;
	//printf("x = %d fl = %d lst = %d\n", x, fl, lst);
	//char c; scanf("%c", &c);
	if(!jesam[x]){
		ll sm = 0;
		for(pii nxt : v[x]){
			if(nxt.X == lst) continue;
			ll opt = max(f(nxt.X, 0, x), f(nxt.X, 1, x) + (int)nxt.Y);
			sm += opt;
			kand[x].PB({f(nxt.X, 2, x) + nxt.Y - opt, nxt.X});
		}
		sort(kand[x].rbegin(), kand[x].rend());
		jesam[x] = (x == lst ? n + 1 : lst); zbr[x] = sm;
		ll dod = -INF;
		if((int)kand[x].size() >= 1)
			dod = kand[x][0].X;
		return (dp[fl][x * (N - 37) + lst] = sm + dod * (fl == 1) + 1) - 1;
	}
	if(jesam[x] == lst){
		ll dod = -INF;
		if((int)kand[x].size() >= 1)
			dod = kand[x][0].X;
		return (dp[fl][x * (N - 37) + lst] = zbr[x] + dod * (fl == 1) + 1) - 1;		
	}
	if(jesam[x] < n + 1){
		ll opt = max(f(jesam[x], 0, x), f(jesam[x], 1, x) + vr[x * (N - 37) + jesam[x]]);
		zbr[x] += opt;
		kand[x].PB({f(jesam[x], 2, x) + vr[x * (N - 37) + jesam[x]] - opt, jesam[x]});
		sort(kand[x].rbegin(), kand[x].rend());
		jesam[x] = n + 1;
	}
	ll sm = zbr[x] - (x == lst ? 0 : max(f(lst, 0, x), f(lst, 1, x) + vr[x * (N - 37) + lst]));
	ll dod = -INF;
	if((int)kand[x].size() >= 1)
		dod = kand[x][0].X;
	if((int)kand[x].size() >= 1 && kand[x][0].Y == lst){
		dod = -INF;
		if((int)kand[x].size() >= 2)
			dod = kand[x][1].X;
	}
	//printf("x = %d fl = %d lst = %d --> %intd + %intd\n", x, fl, lst, sm , dod * (fl == 1));
	return (dp[fl][x * (N - 37) + lst] = sm + dod * (fl == 1) + 1) - 1;		
}
 
 
int main(){
	scanf("%d", &n);
	for(int i = 1;i < n;i++){
		int x, y, z; scanf("%d%d%d", &x, &y, &z);
		v[x].PB({y, z}), v[y].PB({x, z});
		vr[x * (N - 37) + y] = z, vr[y * (N - 37) + x] = z;
	}
	ll sol = 0;
	for(int i = 1;i <= n;i++)
		sol = max(sol, f(i, 0, i));
	printf("%lld\n", sol);
	return 0;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
beads.cpp:80:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y, z; scanf("%d%d%d", &x, &y, &z);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9792 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 6 ms 9704 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9792 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 6 ms 9704 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct
13 Correct 6 ms 9796 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9856 KB Output is correct
17 Correct 6 ms 9856 KB Output is correct
18 Correct 6 ms 9856 KB Output is correct
19 Correct 6 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 6 ms 9856 KB Output is correct
22 Correct 6 ms 9856 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9792 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 6 ms 9704 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct
13 Correct 6 ms 9796 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9856 KB Output is correct
17 Correct 6 ms 9856 KB Output is correct
18 Correct 6 ms 9856 KB Output is correct
19 Correct 6 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 6 ms 9856 KB Output is correct
22 Correct 6 ms 9856 KB Output is correct
23 Correct 14 ms 12092 KB Output is correct
24 Correct 14 ms 12092 KB Output is correct
25 Correct 16 ms 12092 KB Output is correct
26 Correct 24 ms 14264 KB Output is correct
27 Correct 24 ms 14264 KB Output is correct
28 Correct 134 ms 14256 KB Output is correct
29 Correct 31 ms 14256 KB Output is correct
30 Correct 42 ms 14264 KB Output is correct
31 Correct 25 ms 14900 KB Output is correct

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9792 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 6 ms 9704 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct
13 Correct 6 ms 9796 KB Output is correct
14 Correct 6 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9856 KB Output is correct
17 Correct 6 ms 9856 KB Output is correct
18 Correct 6 ms 9856 KB Output is correct
19 Correct 6 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 6 ms 9856 KB Output is correct
22 Correct 6 ms 9856 KB Output is correct
23 Correct 14 ms 12092 KB Output is correct
24 Correct 14 ms 12092 KB Output is correct
25 Correct 16 ms 12092 KB Output is correct
26 Correct 24 ms 14264 KB Output is correct
27 Correct 24 ms 14264 KB Output is correct
28 Correct 134 ms 14256 KB Output is correct
29 Correct 31 ms 14256 KB Output is correct
30 Correct 42 ms 14264 KB Output is correct
31 Correct 25 ms 14900 KB Output is correct
32 Correct 124 ms 33824 KB Output is correct
33 Correct 125 ms 33824 KB Output is correct
34 Correct 138 ms 32456 KB Output is correct
35 Incorrect 678 ms 108144 KB Output isn't correct
36 Halted 0 ms 0 KB -