oj.uz

Submission #1061228

# Submission time Handle Problem Language Result Execution time Memory
1061228 2024-08-16T07:23:33 Z KasymK Cyberland (APIO23_cyberland) C++17
15 / 100
 33 ms 6992 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second   
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
const ll INF = 1e15; // 1e5*1e9=1e14
vector<pii> adj[N];
ll d[N];
double solve(int n, int m, int k, int h, vector<int> u, vector<int> v, vector<int> w, vector<int> arr){
    for(int i = 0; i < m; ++i){
        adj[u[i]].pb({v[i], w[i]});
        adj[v[i]].pb({u[i], w[i]});
    }
    for(int i = 0; i <= n; ++i)
        d[i] = INF;
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    pq.push({0, 0});
    d[0] = 0;
    while(!pq.empty()){
        int x = pq.top().ss;
        pq.pop();
        for(auto it = adj[x].begin(); it != adj[x].end(); ++it){
            int i = (*it).ff, val = (*it).ss;
            if(umin(d[i], d[x]+val))
                pq.push({d[i], i});
        }
    }
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    if(d[h] == INF)
        d[h] = -1;
    double answer = 0;
    answer += d[h];
    return answer;
}

// int main(){
//     double kk = solve(5, 4, 10, 3, {0, 0, 2, 2}, {1, 2, 3, 4}, {6, 5, 7, 8}, {1, 1, 1, 1, 1});
//     printf("%f\n", kk);
//     return 0;
// }

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3580 KB Correct.
2 Correct 16 ms 3524 KB Correct.
3 Correct 15 ms 3516 KB Correct.
4 Correct 17 ms 3532 KB Correct.
5 Correct 27 ms 3420 KB Correct.
6 Correct 23 ms 4188 KB Correct.
7 Correct 18 ms 4188 KB Correct.
8 Correct 8 ms 4952 KB Correct.
9 Correct 26 ms 3444 KB Correct.
10 Correct 26 ms 3416 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3420 KB Correct.
2 Correct 23 ms 4436 KB Correct.
3 Correct 25 ms 4440 KB Correct.
4 Correct 16 ms 5260 KB Correct.
5 Correct 23 ms 4184 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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