# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336468 | parsabahrami | Džumbus (COCI19_dzumbus) | C++17 | 76 ms | 19308 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 1e3 + 10;
const ll INF = 1e18;
ll pd[2][N], dp[2][N][N], A[N], dp2[N]; int S[N], M[N], D[N], n, q, sum, m;
vector<int> adj[N];
void DFS(int v, int p = -1) {
M[v] = 1;
fill(dp[1][v], dp[1][v] + N, INF);
fill(dp[0][v], dp[0][v] + N, INF);
dp[0][v][0] = 0;
dp[1][v][1] = D[v];
S[v] = 1;
for (int u : adj[v]) {
if (u == p) continue;
DFS(u, v);
for (int i = 0; i <= S[v] + S[u]; i++) pd[0][i] = pd[1][i] = INF;
for (int i = 0; i <= S[v]; i++) {
for (int j = 0; j <= S[u]; j++) {
pd[0][i + j] = min(pd[0][i + j], dp[0][v][i] + dp[0][u][j]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |