oj.uz

Submission #391442

# Submission time Handle Problem Language Result Execution time Memory
391442 2021-04-18T18:40:56 Z osaaateiasavtnl Beads and wires (APIO14_beads) C++14
100 / 100
 215 ms 37732 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
 
const int N = 2e5+7, INF = 1e18;
 
int n;
V <ii> g[N];
int dp[N][2][2]; // hor, up
void dfs(int u, int p, int UP) {
	int sum = 0, mx = 0;
	vi a, b, c;
	trav (e, g[u]) {
		int v = e.x;
		if (v != p) {
			dfs(v, u, e.y);
			sum += dp[v][0][1];
			a.app(e.y + dp[v][1][0] - dp[v][0][1]);
			b.app(e.y + dp[v][0][0] - dp[v][0][1]);
			c.app(dp[v][1][1] - dp[v][0][1]);
			ckmax(mx, dp[v][1][1] - dp[v][0][1]);
		}
	}

	dp[u][0][0] = sum;

	int sz = a.size();
	if (sz >= 2) {
		vi pref(sz + 1, -INF), suf(sz + 1, -INF);
		FOR (i, sz) {
			pref[i + 1] = max(pref[i], a[i]);
		}
		for (int i = sz - 1; i >= 0; --i) {
			suf[i] = max(suf[i + 1], a[i]);
		}
		FOR (i, sz) {
			ckmax(dp[u][1][0], sum + b[i] + max(pref[i], suf[i + 1]));
		}
	}

	if (sz) {
		trav (e, a) {
			ckmax(dp[u][1][1], sum + e + UP);	
		}
		trav (e, b) {
			ckmax(dp[u][0][1], sum + e + UP);	
		}
		ckmax(dp[u][1][0], sum + mx);
	}

	/*
	if (sz) {
		vi pref(sz + 1, -INF), suf(sz + 1, -INF);
		FOR (i, sz) {
			pref[i + 1] = max(pref[i], c[i]);
		}
		for (int i = sz - 1; i >= 0; --i) {
			suf[i] = max(suf[i + 1], c[i]);
		}
		FOR (i, sz) {
			ckmax(dp[u][1][1], sum + b[i] + max(pref[i], suf[i + 1]));
			if (u == 2 && sum + b[i] + max(pref[i], suf[i + 1]) == 26) {
				debug("tak");
				debug(c);
				debug(b);
				debug(i);
			}
		}
	}
	*/

	FOR (x, 2) {
		FOR (y, 2) {
			if (!x) {
				ckmax(dp[u][x + 1][y], dp[u][x][y]);
			}
			if (!y) {
				ckmax(dp[u][x][y + 1], dp[u][x][y]);
			}
		}
	}
}
 
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n;
    FOR (i, n - 1) {
    	int u, v, c;
    	cin >> u >> v >> c;
    	g[u].app(mp(v, c));
    	g[v].app(mp(u, c));
    }
    dfs(1, 1, 0);
    cout << dp[1][1][0] << endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4900 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5024 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5024 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4900 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5024 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5024 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 6 ms 5452 KB Output is correct
24 Correct 6 ms 5428 KB Output is correct
25 Correct 6 ms 5452 KB Output is correct
26 Correct 10 ms 5964 KB Output is correct
27 Correct 11 ms 5904 KB Output is correct
28 Correct 8 ms 6344 KB Output is correct
29 Correct 8 ms 6192 KB Output is correct
30 Correct 8 ms 6192 KB Output is correct
31 Correct 9 ms 6960 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4900 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5024 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 5028 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5024 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 6 ms 5452 KB Output is correct
24 Correct 6 ms 5428 KB Output is correct
25 Correct 6 ms 5452 KB Output is correct
26 Correct 10 ms 5964 KB Output is correct
27 Correct 11 ms 5904 KB Output is correct
28 Correct 8 ms 6344 KB Output is correct
29 Correct 8 ms 6192 KB Output is correct
30 Correct 8 ms 6192 KB Output is correct
31 Correct 9 ms 6960 KB Output is correct
32 Correct 40 ms 9892 KB Output is correct
33 Correct 37 ms 9904 KB Output is correct
34 Correct 37 ms 9800 KB Output is correct
35 Correct 211 ms 25000 KB Output is correct
36 Correct 215 ms 24996 KB Output is correct
37 Correct 214 ms 25072 KB Output is correct
38 Correct 145 ms 32600 KB Output is correct
39 Correct 141 ms 30152 KB Output is correct
40 Correct 146 ms 28832 KB Output is correct
41 Correct 208 ms 37732 KB Output is correct