제출 #164087

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

bitaro

#include <bits/stdc++.h>

using namespace std;

const int N_MAX = 100002;

int n, m, q;

vector <int> inEdges[N_MAX];

int dp[N_MAX];

int fin;

bool out[N_MAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        inEdges[v].push_back(u);
    }
    while(q--)
    {
        cin >> fin;
        int cnt;
        cin >> cnt;
        memset(out, false, sizeof(out));
        while(cnt--)
        {
            int node;
            cin >> node;
            out[node] = true;
        }
        for(int i = 1; i <= fin; i++)
        {
            dp[i] = -1;
            for(int u : inEdges[i])
                if(dp[u] > -1)
                    dp[i] = max(dp[i], dp[u] + 1);
            if(out[i] == false)
                dp[i] = max(dp[i], 0);
        }
        cout << dp[fin] << "\n";
    }
    return 0;
}

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