oj.uz

Submission #821740

# Submission time Handle Problem Language Result Execution time Memory
821740 2023-08-11T14:33:44 Z nemethm Crocodile's Underground City (IOI11_crocodile) C++17
46 / 100
 154 ms 262144 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
     
using namespace std;
using ll = long long int;
     
vector<pair<int,ll>> g[100100];
     
ll dist[100100] = {0};
bool exit_c[100100] = {false};

void dfs(int node, int prev = -1){
      for(auto i : g[node]){
        if(i.first != prev){
          dist[i.first] = dist[node] + i.second;
          dfs(i.first, node);
        }
      }
}

int solve(int node, int prev = -1){
  if(exit_c[node]) return 0;
  vector<int> v;
  for(auto i : g[node]){
    if(i.first != prev){
      int s = solve(i.first,node) + i.second;
      v.push_back(s);
    }
  }
  sort(begin(v), end(v));
  return v[1];
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  for(int i = 0; i < M; ++i){
    g[R[i][0]].push_back({R[i][1], L[i]});
    g[R[i][1]].push_back({R[i][0], L[i]});
  }
  for(int i = 0; i < K; ++i){
    exit_c[P[i]] = true;
  }
  dfs(0);
  return solve(0);
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2676 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2800 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2676 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2800 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Runtime error 154 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 1 ms 2644 KB Output is correct
2 Correct 1 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2676 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2800 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Runtime error 154 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -