oj.uz

답안 #45152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45152 2018-04-11T14:24:24 Z erdemkiraz Fireworks (APIO16_fireworks) C++11
19 / 100
 76 ms 1124 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 = -N; j < N; j++)
				if(u.second + j >= 0 and i + j + u.second < N)
					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});
	}

	dfs(1);

	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:36: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:40: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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 356 KB Output is correct
2 Correct 11 ms 432 KB Output is correct
3 Correct 17 ms 508 KB Output is correct
4 Correct 24 ms 652 KB Output is correct
5 Correct 30 ms 776 KB Output is correct
6 Correct 34 ms 776 KB Output is correct
7 Correct 39 ms 832 KB Output is correct
8 Correct 45 ms 832 KB Output is correct
9 Correct 48 ms 832 KB Output is correct
10 Correct 53 ms 868 KB Output is correct
11 Correct 60 ms 880 KB Output is correct
12 Correct 64 ms 880 KB Output is correct
13 Correct 68 ms 928 KB Output is correct
14 Correct 73 ms 976 KB Output is correct
15 Correct 74 ms 1004 KB Output is correct
16 Correct 76 ms 1124 KB Output is correct
17 Correct 76 ms 1124 KB Output is correct
18 Correct 75 ms 1124 KB Output is correct
19 Correct 75 ms 1124 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 252 KB Output isn't correct
2 Halted 0 ms 0 KB -