# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9161 | kcm1700 | Your life (kriii2_Y) | C++14 | 76 ms | 7116 KiB |
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 <cstdio>
#include <algorithm>
using namespace std;
int n,m;
int dt[100303];
vector<int> jump[100330];
int main(){
scanf("%d%d",&n,&m);
for(int i = 0; i < m; i++) {
int x,y;
scanf("%d%d",&x,&y);
jump[x].push_back(y);
}
dt[1] = 1;
for(int i = 1; i <= n; i++) {
if (dt[i] == 0) continue;
for(auto v : jump[i]) {
if (dt[v] == 0 || dt[v] > dt[i] + 1){
dt[v] = dt[i] + 1;
}
}
}
printf("%d\n",dt[n]-1);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |