oj.uz

Submission #751286

# Submission time Handle Problem Language Result Execution time Memory
751286 2023-05-31T10:50:48 Z coding_snorlax Cyberland (APIO23_cyberland) C++17
15 / 100
 37 ms 7800 KB 
#include<bits/stdc++.h>
//#include "cyberland.h"
using namespace std;
using ll = long long int;
vector<pair<ll,ll>> G[100002];
set<pair<ll,ll>> now_node;
ll dis[100002];
int vis[100002]={0};
double solve(int N,int M,int K,int H, vector<int> x,vector<int> y,vector<int> c,vector<int> arr){
    int n=N,m=M;
    for(int i=0;i<=n;i++){
        vis[i]=0;
        dis[i]=100000000000000;
        G[i].clear();
    }
    for(int i=0;i<m;i++){
        G[x[i]].push_back(make_pair(c[i],y[i]));
        G[y[i]].push_back(make_pair(c[i],x[i]));
    }
    dis[0]=0;
    vis[0]=1;
    for(auto i:G[0]){
        dis[i.second]=dis[0]+i.first;
        now_node.insert(i);
    }
    dis[0]=0;
    while((int)now_node.size()){
        auto it = *now_node.begin();
        if(!vis[it.second]){
            vis[it.second]=1;
            for(auto now:G[it.second]){
                if(dis[now.second]>dis[it.second]+now.first){
                    dis[now.second]=dis[it.second]+now.first;
                    now_node.insert(make_pair(dis[now.second],now.second));
                }
            }
        }
        now_node.erase(it);
    }
    if(dis[H]==100000000000000) return -1;
    return dis[H];
}
/*
int main(){
    int T;
    cin>>T;
    for(int s=0;s<T;s++){
        int N,M,K,H;
        cin>>N>>M>>K>>H;
        vector<int> x,y,c,arr;
        for(int i=0;i<N;i++){
            int tmp;
            cin>>tmp;
            arr.push_back(tmp);
        }

        for(int i=0;i<M;i++){
            int tmp1,tmp2,tmp3;
            cin>>tmp1>>tmp2>>tmp3;
            x.push_back(tmp1);
            y.push_back(tmp2);
            c.push_back(tmp3);
        }
        cout << solve(N,M,K,H,x,y,c,arr) << "\n";
    }
}*/

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2900 KB Correct.
2 Correct 29 ms 2860 KB Correct.
3 Correct 26 ms 2840 KB Correct.
4 Correct 28 ms 2852 KB Correct.
5 Correct 28 ms 2772 KB Correct.
6 Correct 25 ms 3668 KB Correct.
7 Correct 37 ms 3732 KB Correct.
8 Correct 15 ms 4576 KB Correct.
9 Correct 25 ms 2716 KB Correct.
10 Correct 27 ms 2644 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2884 KB Correct.
2 Correct 31 ms 2900 KB Correct.
3 Correct 24 ms 2828 KB Correct.
4 Correct 24 ms 4044 KB Correct.
5 Correct 21 ms 2644 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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