提出 #63290355

---

ソースコード 拡げる

#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <random>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#pragma comment(linker, "/STACK:836777216")

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;

#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define N 400005

vector<vi> g[2];
ll d[N];

int main(void) {
	int n, m;
	ll x;
	scanf("%d%d%lld", &n, &m, &x);
	g[0].resize(n);
	g[1].resize(n);

	REP(i, m) {
		int a, b;
		scanf("%d%d", &a, &b);
		a--, b--;
		g[0][a].pb(b);
		g[1][b].pb(a);
	}

	CL(d, -1);
	d[0] = 0;
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int> > >  q;
	q.push(mp(0, 0));
	while (sz(q)) {
		pair<ll, int> top = q.top();
		q.pop();

		int id = top.Y;
		int v = top.Y / 2;
		int s = top.Y % 2;

		if (d[id] < top.X) {
			continue;
		}

		REP(i, sz(g[s][v])) {
			int u = g[s][v][i];
			if (d[u * 2 + s] == -1 || d[u * 2 + s] > d[id] + 1) {
				d[u * 2 + s] = d[id] + 1;
				q.push(mp(d[u * 2 + s], u * 2 + s));
			}
		}

		REP(i, sz(g[1 - s][v])) {
			int u = g[1 - s][v][i];
			if (d[u * 2 + 1 - s] == -1 || d[u * 2 + 1 - s] > d[id] + x + 1) {
				d[u * 2 + 1 - s] = d[id] + x + 1;
				q.push(mp(d[u * 2 + 1 - s], u * 2 + 1 - s));
			}
		}
	}

	ll ans = d[(n - 1) * 2];
	if (d[(n - 1) * 2 + 1] != -1) {
		if (ans == -1 || ans > d[(n - 1) * 2 + 1]) {
			ans = d[(n - 1) * 2 + 1];
		}
	}

	printf("%lld\n", ans);
}

提出情報

コンパイルエラー

Main.cpp:20: warning: ignoring ‘#pragma comment ’ [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/STACK:836777216")
      | 
Main.cpp: In function ‘int main()’:
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:66:9: note: in expansion of macro ‘REP’
   66 |         REP(i, m) {
      |         ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:66:9: note: in expansion of macro ‘REP’
   66 |         REP(i, m) {
      |         ^~~
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:90:17: note: in expansion of macro ‘REP’
   90 |                 REP(i, sz(g[s][v])) {
      |                 ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:90:17: note: in expansion of macro ‘REP’
   90 |                 REP(i, sz(g[s][v])) {
      |                 ^~~
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:98:17: note: in expansion of macro ‘REP’
   98 |                 REP(i, sz(g[1 - s][v])) {
      |                 ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:98:17: note: in expansion of macro ‘REP’
   98 |                 REP(i, sz(g[1 - s][v])) {
      |                 ^~~
Main.cpp:62:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   62 |         scanf("%d%d%lld", &n, &m, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:68:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   68 |                 scanf("%d%d", &a, &b);
      |                 ~~~~~^~~~~~~~~~~~~~~~

ジャッジ結果