This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<int> > P(N+1);
for (int i=0; i<M; i++) {
int x, y;
cin >> x >> y;
P[x].push_back(y);
}
vector<int> res(N+1, -1);
res[1] = 0;
for (int i=1; i<=N; i++) {
if (res[i] == -1) continue;
for (int j=0; j<P[i].size(); j++) {
int k = P[i][j];
if (res[k] == -1 || (res[i]+1 < res[k]))
res[k] = res[i]+1;
}
}
cout << res[N] << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |