oj.uz

Submission #45165

# Submission time Handle Problem Language Result Execution time Memory
45165 2018-04-11T15:12:37 Z erdemkiraz Fireworks (APIO16_fireworks) C++11
19 / 100
 45 ms 1004 KB 
#include <bits/stdc++.h>

using namespace std;

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

const int N = 300 + 5;

int n, m;
vector < ii > v[N];
int dp[N][N], dp2[N];

void dfs(int x) {
	for(auto u : v[x])
		dfs(u.first);
	if(x > n) {
		for(int i = 1; i < N; i++)
			dp[x][i] = 1e9;
		return;  
	}
	for(auto u : v[x]) {
		for(int i = 0; i < N; i++)
			dp2[i] = 1e9;
		for(int i = 0; i < N; i++)
			for(int j = -u.second; j < N - u.second - i; j++)
				dp2[i + j + u.second] = min(dp2[i + j + u.second], dp[u.first][i] + abs(j));
		for(int i = 0; i < N; i++)
			dp[x][i] += dp2[i];
	}
}

int main() {

	scanf("%d %d", &n, &m);

	for(int i = 2; i <= n + m; i++) {
		int x, c;
		scanf("%d %d", &x, &c);
		v[x].push_back({i, c});
	}

	for(int i = n + 1; i <= n + m; i++) {
		for(int j = 1; j < N; j++)
			dp[i][j] = 1e9;
	}

	for(int x = n; x >= 1; x--) {
		for(auto u : v[x]) {
			for(int i = 0; i < N; i++)
				dp2[i] = 1e9;
			for(int i = 0; i < N; i++)
				for(int j = -u.second; j < N - u.second - i; j++)
					dp2[i + j + u.second] = min(dp2[i + j + u.second], dp[u.first][i] + abs(j));
			for(int i = 0; i < N; i++)
				dp[x][i] += dp2[i];
		}
	}

	int res = 1e9;

	for(int i = 0; i < N; i++) {
		res = min(res, dp[1][i]);
	}

	printf("%d\n", res);

    return 0;

}

Compilation message

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

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 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 3 ms 376 KB Output is correct
2 Correct 5 ms 412 KB Output is correct
3 Correct 7 ms 616 KB Output is correct
4 Correct 16 ms 692 KB Output is correct
5 Correct 13 ms 836 KB Output is correct
6 Correct 14 ms 836 KB Output is correct
7 Correct 14 ms 836 KB Output is correct
8 Correct 18 ms 836 KB Output is correct
9 Correct 29 ms 836 KB Output is correct
10 Correct 24 ms 876 KB Output is correct
11 Correct 21 ms 1004 KB Output is correct
12 Correct 26 ms 1004 KB Output is correct
13 Correct 25 ms 1004 KB Output is correct
14 Correct 25 ms 1004 KB Output is correct
15 Correct 27 ms 1004 KB Output is correct
16 Correct 26 ms 1004 KB Output is correct
17 Correct 45 ms 1004 KB Output is correct
18 Correct 26 ms 1004 KB Output is correct
19 Correct 28 ms 1004 KB Output is correct

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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