# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984756 | Muhammad_Aneeq | 사이버랜드 (APIO23_cyberland) | C++17 | 38 ms | 14684 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 "cyberland.h"
#include <vector>
#include <map>
#include <set>
#include <iostream>
using namespace std;
int const MAXN=1e5+10;
vector<pair<int,int>>nei[MAXN];
int val[MAXN];
bool vis[MAXN]={},ra[MAXN]={};
int h;
map<pair<int,int>,int>d;
void dfs(int x)
{
ra[x]=1;
vis[x]=1;
for (auto [i,j]:nei[x])
{
if (!vis[i]&&i!=h)
dfs(i);
}
}
vector<int>p;
int k;
double ans=1e15+10;
void dfs1(int x)
{
vis[x]=1;
p.push_back(x);
if (val[x]==0||x==0)
{
double su=0;
vector<int>va;
for (int i=p.size()-1;i>=0;i--)
{
if (val[p[i]]==2)
va.push_back(p[i]);
}
int x=max(0,int(va.size()-k));
bool w=0;
for (int i=p.size()-1;i>=1;i--)
{
if (va.size()&&p[i-1]==va[x])
w=1;
su+=d[{p[i],p[i-1]}];
if (w&&val[p[i-1]]==2)
su/=2.0;
}
ans=min(ans,su);
if (p.size())
p.pop_back();
return;
}
for (auto [i,j]:nei[x])
{
if (ra[i]&&!vis[i])
dfs1(i);
}
if (p.size())
p.pop_back();
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr)
{
h=H;
k=K;
ans=1e15+10;
d={};
p={};
for (int i=0;i<N;i++)
{
nei[i]={};
val[i]=arr[i];
vis[i]=0;
ra[i]=0;
}
for (int i=0;i<x.size();i++)
{
d[{x[i],y[i]}]=d[{y[i],x[i]}]=c[i];
nei[x[i]].push_back({y[i],c[i]});
nei[y[i]].push_back({x[i],c[i]});
}
dfs(0);
for (int i=0;i<N;i++)
vis[i]=0;
dfs1(h);
if (ans==1e15+10)
return -1;
return ans;
}
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... |
# | 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... |