제출 #1326701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326701		riafhasan2010	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	2093 ms	7000 KiB

bitaro

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 1e5 + 1;
vector<vector<int>> g(N);

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, query; cin >> n >> m >> query;
  for (int i = 1; i <= m; i++) {
    int u, v; cin >> u >> v;
    g[v].push_back(u);
  }
  while (query--) {
    int p, j, ans = -1; cin >> p >> j;
    vector<bool> vis(n + 1, 1);
    for (int i = 1; i <= j; i++) {
      int x; cin >> x;
      vis[x] = 0;
    }
    vector<int> dist(n + 1, 0);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, p});
    while (!pq.empty()) {
      auto [d, u] = pq.top(); pq.pop();
      for (auto v : g[u]) {
        if (dist[u] + 1 > dist[v]) {
          dist[v] = dist[u] + 1;
          pq.push({dist[v], v});
        }
      }
      if (vis[u]) ans = max(ans, dist[u]);
    }
    for (int i = 1; i <= n; i++) {
      if (vis[i] and dist[i]) ans = max(ans, dist[i]);
    }
    cout << ans << '\n';
  }
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86