Submission #9161

#TimeUsernameProblemLanguageResultExecution timeMemory
9161kcm1700Your life (kriii2_Y)C++14
4 / 4
76 ms7116 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...