oj.uz

Submission #1061160

# Submission time Handle Problem Language Result Execution time Memory
1061160 2024-08-16T06:50:05 Z KasymK Cyberland (APIO23_cyberland) C++17
8 / 100
 23 ms 7256 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];
double d[N];
bool 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]});
    }
    memset(vis, false, sizeof vis);
    for(int i = 0; i <= n; ++i)
        d[i] = INF;
    queue<int> q;
    q.push(0);
    d[0] = 0;
    vis[0] = true;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(auto [i, val] : adj[x])
            if(!vis[i]){
                vis[i] = true;
                umin(d[i], d[x]+val);
                if(arr[i] == 0)
                    d[i] = 0;
                q.push(i);
            }
    }
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    double answer = 0;
    if(d[h] == INF)
        d[h] = -1;
    answer += d[h];
    return answer;
}

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

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3680 KB Correct.
2 Correct 13 ms 3756 KB Correct.
3 Correct 12 ms 3668 KB Correct.
4 Correct 13 ms 3672 KB Correct.
5 Correct 13 ms 3744 KB Correct.
6 Correct 11 ms 4188 KB Correct.
7 Correct 15 ms 4188 KB Correct.
8 Correct 7 ms 4828 KB Correct.
9 Correct 14 ms 3416 KB Correct.
10 Correct 14 ms 3636 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 7256 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 3716 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 3676 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 3672 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

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