Submission #981898

#	Time	Username	Problem	Language	Result	Execution time	Memory
981898		vjudge1	Cyberland (APIO23_cyberland)	C++17	44 / 100	32 ms	9180 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>>ad[100005];
vector<int>rs,ar,vs(100005);
int h;

void dfs(int u){
    if(u==h)return;
    if(ar[u]==0)rs.push_back(u);
    vs[u]=1;
    for(auto v:ad[u])
        if(!vs[v.first])
            dfs(v.first);
}

double solve(int N,int M,int K,int H,vector<int>x,vector<int>y,vector<int>c,vector<int>arr) {
    h=H;
    for(int i=0;i<N;i++)ad[i].clear(),vs[i]=0;
    for(int i=0;i<M;i++)
        ad[x[i]].push_back({y[i],c[i]}),
        ad[y[i]].push_back({x[i],c[i]});
    rs.clear();
    ar.clear();
    rs.push_back(0);
    for(auto i:arr)ar.push_back(i);
    dfs(0);
    priority_queue<pair<double,int>>dj;
    for(auto i:rs)dj.push({0,i});
    double R[N];
    for(int i=0;i<N;i++)R[i]=1;
    while(!dj.empty()){
        auto t=dj.top();
        dj.pop();
        if(R[t.second]!=1)continue;
        R[t.second]=t.first;
        for(auto j:ad[t.second])dj.push({t.first-j.second,j.first});
    }
    return -R[H];
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3