Submission #984732

#	Time	Username	Problem	Language	Result	Execution time	Memory
984732		Faisal_Saqib	사이버랜드 (APIO23_cyberland)	C++17	8 / 100	21 ms	6236 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
vector<pair<int,int>> adj[N];
double ans=0;
int WANT;
void dfs(int v,int p=-1,double dis=0)
{
    if(v==WANT)
    {
        ans=dis;
    }
    for(auto [u,w]:adj[v])
    {
        if(u!=p)
        {
            dfs(u,v,dis+w);
        }
    }
}
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    // DONT FORGET TO CLEAR THE THINGS YOU USED
    for(int i=0;i<n;i++)
        adj[i].clear();
    WANT=h;
    if(m==(n-1))
    {
        //We have a Tree
        bool all_one=1;
        for(auto i:arr)
            all_one&=(i==1);
        for(int j=0;j<m;j++)
        {
            adj[x[j]].push_back({y[j],c[j]});
            adj[y[j]].push_back({x[j],c[j]});
        }
        if(all_one)
        {
            // this is easy
            // just calculate the distance between 0 and h
            dfs(0);
            return ans;
        }
        else{

        }

    }
    return -1;
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3