Submission #849096

#	Time	Username	Problem	Language	Result	Execution time	Memory
849096		adhityamv	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	24 ms	10844 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
#define ll long long
const int N=100000;
vector<pair<int,ll>> edges[N];
bool visited[N]={};
double ans=0;
double fans;
void dfs(int u,int h){
    if(u==h){
        fans=ans;
    }
    for(auto v:edges[u]){
        if(!visited[v.first]){
            visited[v.first]=true;
            ans+=v.second;
            dfs(v.first,h);
            ans-=v.second;
        }
    }
}
double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> a){
    for(int i=0;i<m;i++){
        edges[x[i]].push_back(make_pair(y[i],(ll) c[i]));
        edges[y[i]].push_back(make_pair(x[i],(ll) c[i]));
    }
    visited[0]=true;
    dfs(0,h);
    for(int i=0;i<n;i++){
        edges[i].clear();
    }
    return fans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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