oj.uz

Submission #1008207

# Submission time Handle Problem Language Result Execution time Memory
1008207 2024-06-26T08:25:34 Z imarn Cyberland (APIO23_cyberland) C++17
49 / 100
 561 ms 65108 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
using namespace std;
const int mxn=1e5+5;
vector<pair<int,double>>g[mxn];
double d[67][mxn]{0};
bool vis[mxn+67]{0};
void dfs(int u,int n){
    vis[u]=1;
    for(auto v:g[u]){
        if(v.f==n||vis[v.f])continue;
        dfs(v.f,n);
    }
}
priority_queue<pair<double,pii>,vector<pair<double,pii>>,greater<pair<double,pii>>>q;
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,66);for(int i=0;i<M;i++)g[x[i]].pb({y[i],c[i]}),g[y[i]].pb({x[i],c[i]});dfs(0,H);
    for(int i=0;i<=K;i++)for(int j=0;j<N;j++)d[i][j]=1e17;
    d[0][0]=0;q.push({0,{0,0}});arr[0]=0;double ans=1e17;
    for(int i=1;i<N;i++)if(arr[i]==0&&vis[i])d[0][i]=0,q.push({0,{0,i}});
    while(!q.empty()){
        auto u=q.top();q.pop();
        if(d[u.s.f][u.s.s]<u.f)continue;
        if(vis[u.s.f+N])continue;
        if(u.s.s==H){ans=min(ans,u.f);vis[u.s.f+N]=1;continue;}
        for(auto v:g[u.s.s]){
            if(!arr[v.f])continue;
            if(d[u.s.f][v.f]>u.f+v.s)d[u.s.f][v.f]=u.f+v.s,q.push({u.f+v.s,{u.s.f,v.f}});
            if(arr[v.f]==2&&u.s.f<K){
                double t = (u.f+v.s)/2;
                if(d[u.s.f+1][v.f]>t)d[u.s.f+1][v.f]=t,q.push({t,{u.s.f+1,v.f}});
            }
        }
    }for(int i=0;i<N;i++)g[i].clear();memset(vis,0,sizeof vis);
    return (ans>=1e17?-1:ans);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 28508 KB Correct.
2 Correct 23 ms 28508 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28764 KB Correct.
2 Correct 19 ms 28788 KB Correct.
3 Correct 17 ms 28780 KB Correct.
4 Correct 19 ms 28676 KB Correct.
5 Correct 18 ms 28764 KB Correct.
6 Correct 14 ms 29476 KB Correct.
7 Correct 20 ms 29572 KB Correct.
8 Correct 11 ms 30280 KB Correct.
9 Correct 18 ms 28508 KB Correct.
10 Correct 17 ms 28508 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28764 KB Correct.
2 Correct 21 ms 28760 KB Correct.
3 Correct 17 ms 28764 KB Correct.
4 Correct 19 ms 28508 KB Correct.
5 Correct 21 ms 28640 KB Correct.
6 Correct 7 ms 29276 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 35380 KB Correct.
2 Incorrect 145 ms 28760 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28764 KB Correct.
2 Correct 20 ms 28848 KB Correct.
3 Correct 19 ms 28780 KB Correct.
4 Correct 19 ms 29900 KB Correct.
5 Correct 17 ms 28508 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 28764 KB Correct.
2 Correct 17 ms 28836 KB Correct.
3 Correct 33 ms 35048 KB Correct.
4 Correct 15 ms 29528 KB Correct.
5 Correct 19 ms 28508 KB Correct.
6 Correct 19 ms 28760 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 29020 KB Correct.
2 Correct 29 ms 29404 KB Correct.
3 Incorrect 38 ms 26556 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 42264 KB Correct.
2 Correct 86 ms 43476 KB Correct.
3 Correct 43 ms 65108 KB Correct.
4 Incorrect 102 ms 44700 KB Wrong Answer.
5 Halted 0 ms 0 KB -