oj.uz

Submission #1008197

# Submission time Handle Problem Language Result Execution time Memory
1008197 2024-06-26T08:20:24 Z imarn Cyberland (APIO23_cyberland) C++17
49 / 100
 566 ms 50108 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 use[67][mxn]{0};
bool vis[mxn]{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;
    for(int i=0;i<=K;i++)memset(use[i],0,sizeof use[i]);
    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(use[u.s.f][u.s.s])continue;use[u.s.f][u.s.s]=1;
        if(u.s.s==H){ans=min(ans,u.f);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);
}

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:33:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   33 |         if(use[u.s.f][u.s.s])continue;use[u.s.f][u.s.s]=1;
      |         ^~
cyberland.cpp:33:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   33 |         if(use[u.s.f][u.s.s])continue;use[u.s.f][u.s.s]=1;
      |                                       ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 33152 KB Correct.
2 Correct 566 ms 33116 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33368 KB Correct.
2 Correct 25 ms 33112 KB Correct.
3 Correct 25 ms 33116 KB Correct.
4 Correct 28 ms 33116 KB Correct.
5 Correct 28 ms 33372 KB Correct.
6 Correct 20 ms 33880 KB Correct.
7 Correct 25 ms 34136 KB Correct.
8 Correct 13 ms 34648 KB Correct.
9 Correct 78 ms 33220 KB Correct.
10 Correct 77 ms 33204 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 33112 KB Correct.
2 Correct 29 ms 33116 KB Correct.
3 Correct 27 ms 33372 KB Correct.
4 Correct 77 ms 33224 KB Correct.
5 Correct 84 ms 32976 KB Correct.
6 Correct 9 ms 33884 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 38864 KB Correct.
2 Incorrect 79 ms 33116 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 33372 KB Correct.
2 Correct 25 ms 33448 KB Correct.
3 Correct 24 ms 33372 KB Correct.
4 Correct 21 ms 34396 KB Correct.
5 Correct 72 ms 33116 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 33368 KB Correct.
2 Correct 24 ms 33372 KB Correct.
3 Correct 34 ms 39540 KB Correct.
4 Correct 15 ms 34136 KB Correct.
5 Correct 81 ms 33216 KB Correct.
6 Correct 25 ms 33372 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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