oj.uz

Submission #966946

# Submission time Handle Problem Language Result Execution time Memory
966946 2024-04-20T16:49:15 Z Hugo1729 Crocodile's Underground City (IOI11_crocodile) C++17
46 / 100
 130 ms 262144 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
// typedef long long ll;

int dp[1000001*4]={0};
int n,m,k;
vector<pair<int,int>> adj[1000001*4];
bool blocked[1000001*4]={0};

void dfs(int v, int pV){
    if(blocked[v])dp[v]=0;
    else{
        vector<int> sus(3,1000000001);

        for(auto [w,d] : adj[v]){
            if(w!=pV){
                dfs(w,v);
                sus[2]=dp[w]+d;
                sort(sus.begin(),sus.end());
            }
        }
        dp[v]=min(1000000001,sus[1]);
    }
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    n=N;
    m=M;
    k=K;

    for(int i=0;i<m;i++){
        adj[R[i][0]].push_back({R[i][1],L[i]});
        adj[R[i][1]].push_back({R[i][0],L[i]});
    }

    for(int i=0;i<k;i++)blocked[P[i]]=1;

    dfs(0,0);

    // for(int i=0;i<n;i++)cout << dp[i] << ' ';
    // cout << '\n';

    return dp[0];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 100948 KB Output is correct
2 Correct 23 ms 100912 KB Output is correct
3 Correct 25 ms 100956 KB Output is correct
4 Correct 24 ms 100956 KB Output is correct
5 Correct 25 ms 100952 KB Output is correct
6 Correct 22 ms 100956 KB Output is correct
7 Correct 24 ms 100956 KB Output is correct
8 Correct 25 ms 100956 KB Output is correct

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 100948 KB Output is correct
2 Correct 23 ms 100912 KB Output is correct
3 Correct 25 ms 100956 KB Output is correct
4 Correct 24 ms 100956 KB Output is correct
5 Correct 25 ms 100952 KB Output is correct
6 Correct 22 ms 100956 KB Output is correct
7 Correct 24 ms 100956 KB Output is correct
8 Correct 25 ms 100956 KB Output is correct
9 Runtime error 130 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 100948 KB Output is correct
2 Correct 23 ms 100912 KB Output is correct
3 Correct 25 ms 100956 KB Output is correct
4 Correct 24 ms 100956 KB Output is correct
5 Correct 25 ms 100952 KB Output is correct
6 Correct 22 ms 100956 KB Output is correct
7 Correct 24 ms 100956 KB Output is correct
8 Correct 25 ms 100956 KB Output is correct
9 Runtime error 130 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -