oj.uz

Submission #1087778

# Submission time Handle Problem Language Result Execution time Memory
1087778 2024-09-13T08:32:53 Z T0p_ Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 1 ms 2652 KB 
#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000 + 5;

bool is_exit[MAX_N];
vector<pair<int, long long>> g[MAX_N];

long long solve(int u, int p) {
  if (is_exit[u]) {
    assert(g[u].size() == 1);
    return 0;
  }

  long long ret = 0;
  for (pair<int, long long> edge : g[u]) {
    if (edge.first == p) continue;

    ret = max(ret, solve(edge.first, u) + edge.second);
  }

  return ret;
}

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++) {
    is_exit[P[i]] = true;
  }
  
  return solve(0, -1);
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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