제출 #864424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864424		vjudge1	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	2005 ms	9080 KiB

bitaro

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, m, q;
    cin >> n >> m >> q;

    vector<vector<int> > graph(n+1);

    for(int i=0; i<m; i++) {
        int a, b;
        cin >> a >> b;
        graph[b].push_back(a);
    }

    while(q--) {
        int ep, c;
        cin >> ep >> c;
        vector<bool> bad(n+1, 0);

        for(int i=0; i<c; i++) {
            int x;
            cin >> x;
            bad[x] = 1;
        }

        vector<int> dp(n+1, -1);
        dp[ep] = 0;

        int ans = -1;

        for(int i=ep; i>=1; i--) {
            if(dp[i] == -1) continue;
            if(!bad[i]) ans = max(ans, dp[i]);
            for(int &v : graph[i]) dp[v] = max(dp[v], dp[i] + 1);
        }

        cout << ans << '\n';
    }

    return 0;
}

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