oj.uz

Submission #248957

# Submission time Handle Problem Language Result Execution time Memory
248957 2020-07-13T18:51:51 Z patrikpavic2 Beads and wires (APIO14_beads) C++17
57 / 100
 262 ms 34672 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <unordered_map>
 
#define X first
#define Y second
#define PB push_back
 
using namespace std;
 
typedef pair < int, int > pii;
typedef long long ll;
 
const int N = 2e5 + 500;
const ll INF = 1e15;
 
vector < pii > v[N];
unordered_map < ll, ll > dp[2];
unordered_map < ll, ll > vr;
ll zbr[N];
vector < pair < ll, int > > kand[N];
int n, jesam[N];
 
 
 
ll f(int x, int fl, int lst){
	if(dp[fl][(ll)x * N + lst] != 0) 
		return dp[fl][(ll)x * N + 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) + (ll)nxt.Y);
			sm += opt;
			kand[x].PB({f(nxt.X, 0, x) + nxt.Y - opt, nxt.X});
		}
		kand[x].PB({-INF, -1}); 
		kand[x].PB({-INF, -1}); 
		sort(kand[x].rbegin(), kand[x].rend());
		jesam[x] = (x == lst ? n + 1 : lst); zbr[x] = sm;
		return (dp[fl][(ll)x * N + lst] = sm + kand[x][0].X * (fl == 1) + 1) - 1;
	}
	if(jesam[x] == lst){
		return (dp[fl][(ll)x * N + lst] = zbr[x] + kand[x][0].X * (fl == 1) + 1) - 1;		
	}
	if(jesam[x] < n + 1){
		ll opt = max(f(jesam[x], 0, x), f(jesam[x], 1, x) + vr[(ll)x * N + jesam[x]]);
		zbr[x] += opt;
		kand[x].PB({f(jesam[x], 0, x) + vr[(ll)x * N + 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[(ll)x * N + lst]));
	ll dod = kand[x][0].X;
	if(kand[x][0].Y == lst)
		dod = kand[x][1].X;
	//printf("x = %d fl = %d lst = %d --> %lld + %lld\n", x, fl, lst, sm , dod * (fl == 1));
	return (dp[fl][(ll)x * N + 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[(ll)x * N + y] = z, vr[y * N + 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:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
beads.cpp:69: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 9800 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 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 9728 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 9800 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 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 9728 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 9728 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 7 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 7 ms 9856 KB Output is correct
22 Correct 9 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 9800 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 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 9728 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 9728 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 7 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 7 ms 9856 KB Output is correct
22 Correct 9 ms 9856 KB Output is correct
23 Correct 17 ms 12160 KB Output is correct
24 Correct 19 ms 12032 KB Output is correct
25 Correct 18 ms 12160 KB Output is correct
26 Correct 30 ms 14456 KB Output is correct
27 Correct 30 ms 14504 KB Output is correct
28 Correct 28 ms 14508 KB Output is correct
29 Correct 30 ms 14504 KB Output is correct
30 Correct 31 ms 14504 KB Output is correct
31 Correct 30 ms 15096 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 9800 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 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 9728 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 9728 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 7 ms 9856 KB Output is correct
20 Correct 6 ms 9856 KB Output is correct
21 Correct 7 ms 9856 KB Output is correct
22 Correct 9 ms 9856 KB Output is correct
23 Correct 17 ms 12160 KB Output is correct
24 Correct 19 ms 12032 KB Output is correct
25 Correct 18 ms 12160 KB Output is correct
26 Correct 30 ms 14456 KB Output is correct
27 Correct 30 ms 14504 KB Output is correct
28 Correct 28 ms 14508 KB Output is correct
29 Correct 30 ms 14504 KB Output is correct
30 Correct 31 ms 14504 KB Output is correct
31 Correct 30 ms 15096 KB Output is correct
32 Incorrect 262 ms 34672 KB Output isn't correct
33 Halted 0 ms 0 KB -