oj.uz

Submission #261952

# Submission time Handle Problem Language Result Execution time Memory
261952 2020-08-12T08:25:05 Z Saboon Fireworks (APIO16_fireworks) C++14
19 / 100
 21 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 300 + 10;
const ll inf = 1e18;

vector<pair<int,int>> t[maxn];
ll dp[maxn][maxn];
int lo[maxn], r[maxn];

void dfs(int v){
	if (t[v].empty()){
		dp[v][0] = 0;
		for (int j = 1; j < maxn; j++)
			dp[v][j] = inf;
		return;
	}
	for (auto [u,c] : t[v]){
		dfs(u);
		for (int i = 0; i < maxn; i++){
			ll now = inf;
			for (int j = 0; j <= i; j++)
				now = min(now, dp[u][j] + abs(i-j-c));
			dp[v][i] += now;
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	for (int i = 2; i <= n+m; i++){
		int v, c;
		cin >> v >> c;
		t[v].push_back({i,c});
	}
	dfs(1);
	ll answer = inf;
	for (int i = 0; i < maxn; i++)
		answer = min(answer, dp[1][i]);
	cout << answer << endl;
}

Compilation message

fireworks.cpp: In function 'void dfs(int)':
fireworks.cpp:18:12: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
  for (auto [u,c] : t[v]){
            ^

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 8 ms 640 KB Output is correct
6 Correct 11 ms 640 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 12 ms 768 KB Output is correct
9 Correct 14 ms 768 KB Output is correct
10 Correct 14 ms 896 KB Output is correct
11 Correct 15 ms 896 KB Output is correct
12 Correct 17 ms 1024 KB Output is correct
13 Correct 19 ms 992 KB Output is correct
14 Correct 19 ms 1024 KB Output is correct
15 Correct 19 ms 1024 KB Output is correct
16 Correct 21 ms 1116 KB Output is correct
17 Correct 19 ms 1024 KB Output is correct
18 Correct 19 ms 1024 KB Output is correct
19 Correct 19 ms 1024 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -