# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128447 | 12345678 | Džumbus (COCI19_dzumbus) | C++20 | 1096 ms | 16192 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e3+5;
ll n, m, u, v, vl[nx], q, vs[nx], dp1[nx][nx], dp2[nx][nx], mx, x;
vector<ll> d[nx];
vector<pair<ll, ll>> ans;
void dfsbuild(int u, int p)
{
vs[u]=1;
for (auto v:d[u]) if (v!=p) dfsbuild(v, u);
}
void show(int idx)
{
cout<<"show "<<idx<<'\n';
cout<<"idx dp1 : ";
for (int i=0; i<=n; i++) cout<<(dp1[idx][i]==1e18?-1:dp1[idx][i])<<' ';
cout<<'\n';
cout<<"idx dp2 : ";
for (int i=0; i<=n; i++) cout<<(dp2[idx][i]==1e18?-1:dp2[idx][i])<<' ';
cout<<'\n';
}
void dfs(int u, int p)
# | 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... |