oj.uz

Submission #1062057

# Submission time Handle Problem Language Result Execution time Memory
1062057 2024-08-16T18:01:26 Z KasymK Cyberland (APIO23_cyberland) C++17
8 / 100
 18 ms 7536 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 int INF = 1e8;
vector<pii> adj[N];
ll d[N];
int vis[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)
        vis[i] = 0, d[i] = -1;
    queue<int> q;
    q.push(h);
    vis[h] = 1;
    d[h] = 0;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(auto [i, val] : adj[x])
            if(!vis[i]){
                vis[i] = 1;
                d[i] = d[x]+val;
                q.push(i);
            }
    }
    double answer = 0;
    answer += d[0];
    for(int i = 0; i < n; ++i)
        if(arr[i] == 0)
            umin(answer, (double)d[i]);
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    return answer;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3932 KB Correct.
2 Correct 13 ms 4768 KB Correct.
3 Correct 13 ms 4880 KB Correct.
4 Correct 14 ms 4956 KB Correct.
5 Correct 15 ms 4952 KB Correct.
6 Correct 12 ms 5212 KB Correct.
7 Correct 17 ms 5536 KB Correct.
8 Correct 7 ms 5468 KB Correct.
9 Correct 15 ms 4700 KB Correct.
10 Correct 14 ms 4700 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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