oj.uz

답안 #798410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798410 2023-07-30T16:50:05 Z HunterXD Roadside Advertisements (NOI17_roadsideadverts) C++17
7 / 100
 1000 ms 6140 KB 
#include <bits/stdc++.h>
using namespace std;

typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;

#define all(x) x.begin(), x.end()
#define pb push_back

const char nd = '\n';

struct edge {
  ll v, w;
};

vector<vector<edge>> graph;
bitset<50001> visto;

ll res = 0;
ll dfs(ll u, ll p, ll cup) {
  ll cdown = 0, temp;
  if (visto[u]) cup++, cdown++;
  for (auto v : graph[u]) {
    if (v.v == p) continue;
    temp = dfs(v.v, u, cup);
    if (cup && temp) res += v.w;
    cdown += temp;
  }
  return cdown;
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  //
  ll n;
  cin >> n;

  graph.assign(n + 1, vector<edge>());

  ll u, v, w;
  for (ll i = 1; i < n; i++) {
    cin >> u >> v >> w;
    graph[u].pb({v, w});
    graph[v].pb({u, w});
  }

  ll q;
  cin >> q;

  vl a(5);

  while (q--) {
    for (auto &v : a) cin >> v, visto[v] = true;
    res = 0;
    dfs(0, -1, 0);
    for (auto &v : a) visto[v] = false;
    cout << res << nd;
  }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 6140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 4088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1072 ms 6140 KB Time limit exceeded
3 Halted 0 ms 0 KB -