# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223363 | Minnakhmetov | Džumbus (COCI19_dzumbus) | C++14 | 185 ms | 19192 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;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const ll INF = 1e18;
const int N = 1005;
vector<int> g[N];
bool used[N];
ll dp[N][N][2], cost[N], dp2[N][2];
int sz[N];
void dfs(int node) {
used[node] = true;
for (int to : g[node]) {
if (!used[to]) {
dfs(to);
}
}
}
void dive(int node, int anc) {
sz[node] = 1;
for (int to : g[node]) {
if (to != anc) {
dive(to, node);
sz[node] += sz[to];
}
}
# | 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... |