# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47765 | mirbek01 | Bitaro’s Party (JOI18_bitaro) | C++17 | 5 ms | 2804 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 2;
int n, m, q, used[N], dp[N], cnt[N];
vector <int> g[N];
int main(){
cin >> n >> m >> q;
for(int i = 0; i < m; i ++){
int u, v;
scanf("%d %d", &u, &v);
g[v].push_back(u);
}
while(q --){
int t, y;
cin >> t >> y;
vector <int> v;
for(int i = 1; i <= y; i ++){
int x;
cin >> x;
v.push_back(x);
used[x] = 1;
}
for(int i = 1; i <= t; i ++){
dp[i] = 0;
for(int to : g[i]){
if(!used[to]) cnt[i] ++;
if(cnt[to] || !used[to])
dp[i] = max(dp[i], dp[to] + 1);
}
}
if(dp[t] == 0 && used[t]) dp[t] --;
cout << dp[t] << endl;
for(int i : v)
used[i] = 0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |