oj.uz

답안 #754132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754132 2023-06-06T19:11:49 Z MarwenElarbi 사이버랜드 (APIO23_cyberland) C++17
44 / 100
 80 ms 50548 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "cyberland.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 1e5+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
vector<pair<int,double>> adj[nax];
int lst,cnt;
vector<bool> vis(nax,0);
double power[100];
double dis[nax][70];
void dfs(int x){
    vis[x]=true;
    if (x==lst) return;
    for(auto u:adj[x]){
        if (vis[u.fi]==true) continue;
        dfs(u.fi);
    }
    return;
}
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    lst=H;
    cnt=min(K,66);
    arr[0]=0;
    power[0]=1.0;
    for (int i = 1; i <= cnt; ++i)
    {
        power[i]=power[i-1]/2.0;
    }
    for (int i = 0; i < N; ++i)
    {
        adj[i].clear();
        for (int j = 0; j <= cnt; ++j)
        {
            dis[i][j]=1e18;
        }
        vis[i]=false;
    }
    for (int i = 0; i < M; ++i)
    {
        adj[x[i]].pb({y[i],c[i]});
        adj[y[i]].pb({x[i],c[i]});
    }
    dfs(0);
    priority_queue<pair<double,pair<int,int>>,vector<pair<double,pair<int,int>>>,greater<>> pq;
    pq.push({0,{H,0}});
    dis[H][0]=0;
    while(!pq.empty()){
        int node=pq.top().se.fi;
        int lvl=pq.top().se.se;
        double distance=pq.top().fi;
        pq.pop();
        //cout << node<<" "<<distance<<" "<<lvl<<endl;
        if (dis[node][lvl]<(distance)) continue;
        if (arr[node]==0) return distance;    

        for(auto u:adj[node]){
            if (vis[u.fi]==false) continue;
            //cout <<"ee"<<u.fi<<" "<< dis[u.fi][lvl]<<" "<<power[lvl]*u.se<<endl;

            if (dis[node][lvl]+power[lvl]*u.se<dis[u.fi][lvl]){
                dis[u.fi][lvl]=dis[node][lvl]+power[lvl]*u.se;
                pq.push({dis[u.fi][lvl],{u.fi,lvl}});
            }

            if(arr[u.fi]==2&& lvl<K && dis[node][lvl]+power[lvl]*u.se<dis[u.fi][lvl+1] ){
                dis[u.fi][lvl+1]=dis[node][lvl]+power[lvl]*u.se;
                pq.push({dis[u.fi][lvl+1],{u.fi,lvl+1}});
            }
        }
    }
    return -1;
}
/*int main(){
    optimise;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int T;
      assert(1 == scanf("%d", &T));
      while (T--){
        int N,M,K,H;
        assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
        std::vector<int> x(M);
        std::vector<int> y(M);
        std::vector<int> c(M);
        std::vector<int> arr(N);
        for (int i=0;i<N;i++)
          assert(1 == scanf("%d", &arr[i]));
        for (int i=0;i<M;i++)
          assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
        printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
      }  
}*/

Compilation message

cyberland.cpp: In function 'void setIO(std::string)':
cyberland.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cyberland.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 2772 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 3412 KB Correct.
2 Correct 25 ms 3340 KB Correct.
3 Correct 23 ms 3340 KB Correct.
4 Correct 22 ms 3396 KB Correct.
5 Correct 25 ms 3412 KB Correct.
6 Correct 21 ms 8916 KB Correct.
7 Correct 27 ms 8816 KB Correct.
8 Correct 15 ms 15008 KB Correct.
9 Correct 22 ms 2772 KB Correct.
10 Correct 22 ms 2772 KB Correct.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3356 KB Correct.
2 Correct 21 ms 3284 KB Correct.
3 Correct 20 ms 3412 KB Correct.
4 Correct 22 ms 2788 KB Correct.
5 Correct 22 ms 2772 KB Correct.
6 Correct 7 ms 7636 KB Correct.

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 39500 KB Correct.
2 Incorrect 22 ms 3284 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 3412 KB Correct.
2 Correct 24 ms 3412 KB Correct.
3 Correct 23 ms 3448 KB Correct.
4 Correct 26 ms 9300 KB Correct.
5 Correct 23 ms 2772 KB Correct.

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3412 KB Correct.
2 Correct 21 ms 3388 KB Correct.
3 Correct 80 ms 50548 KB Correct.
4 Correct 17 ms 7508 KB Correct.
5 Correct 21 ms 2772 KB Correct.
6 Correct 21 ms 3540 KB Correct.

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 3536 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 3552 KB Wrong Answer.
2 Halted 0 ms 0 KB -