Submission #9214

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9214	2014-09-28T04:46:02 Z	shashack	Your life (kriii2_Y)	C++	0 / 4	0 ms	1672 KB

Y

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

#define VAL first
#define U second.first
#define V second.second
#define IN(a, b, c) make_pair(a, make_pair(b, c))

int main(){
	int N, M; cin >> N >> M;
	vector<vector<int> >adj(N+1);
	vector<bool> visit(N + 1, false);
	for (int i = 0; i < M; i++) {
		int u, v; cin >> u >> v;
		adj[u].push_back(v);
	}
	priority_queue <pair<int, pair<int, int> > >pq;
	pq.push(IN(0, 0, 1));

	while (true){
		int val = -pq.top().VAL;
		int u = pq.top().U;
		int v = pq.top().V;
		pq.pop();

		for (int i = 0; i < adj[v].size(); i++){
			if (!visit[adj[v][i]]) {
				if (adj[v][i] == N) {
					cout << val + 1 << endl;
					return 0;
				}
				visit[adj[v][i]] = true;
				pq.push(IN(-(val + 1), v, adj[v][i]));
			}
		}
	}
	return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	0 ms	1672 KB	SIGSEGV Segmentation fault
2	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 3.0

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