제출 #1319995

#제출 시각아이디문제언어결과실행 시간메모리
1319995husseinjuandaBitaro’s Party (JOI18_bitaro)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

int B = 320;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, q; cin >> n >> m >> q;
    vector<vector<int>> g(n+1);
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        // if(a < b){
        //     swap(a, b);
        // }
        g[a].push_back(b);
    }
    while(q--){
        int k; cin >> k;
        int sz; cin >> sz;
        vector<int> j(sz);
        for(int i = 0; i < sz; i++){
            cin >> j[i];
        }
        // if(sz > B){
            vector<int> dp(n+1, 0);
            for(int i = 0; i < sz; i++){
                dp[j[i]] = -1e18;
            }
            for(int i = 1; i < k; i++){
                for(int y = 0; y < g[i].size(); y++){
                    dp[g[i][y]] = max(dp[g[i][y]], dp[i]+1);
                }
            }
            cout << dp[k] << "\n";
        // }
    }
    return 0;
}


#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...