oj.uz

Submission #963255

# Submission time Handle Problem Language Result Execution time Memory
963255 2024-04-14T19:31:10 Z SuPythony Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 0 ms 344 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<pair<int,int>>> al(1000, vector<pair<int,int>>());
vector<int> is_exit(1000, 0);
vector<int> dp(1000,0);
vector<int> vis(1000,0);
vector<int> can_reach(1000, 0);

void dfs(int u, int p) {
    if (is_exit[u]) {
        can_reach[p]=1;
        return;
    }
    vis[u]=1;
    int mn=INT_MAX;
    int mn2=INT_MAX;
    for (auto v: al[u]) {
        if (vis[v.first]) continue;
        dfs(v.first,u);
        if (can_reach[v.first]) {
            if (dp[v.first]+v.second<=mn) {
                mn2=mn;
                mn=min(mn,dp[v.first]+v.second);
            } else {
                mn2=min(mn2,dp[v.first]+v.second);
            }
        }
    }
    if (mn2!=INT_MAX) can_reach[u]=1;
    dp[u]=mn2;
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    for (int i=0; i<M; i++) {
        int u=R[i][0], v=R[i][1];
        al[u].push_back({v, L[i]});
        al[v].push_back({u, L[i]});
    }
    for (int i=0; i<K; i++) {
        is_exit[P[i]]=1;
    }
    if (is_exit[0]) return 0;
    dfs(0,-1);
    return dp[0];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -