| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 578558 | andrei_boaca | Chase (CEOI17_chase) | C++14 | 574 ms | 263236 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 ll;
int need=2;
ll n,v,p[100005],par[100005],dp[100005][105];
vector<ll> muchii[100005];
ll ans=0,s[100005];
ll MAXROOT=1;
bool use[100005];
ll max1[100005][105],max2[100005][105];
void dfs(int nod)
{
for(int i=1;i<=v;i++)
dp[nod][i]=0;
ll suma=0;
int cnt=0;
for(int i:muchii[nod])
if(i!=par[nod])
{
suma+=p[i];
par[i]=nod;
cnt++;
dfs(i);
for(int j=1;j<=v;j++)
{
if(dp[i][j]>max1[nod][j])
{
max2[nod][j]=max1[nod][j];
max1[nod][j]=dp[i][j];
| # | 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... | ||||