Submission #9169

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9169	2014-09-28T04:19:17 Z	ainu7	Your life (kriii2_Y)	C++	4 / 4	232 ms	7580 KB

Y

#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;
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1676 KB	Output is correct
2	Correct	0 ms	1676 KB	Output is correct
3	Correct	0 ms	1676 KB	Output is correct
4	Correct	0 ms	1676 KB	Output is correct
5	Correct	0 ms	1676 KB	Output is correct
6	Correct	0 ms	1676 KB	Output is correct
7	Correct	0 ms	1676 KB	Output is correct
8	Correct	0 ms	1676 KB	Output is correct
9	Correct	0 ms	1676 KB	Output is correct
10	Correct	56 ms	2204 KB	Output is correct

Subtask #2

3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	4412 KB	Output is correct
2	Correct	96 ms	7448 KB	Output is correct
3	Correct	148 ms	7448 KB	Output is correct
4	Correct	152 ms	7448 KB	Output is correct
5	Correct	136 ms	7448 KB	Output is correct
6	Correct	104 ms	7448 KB	Output is correct
7	Correct	100 ms	7448 KB	Output is correct
8	Correct	224 ms	7580 KB	Output is correct
9	Correct	136 ms	7448 KB	Output is correct
10	Correct	232 ms	7184 KB	Output is correct