# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253407 | super_j6 | Museum (CEOI17_museum) | C++14 | 3098 ms | 784376 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 <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int inf = 0x3f3f3f3f;
const int mxn = 10001;
int n, k, x;
int dp[mxn][mxn][2];
vector<pi> g[mxn];
void dfs(int c, int p){
memset(dp[c], inf, sizeof(dp[c]));
dp[c][1][0] = dp[c][1][1] = 0;
for(pi i : g[c]){
if(i.f == p) continue;
dfs(i.f, c);
for(int j = k; ~j; j--){
int ret[2] = {inf, inf};
for(int l = 0; l <= j; l++)
for(int p1 = 0; p1 < 2; p1++)
for(int p2 = 0; p2 < 2 - p1; p2++){
# | 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... |