oj.uz

Submission #773120

# Submission time Handle Problem Language Result Execution time Memory
773120 2023-07-04T15:29:56 Z JakobZorz Cyberland (APIO23_cyberland) C++17
68 / 100
 3000 ms 13792 KB 
#include "cyberland.h"
#include <vector>
#include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
typedef long long ll;
const double MAX_DIST=1000000000000000000.0;
using namespace std;

int n,m,k,h;
vector<pair<int,double>>nodes[100000];
double dist[100000];
bool vis[100000];

void dfs(int node){
    if(vis[node])
        return;
    vis[node]=true;
    if(node==h)
        return;
    for(pair<int,double>ne:nodes[node]){
        dfs(ne.first);
    }
}

double solve(int N,int M,int K,int H,vector<int>x,vector<int>y,vector<int>c,vector<int>arr){
    n=N;
    m=M;
    k=K;
    h=H;
    for(int i=0;i<n;i++){
        nodes[i].clear();
        dist[i]=MAX_DIST;
        vis[i]=false;
    }
    for(int i=0;i<m;i++){
        nodes[x[i]].emplace_back(y[i],c[i]);
        nodes[y[i]].emplace_back(x[i],c[i]);
    }
    dfs(0);
    dist[0]=0;
    queue<int>q;
    q.push(0);
    if(!vis[h])
        return -1;
    for(int i=0;i<n;i++){
        if(arr[i]==0&&vis[i]){
            dist[i]=0;
            q.push(i);
        }
    }
    
    while(k--){
        for(int i=0;i<n;i++){
            if(arr[i]==2&&vis[i]){
                for(pair<int,double>ne:nodes[i]){
                    double new_dist=dist[i]/2+ne.second;
                    if(new_dist<dist[ne.first]){
                        dist[ne.first]=new_dist;
                        q.push(ne.first);
                    }
                }
            }
        }
        
        while(!q.empty()){
            int curr=q.front();
            q.pop();
            if(curr==h)
                continue;
            for(pair<int,double>ne:nodes[curr]){
                double new_dist=dist[curr]+ne.second;
                if(new_dist<dist[ne.first]){
                    dist[ne.first]=new_dist;
                    q.push(ne.first);
                }
            }
        }
    }
    
    return dist[h];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2772 KB Correct.
2 Correct 17 ms 3104 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2772 KB Correct.
2 Correct 18 ms 2752 KB Correct.
3 Correct 17 ms 2772 KB Correct.
4 Correct 18 ms 2820 KB Correct.
5 Correct 18 ms 2804 KB Correct.
6 Correct 15 ms 3620 KB Correct.
7 Correct 19 ms 3628 KB Correct.
8 Correct 9 ms 4344 KB Correct.
9 Correct 18 ms 2724 KB Correct.
10 Correct 18 ms 2860 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2772 KB Correct.
2 Correct 18 ms 2836 KB Correct.
3 Correct 19 ms 2820 KB Correct.
4 Correct 19 ms 2736 KB Correct.
5 Correct 19 ms 2644 KB Correct.
6 Correct 5 ms 3412 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 8196 KB Correct.
2 Correct 22 ms 3668 KB Correct.
3 Correct 20 ms 3672 KB Correct.
4 Correct 22 ms 3748 KB Correct.
5 Correct 22 ms 3540 KB Correct.

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2900 KB Correct.
2 Correct 19 ms 2932 KB Correct.
3 Correct 18 ms 2908 KB Correct.
4 Correct 23 ms 4120 KB Correct.
5 Correct 15 ms 2644 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2900 KB Correct.
2 Correct 16 ms 2880 KB Correct.
3 Correct 33 ms 9780 KB Correct.
4 Correct 16 ms 3692 KB Correct.
5 Correct 18 ms 2732 KB Correct.
6 Correct 17 ms 2900 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2944 KB Correct.
2 Correct 4 ms 3028 KB Correct.
3 Incorrect 62 ms 13792 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3079 ms 2800 KB Time limit exceeded
2 Halted 0 ms 0 KB -