oj.uz

Submission #750460

# Submission time Handle Problem Language Result Execution time Memory
750460 2023-05-29T14:23:15 Z Gurban Cyberland (APIO23_cyberland) C++17
0 / 100
 31 ms 7676 KB 
#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

using ld = long double;

const double inf = 1e16;
const int maxn=1e5+5;
const double eps = 0.00000001;
int D[maxn];
vector<pair<int,double>>E[maxn];

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    for(int i = 0;i < N;i++) E[i].clear();
    for(int i = 0;i < M;i++){
        E[x[i]].push_back({y[i],c[i]});
        E[y[i]].push_back({x[i],c[i]});
    }
    // for(int i = 1;i < N;i++) D[i] = 1e9;
    // D[0] = 0;
    // deque<int>deq;
    // vector<bool>vis(N);
    // deq.push_back(0);
    // while(!deq.empty()){
    //     int x = deq.front();
    //     deq.pop_front();
    //     if(vis[x]) continue;
    //     vis[x] = 1;
    //     for(auto i : E[x]){
    //         if(D[x] + (arr[i.first] == 2) < D[i.first]){
    //             D[i.first] = D[x] + (arr[i.first] == 2);
    //             if(arr[i.first] != 2) deq.push_front(i.first);
    //             else deq.push_back(i.first);
    //         }
    //     }
    // }
    vector<int>zeros = {0};
    // vector<int>two;
    for(int i = 1;i < N;i++) if(arr[i] == 0) zeros.push_back(i);
    // for(int i = 1;i < N;i++) if(arr[i] == 2) two.push_back(i);
    
    priority_queue<pair<int,int>>q;
    q.push({0,H});

    int ans = inf;
    // double der = 1;

    for(int i = 0;i <= 0;i++){
        vector<int>dis(N,inf);
        dis[H] = 0;
        vector<bool>vis(N,0);
        while(!q.empty()){
            
            int x = q.top().second;
            int len = -q.top().first;
            q.pop();

            if(vis[x]) continue;
            vis[x] = 1;

            for(auto j : E[x]){
                int now = j.second + dis[x];
                if(dis[j.first] > now){
                    dis[j.first] = now;
                    q.push({-now,j.first}); 
                }
            }
        }
        for(auto j : zeros) ans = min(ans,dis[j]);
        // for(auto j : two) if(abs(dis[j] - inf) >= eps) q.push({-dis[j],j});
        // der *= 2;
    }
    // if(abs(ans - inf) < eps) return -1;
    return ans;
}

Compilation message

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:46:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+16' to '2147483647' [-Woverflow]
   46 |     int ans = inf;
      |               ^~~
cyberland.cpp:50:26: warning: overflow in conversion from 'double' to 'std::vector<int>::value_type' {aka 'int'} changes value from '1.0e+16' to '2147483647' [-Woverflow]
   50 |         vector<int>dis(N,inf);
      |                          ^~~
cyberland.cpp:56:17: warning: unused variable 'len' [-Wunused-variable]
   56 |             int len = -q.top().first;
      |                 ^~~

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 2796 KB Double -1.63985e+09 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 2772 KB Double -2.14748e+09 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 7676 KB Double -2.14748e+09 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 2900 KB Double -2.14748e+09 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 2876 KB Double -2.14748e+09 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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