oj.uz

Submission #984732

# Submission time Handle Problem Language Result Execution time Memory
984732 2024-05-17T03:49:55 Z Faisal_Saqib Cyberland (APIO23_cyberland) C++17
8 / 100
 21 ms 6236 KB 
#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.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3676 KB Correct.
2 Correct 17 ms 3908 KB Correct.
3 Correct 16 ms 3776 KB Correct.
4 Correct 17 ms 3932 KB Correct.
5 Correct 17 ms 3920 KB Correct.
6 Correct 14 ms 4184 KB Correct.
7 Correct 18 ms 4444 KB Correct.
8 Correct 8 ms 4444 KB Correct.
9 Correct 16 ms 3604 KB Correct.
10 Correct 17 ms 3608 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2904 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 2652 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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