제출 #1123660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123660		ZeroCool	Bitaro’s Party (JOI18_bitaro)	C++20	14 / 100	2092 ms	12376 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ar array
#define ld long double

const int INF = 1e18 + 10;
const int N = 2e5 + 20;
const int SQRT = 400;

int n, m, q;
int dp[N];

vector<int> g[N];

void calc(int x){
	memset(dp, -0x3f, sizeof dp);
	dp[x] = 0;
	for(int i = x;i >= 0;i--){
		for(auto u: g[i])dp[u] = max(dp[u], dp[i] + 1);
	}
}

int del[N];

signed main(){ios_base::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m>>q;
	while(m--){
		int a, b;
		cin>>a>>b;
		--a, --b;
		g[b].push_back(a);
	}
	memset(del, -1, sizeof del);
	while(q--){
		int x, y;
		cin>>x>>y;
		--x;
		calc(x);
		while(y--){
			int t;
			cin>>t;
			--t;
			del[t] = q;
		}
		int ans = -1;
		for(int i = 0;i < n;i++){
			if(del[i] != q){
				ans = max(ans, dp[i]);
			}
		}
		cout<<ans<<'\n';
	}
}

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