oj.uz

Submission #849093

# Submission time Handle Problem Language Result Execution time Memory
849093 2023-09-14T05:18:56 Z adhityamv Cyberland (APIO23_cyberland) C++17
0 / 100
 22 ms 9552 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100000;
vector<pair<int,ll>> edges[N];
bool visited[N]={};
double ans=0;
void dfs(int u,int h){
    if(u==h) return;
    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 ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3168 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 3672 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3928 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 9552 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 3928 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 3920 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 4020 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 3928 KB Wrong Answer.
2 Halted 0 ms 0 KB -