Submission #548935

#	Time	Username	Problem	Language	Result	Execution time	Memory
548935		Deepesson	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	2076 ms	9164 KiB

bitaro

#include <bits/stdc++.h>
#define MAX 105000
#define SQRT 320
int N,M,Q;
std::vector<int> con[MAX];
int processa(int fim,int B,int* bloqueia){
    int ans[MAX]={};
    for(int i=0;i!=B;++i)ans[bloqueia[i]]=-1000000;
    for(int i=0;i!=fim+1;++i){
        for(auto&x:con[i]){
            ans[i]=std::max(ans[i],ans[x]+1);
        }
    }
    if(ans[fim]<0)return -1;
    return ans[fim];
}
int resp[MAX];
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);
    std::cin>>N>>M>>Q;
    for(int i=0;i!=M;++i){
        int S,E;
        std::cin>>S>>E;
        --S;--E;
        con[E].push_back(S);
    }
    for(int i=0;i!=Q;++i){
        int S,B;
        std::cin>>S>>B;--S;
        int array[B];for(auto&x:array){std::cin>>x;--x;}
        resp[i]=processa(S,B,array);
    }
    for(int i=0;i!=Q;++i){
        std::cout<<resp[i]<<"\n";
    }
}

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