Submission #14026

#	Time	Username	Problem	Language	Result	Execution time	Memory
14026		gs14004	Your life (kriii2_Y)	C++14	4 / 4	104 ms	7112 KiB

Y

#include <cstdio>
#include <vector>
using namespace std;

vector<int> graph[100005];
int dp[100005];

int main(){
    int n,m;
    scanf("%d %d",&n,&m);
    while (m--) {
        int x,y;
        scanf("%d %d",&x,&y);
        graph[y].push_back(x);
    }
    for (int i=2; i<=n; i++) {
        dp[i] = 1e9;
        for (auto &j : graph[i]){
            dp[i] = min(dp[i],dp[j]+1);
        }
    }
    if(dp[n] > n) puts("-1");
    else printf("%d",dp[n]);
}

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3