oj.uz

Submission #670953

# Submission time Handle Problem Language Result Execution time Memory
670953 2022-12-11T13:42:32 Z ghostwriter Fireworks (APIO16_fireworks) C++17
26 / 100
 20 ms 7708 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int N = 3e5 + 5;
int n, m;
vpi adj[N];
namespace subtask1 {
	void solve() {
		vi a;
		EACH(i, adj[1]) a.pb(i.nd);
		sort(all(a));
		int med = a[sz(a) / 2];
		ll rs = 0;
		EACH(i, a) rs += abs(i - med);
		cout << rs;
	}
}
namespace subtask2 {
	const int oo = 1e9 + 5;
	const int N = 305;
	int d[N][N];
	void dfs(int u) {
		if (adj[u].empty()) { FOR(i, 1, 300) d[u][i] = oo; }
		EACH(j, adj[u]) {
			int v = j.st;
			dfs(v);
		}
		FRN(i, 301)
		EACH(j, adj[u]) {
			int v = j.st, w = j.nd, minn = oo;
			FRN(z, i + 1) minn = min(minn, abs(w - z) + d[v][i - z]);
			d[u][i] += minn;
		}
	}
	void solve() {
		dfs(1);
		int rs = oo;
		FRN(i, 301) rs = min(rs, d[1][i]);
		cout << rs;
	}
}
void input(int test_id) {
	cin >> n >> m;
	FOR(i, 2, n + m) {
		int p, c;
		cin >> p >> c;
		adj[p].pb({i, c});
	}
}
int dfs(int u) {
	int maxx = 0;
	EACH(j, adj[u]) {
		int v = j.st, w = j.nd;
		maxx = max(maxx, min(301, dfs(v) + w));
	}
	return maxx;
}
void solve(int test_id) {
	if (n == 1) {
		subtask1::solve();
		return;
	}
	if (n + m <= 300 && dfs(1) <= 300) {
		subtask2::solve();
		return;
	}
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 6 ms 7380 KB Output is correct
3 Correct 7 ms 7384 KB Output is correct
4 Correct 9 ms 7444 KB Output is correct
5 Correct 12 ms 7508 KB Output is correct
6 Correct 11 ms 7508 KB Output is correct
7 Correct 14 ms 7564 KB Output is correct
8 Correct 13 ms 7508 KB Output is correct
9 Correct 13 ms 7596 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 17 ms 7628 KB Output is correct
12 Correct 17 ms 7636 KB Output is correct
13 Correct 17 ms 7628 KB Output is correct
14 Correct 19 ms 7640 KB Output is correct
15 Correct 19 ms 7632 KB Output is correct
16 Correct 19 ms 7668 KB Output is correct
17 Correct 20 ms 7632 KB Output is correct
18 Correct 20 ms 7668 KB Output is correct
19 Correct 19 ms 7708 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 6 ms 7380 KB Output is correct
13 Correct 7 ms 7384 KB Output is correct
14 Correct 9 ms 7444 KB Output is correct
15 Correct 12 ms 7508 KB Output is correct
16 Correct 11 ms 7508 KB Output is correct
17 Correct 14 ms 7564 KB Output is correct
18 Correct 13 ms 7508 KB Output is correct
19 Correct 13 ms 7596 KB Output is correct
20 Correct 14 ms 7508 KB Output is correct
21 Correct 17 ms 7628 KB Output is correct
22 Correct 17 ms 7636 KB Output is correct
23 Correct 17 ms 7628 KB Output is correct
24 Correct 19 ms 7640 KB Output is correct
25 Correct 19 ms 7632 KB Output is correct
26 Correct 19 ms 7668 KB Output is correct
27 Correct 20 ms 7632 KB Output is correct
28 Correct 20 ms 7668 KB Output is correct
29 Correct 19 ms 7708 KB Output is correct
30 Incorrect 5 ms 7380 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 6 ms 7380 KB Output is correct
13 Correct 7 ms 7384 KB Output is correct
14 Correct 9 ms 7444 KB Output is correct
15 Correct 12 ms 7508 KB Output is correct
16 Correct 11 ms 7508 KB Output is correct
17 Correct 14 ms 7564 KB Output is correct
18 Correct 13 ms 7508 KB Output is correct
19 Correct 13 ms 7596 KB Output is correct
20 Correct 14 ms 7508 KB Output is correct
21 Correct 17 ms 7628 KB Output is correct
22 Correct 17 ms 7636 KB Output is correct
23 Correct 17 ms 7628 KB Output is correct
24 Correct 19 ms 7640 KB Output is correct
25 Correct 19 ms 7632 KB Output is correct
26 Correct 19 ms 7668 KB Output is correct
27 Correct 20 ms 7632 KB Output is correct
28 Correct 20 ms 7668 KB Output is correct
29 Correct 19 ms 7708 KB Output is correct
30 Incorrect 5 ms 7380 KB Output isn't correct
31 Halted 0 ms 0 KB -