Submission #1061157

# Submission time Handle Problem Language Result Execution time Memory
1061157 2024-08-16T06:47:09 Z KasymK Cyberland (APIO23_cyberland) C++17
8 / 100
181 ms 7260 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);
    memset(d, -1, sizeof d);
    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;
                d[i] = d[x]+val;
                if(!arr[i])
                    d[i] = 0;
                q.push(i);
            }
    }
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    double answer = 0;
    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;
// }
# Verdict Execution time Memory Grader output
1 Incorrect 181 ms 3924 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 14 ms 3676 KB Correct.
2 Correct 15 ms 4804 KB Correct.
3 Correct 15 ms 4700 KB Correct.
4 Correct 15 ms 4684 KB Correct.
5 Correct 15 ms 4700 KB Correct.
6 Correct 12 ms 5212 KB Correct.
7 Correct 15 ms 5468 KB Correct.
8 Correct 8 ms 5464 KB Correct.
9 Correct 31 ms 4444 KB Correct.
10 Correct 30 ms 4444 KB Correct.
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 3928 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 7260 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 3676 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 3676 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 4188 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 4444 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -