Submission #63280847

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
int n, m, x;
vector<pair<int, int>> edges[400200];
long long dist[400200];
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
int main() {
  scanf ("%d%d%d", &n, &m, &x);
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf ("%d%d", &u, &v);
    edges[u].push_back (make_pair (v, 1));
    edges[n + v].push_back (make_pair (n + u, 1));
  }
  for (int i = 1; i <= n; ++i) {
    edges[i].push_back (make_pair (n + i, x));
    edges[n + i].push_back (make_pair (i, x));
  }
  memset (dist, 127, sizeof (dist));
  dist[1] = 0;
  q.push (make_pair (0, 1));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
int n, m, x;
vector<pair<int, int>> edges[400200];
long long dist[400200];
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
int main() {
	scanf ("%d%d%d", &n, &m, &x);
	for (int i = 1; i <= m; ++i) {
		int u, v;
		scanf ("%d%d", &u, &v);
		edges[u].push_back (make_pair (v, 1));
		edges[n + v].push_back (make_pair (n + u, 1));
	}
	for (int i = 1; i <= n; ++i) {
		edges[i].push_back (make_pair (n + i, x));
		edges[n + i].push_back (make_pair (i, x));
	}
	memset (dist, 127, sizeof (dist));
	dist[1] = 0;
	q.push (make_pair (0, 1));
	while (!q.empty ()) {
		long long dst = q.top ().first;
		int u = q.top ().second;
		q.pop ();
		for (auto [v, w] : edges[u]) {
			if (dst + w < dist[v]) {
				dist[v] = dst + w;
				q.push (make_pair (dst + w, v));
			}
		}
	}
	printf ("%lld\n", min (dist[n], dist[n + n]));
	return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:8:15: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    8 |         scanf ("%d%d%d", &n, &m, &x);
      |         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:11:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   11 |                 scanf ("%d%d", &u, &v);
      |                 ~~~~~~^~~~~~~~~~~~~~~~

Judge Result