Submission #970589

#TimeUsernameProblemLanguageResultExecution timeMemory
970589SuPythony사이버랜드 (APIO23_cyberland)C++17
0 / 100
1122 ms2097152 KiB
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<vector<pair<int,int>>> al;
int ans;

void dfs(int i, int p, int c, int f, vector<int> a) {
    if (i==f) {
        ans=c;
        return;
    }
    for (auto v: al[i]) {
        if (v.first==p) continue;
        dfs(v.first,i,v.second+(a[i]==0?0:c),f,a);
    }
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int>
y, vector<int> c, vector<int> a) {
    ans=-1;
    al.assign(N,vector<pair<int,int>>());
    for (int i=0; i<M; i++) {
        al[x[i]].push_back({y[i],c[i]});
        al[y[i]].push_back({x[i],c[i]});
    }
    dfs(0,-1,0,H,a);
    return double(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...