oj.uz

답안 #750007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750007 2023-05-29T03:34:30 Z Cookie 사이버랜드 (APIO23_cyberland) C++17
15 / 100
 980 ms 79760 KB 
#include<bits/stdc++.h>
#include "cyberland.h"
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int mxn = 1e5;
const ll prec = 1e-6;
struct ch{
    int u, take; ld dd;
};
struct cmp{
    bool operator()(const ch &a, const ch &b){
        return(a.dd > b.dd);
    }
};
vt<pii>adj[mxn + 1];
ld d[mxn + 1][71];
bool vis[mxn + 1], go[mxn + 1][71];
void dfs(int s){
    vis[s] = 1;
    for(auto [v, w]: adj[s]){
        if(!vis[v])dfs(v);
    }
}
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) {
    k = min(k, 70);
    forr(i, 0, n){
        adj[i].clear();
        forr(j, 0, k + 1){
            d[i][j] = 1e18; go[i][j] = 0;
        }
        vis[i] = 0;
    }
    forr(i, 0, m){
        int u = x[i], v = y[i], w = c[i];
        adj[u].pb({v, w}); adj[v].pb({u, w});
    }
    dfs(0);
    if(!vis[h])return(-1);
    
    for(int i = 0; i < n; i++){
        if((i == 0 || !arr[i]) && vis[i]){
            for(int j = 0; j < k; j++){
                d[i][j] = 0;
            }
        }
    }
    for(int tt = 0; tt <= k; tt++){
        priority_queue<ch, vt<ch>, cmp>pq; 
        for(int i = 0; i < n; i++){
            if(d[i][tt] != 1e18)pq.push({i, tt, d[i][tt]});
        }
    while(!pq.empty()){
        auto [u, take, dd] = pq.top(); pq.pop();
        if(abs(dd - d[u][take]) > prec || u == h)continue;
        for(auto [v, w]: adj[u]){
            if(d[v][take] > d[u][take] + w){
                d[v][take] = d[u][take] + w;
                pq.push({v, take, d[v][take]});
            }
            if(arr[u] == 2 && take < k){
                d[v][take + 1] = min(d[v][take + 1], (d[u][take] / 2.0) + w);
            }
        }
    }
    }
    ld ans = 1e18;
    for(int i = 0; i <= k; i++)ans = min(ans, d[h][i]);
    return(ans);
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 3948 KB Correct.
2 Correct 210 ms 3964 KB Correct.
3 Correct 197 ms 3952 KB Correct.
4 Correct 196 ms 4084 KB Correct.
5 Correct 200 ms 4068 KB Correct.
6 Correct 219 ms 15004 KB Correct.
7 Correct 297 ms 14732 KB Correct.
8 Correct 140 ms 27324 KB Correct.
9 Correct 131 ms 2772 KB Correct.
10 Correct 127 ms 2968 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 3972 KB Correct.
2 Correct 113 ms 4036 KB Correct.
3 Correct 120 ms 3996 KB Correct.
4 Correct 169 ms 15000 KB Correct.
5 Correct 73 ms 2844 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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