oj.uz

답안 #1080584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080584 2024-08-29T11:25:40 Z KasymK 사이버랜드 (APIO23_cyberland) C++17
40 / 100
 2991 ms 26064 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 pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#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 = 2e5+5;
const int K = 70;
vector<pii> adj[N];
bool vis0[N], vis[N][K];
priority_queue<tuple<int, double, int>, vector<tuple<int, double, int>>, greater<tuple<int, double, int>>> q;
vector<int> ad;

void dfs(int x){
    if(vis0[x])
        return; 
    vis0[x] = 1;
    if(ad[x] == 0)
        q.push({0, 0, x});
    for(auto [i, w] : adj[x])
        dfs(i);
}

double solve(int n, int m, int k, int h, vector<int> u, vector<int> v, vector<int> w, vector<int> arr){
    umin(k, 70);
    ad.clear();
    for(auto &i : arr)
        ad.pb(i);
    memset(vis0, 0, sizeof vis0);
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    while(!q.empty())
        q.pop();
    ad[0] = 0;
    vis0[h] = 1;
    for(int i = 0; i < m; ++i){
        adj[u[i]].pb({v[i], w[i]});
        adj[v[i]].pb({u[i], w[i]});
    }
    double answer = 1e15;
    dfs(0);
    memset(vis, 0, sizeof vis);
    while(!q.empty()){
        auto [x0, w0, x] = q.top();
        q.pop();
        if(x == h){
            umin(answer, w0);
            continue;
        }
        if(vis[x][x0])
            continue;
        vis[x][x0] = 1;
        for(auto &[i, w] : adj[x]){
            if(!vis[i][x0])
                q.push({x0, w0+w, i});
            if(ad[i] == 2 and x0 < K and !vis[i][x0+1])
                q.push({x0+1, (w0+w)/(double)(2), i});
        }
    }
    if(answer == 1e18)
        return -1;
    else
        return answer;
}

// int main(){
//     double kk = solve(3, 2, 30, 2, {1, 2}, {2, 0}, {12, 4}, {1, 2, 1});
//     double kk1 = solve(4, 4, 30, 3, {0, 0, 1, 2}, {1, 2, 3, 3}, {5, 4, 2, 4}, {1, 0, 2, 1});
//     double kk2 = solve(7, 8, 3, 6, {0, 0, 1, 2, 3, 3, 4, 5}, {1, 2, 3, 3, 4, 5, 6, 6}, {2, 4, 6, 8, 10, 12, 14, 16}, {1, 2, 0, 2, 2, 2, 1});
//     if(kk == 4.0 and kk1 == 2.0 and kk2 == 20.75)
//         puts("Correct.");
//     else
//         puts("Wrong Answer.");
//     return 0;
// }

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 20052 KB Correct.
2 Correct 53 ms 20048 KB Correct.
3 Correct 57 ms 20060 KB Correct.
4 Correct 64 ms 20048 KB Correct.
5 Correct 54 ms 20052 KB Correct.
6 Correct 28 ms 20564 KB Correct.
7 Correct 32 ms 20816 KB Correct.
8 Correct 19 ms 20824 KB Correct.
9 Correct 315 ms 19820 KB Correct.
10 Correct 325 ms 19940 KB Correct.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 20016 KB Correct.
2 Correct 60 ms 20048 KB Correct.
3 Correct 66 ms 19924 KB Correct.
4 Correct 343 ms 19936 KB Correct.
5 Correct 328 ms 19792 KB Correct.
6 Correct 13 ms 20056 KB Correct.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 334 ms 26064 KB Correct.
2 Correct 399 ms 20308 KB Correct.
3 Correct 350 ms 20048 KB Correct.
4 Correct 378 ms 20048 KB Correct.
5 Correct 495 ms 19804 KB Correct.

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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