oj.uz

답안 #792818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792818 2023-07-25T09:03:34 Z IvanJ Fireworks (APIO16_fireworks) C++17
7 / 100
 5 ms 7380 KB 
#include<bits/stdc++.h>

#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 3e5 + 5;

struct Data {
	int idx;
	ll lo, hi, ans;
};

int n, m;
ll w[maxn];
ll depth[maxn];
Data dp[maxn];
vector<pair<int, ll>> adj[maxn];

void dfs(int x) {
	for(auto p : adj[x]) 
		depth[p.x] = p.y + depth[x], w[p.x] = p.y, dfs(p.x);
}

Data solve(int x) {
	if(adj[x].size() == 0)
		return dp[x] = {x, depth[x], depth[x], 0};
	
	ll sum = 0;
	vector<Data> ch;
	for(auto p : adj[x]) 
		ch.pb(solve(p.x)), sum += ch.back().ans;
	
	set<ll> vals;
	for(Data D : ch) 
		vals.insert(D.lo), vals.insert(D.hi);
	
	vector<ll> v;
	ll ans = 1e18;
	for(ll val : vals) {
		ll sol = 0;
		for(Data D : ch) {
			if(D.lo <= val && val <= D.hi) continue;
			if(val > D.hi) sol += val - D.hi;
			else {
				if(D.lo - val > w[D.idx]) {sol = 1e18;break;}
				else sol += D.lo - val;
			} 
		}
		if(sol < ans) v.clear(), ans = sol;
		if(sol == ans) v.pb(val);
	} 
	
	Data ret;
	ret.idx = x;
	ret.ans = ans + sum;
	ret.lo = v[0];
	ret.hi = v.back();
	//cout << x + 1 << " -> " << ret.lo << " " << ret.hi << " " << ret.ans << "\n";
	return dp[x] = ret;
}

int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1;i < n + m;i++) {
		int p, c;
		scanf("%d%d", &p, &c);
		p--;
		adj[p].pb({i, c});
	}
	dfs(0);
	Data ans = solve(0);
	printf("%lld\n", ans.ans);
	return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
fireworks.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   scanf("%d%d", &p, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7360 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Incorrect 3 ms 7380 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7360 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Incorrect 3 ms 7380 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7360 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Incorrect 3 ms 7380 KB Output isn't correct
14 Halted 0 ms 0 KB -