oj.uz

답안 #1030678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030678 2024-07-22T08:29:35 Z amine_aroua 사이버랜드 (APIO23_cyberland) C++17
15 / 100
 708 ms 2097152 KB 
#include "cyberland.h"

#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr)
{
    vector<vector<pair<long long ,long long>>> adj(N);
    for(long long i = 0 ; i < M ; i++)
    {
        adj[x[i]].push_back({y[i] , c[i]});
        adj[y[i]].push_back({x[i] , c[i]});
    }
    priority_queue<pair<double , pair<long long ,long long>> , vector<pair<double , pair<long long ,long long>>> , greater<pair<double , pair<long long ,long long>>>> pq;
    vector<vector<double>> dist(K + 1 , vector<double>(N , 1e16));
    vector<vector<bool>> vis(K + 1 , vector<bool>(N , 0));
    dist[K][0] = 0;
    pq.push({0 , {K , 0}});
    while(!pq.empty())
    {
        auto tp = pq.top();
        pq.pop();
        double d = tp.first ;
        long long node = tp.second.second , k = tp.second.first;
        if(vis[k][node])
            continue;
        vis[k][node] = 1;
        for(auto [u , cost] : adj[node])
        {
            double nd = d + (double)cost;
            if(arr[u] == 0)
            {
                nd = 0;
            }
            if(nd < eps + dist[k][u])
            {
                dist[k][u] = nd;
                pq.push({nd , {k , u}});
            }
            if(arr[u] == 2 && k >= 1)
            {
                nd/=2.0;
                if(nd < eps + dist[k - 1][u])
                {
                    dist[k - 1][u] = nd;
                    pq.push({nd , {k - 1 , u}});
                }
            }
        }
    }
    double mn = 1e16;
    for(long long i = 0 ; i <= K ; i++)
    {
        mn= min(mn , dist[i][H]);
    }
    return (mn == 1e16 ? -1 : mn);
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 848 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1700 KB Correct.
2 Correct 22 ms 1828 KB Correct.
3 Correct 21 ms 1848 KB Correct.
4 Correct 22 ms 1836 KB Correct.
5 Correct 22 ms 1900 KB Correct.
6 Correct 21 ms 4828 KB Correct.
7 Correct 26 ms 4660 KB Correct.
8 Correct 12 ms 7868 KB Correct.
9 Correct 24 ms 1376 KB Correct.
10 Correct 23 ms 1372 KB Correct.

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 1744 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 178 ms 22176 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 1720 KB Correct.
2 Correct 22 ms 1828 KB Correct.
3 Correct 21 ms 1860 KB Correct.
4 Correct 21 ms 4336 KB Correct.
5 Correct 21 ms 1372 KB Correct.

Subtask #6
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 1824 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 281 ms 2364 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 708 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -