제출 #500194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500194		kamalsharmaa9	Bitaro’s Party (JOI18_bitaro)	C++14	100 / 100	1909 ms	120248 KiB

bitaro

#include<bits/stdc++.h>
using namespace std;
#define N               100010
#define ff              first
#define ss              second
#define pb              push_back
#define pii             pair<int,int>
const int B=120;
int not_taken[N];
vector<int>gr[N];
vector<int>grr[N];
int dp[N];
int rep[N];
vector<pii>dist[N];
vector<pii>child_and_dist;
bool compare(const pii &p1, const pii & p2)
{
  return p1.first > p2.first;
}
int32_t main()
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);


  int n, m, Q;
  cin >> n >> m >> Q;
  
  int a, b;
  for (int i = 1; i <= m; i++)
  {
    cin >> a >> b;
    gr[a].pb(b);
    grr[b].pb(a);
  }
///// precomputation
  for (int node = 1; node <= n; node++)
  {
    child_and_dist.clear();
    for (auto child : grr[node])
    {
      for (auto j : dist[child])
      {
        child_and_dist.pb({j.ff + 1, j.ss});
      }
    }
    child_and_dist.pb({0, node});
    int num_taken = 0;
    sort(child_and_dist.begin(), child_and_dist.end(), compare);
    for (int j = 0; j < (int)child_and_dist.size() && num_taken < B; j++)
    {
      if (rep[child_and_dist[j].ss] != node)
      {
        num_taken++;
        dist[node].pb({child_and_dist[j]});
        rep[child_and_dist[j].ss] = node;
      }
    }

  }
  for (int i = 0; i <= n; i++)
    not_taken[i] = 0;
  for (int q = 1; q <= Q; q++)
  {
    int p, q2;
    cin >> p >> q2;
    for (int i = 1; i <= q2; i++)
    {
      int r; cin >> r;
      not_taken[r] = q;
    }
    ///////////////////////////
    if (q2 < B)
    {
      int ans = -1;
      for (auto i : dist[p])
      {
        if (not_taken[i.second] == q )
          continue;
        ans = i.first;
        break;
      }
      cout << ans << '\n';
    }
    else
    {
      for (int i = 1; i <= p; i++)
      {
        dp[i] = 0;
      }
      for (int i = 1; i <= p; i++)
      {
        if (not_taken[i] == q && dp[i] == 0)
          continue;
        for (auto child : gr[i])
        {
          dp[child] = max(dp[child], dp[i] + 1);
        }
      }
      if (not_taken[p] == q && dp[p] == 0)
        dp[p] = -1;
      cout << dp[p] << '\n';
    }


  }

}

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