Submission #9511

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9511	2014-09-28T06:56:00 Z	levant916	Your life (kriii2_Y)	C++	0 / 4	0 ms	2068 KB

Y

#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

int dp[100001];
int M, N;
typedef pair<int, int> PAIR;


bool cmp(PAIR x, PAIR y)  {
	if (x.first < y.first){
		return true;
	}
	else if (x.first == y.first) {
		return x.second < y.second;
	}
	else {
		return false;
	}
}
int main(void) {

	int x, y;
	vector<PAIR> edge;
	cin >> N >> M;

	for (int i = 0; i < M; i++) {
		cin >> x >> y;
		edge.push_back(PAIR(x, y));
	}

	sort(edge.begin(), edge.end(), cmp);

	for (vector<PAIR>::iterator itor = edge.begin(); itor != edge.end(); itor++) {
		x = itor->first; y = itor->second;
		if (x != 1 && dp[x] == 0) continue;
		if (dp[y] == 0) {
			dp[y] = dp[x] + 1;
		}
		else if (dp[y] > dp[x] + 1){
			dp[y] = dp[x] + 1;
		}
	}


	cout << dp[N] << endl;


	return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2068 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Halted	0 ms	0 KB	-