結果

問題 No.867 避難経路
ユーザー hirakich1000000007hirakich1000000007
提出日時 2019-08-15 22:50:09
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,574 ms / 6,000 ms
コード長 9,777 bytes
コンパイル時間 999 ms
コンパイル使用メモリ 90,468 KB
実行使用メモリ 26,624 KB
最終ジャッジ日時 2024-09-19 15:43:35
合計ジャッジ時間 33,098 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 914 ms
26,624 KB
testcase_16 AC 887 ms
26,112 KB
testcase_17 AC 953 ms
26,496 KB
testcase_18 AC 896 ms
26,368 KB
testcase_19 AC 920 ms
26,624 KB
testcase_20 AC 262 ms
25,004 KB
testcase_21 AC 256 ms
25,136 KB
testcase_22 AC 277 ms
25,152 KB
testcase_23 AC 277 ms
25,216 KB
testcase_24 AC 270 ms
25,024 KB
testcase_25 AC 330 ms
24,572 KB
testcase_26 AC 318 ms
24,692 KB
testcase_27 AC 327 ms
24,564 KB
testcase_28 AC 310 ms
24,700 KB
testcase_29 AC 318 ms
24,568 KB
testcase_30 AC 1,392 ms
24,580 KB
testcase_31 AC 1,490 ms
25,116 KB
testcase_32 AC 1,506 ms
24,992 KB
testcase_33 AC 1,427 ms
25,108 KB
testcase_34 AC 1,427 ms
24,564 KB
testcase_35 AC 1,574 ms
24,692 KB
testcase_36 AC 1,570 ms
24,672 KB
testcase_37 AC 1,447 ms
24,516 KB
testcase_38 AC 1,435 ms
24,628 KB
testcase_39 AC 1,421 ms
24,472 KB
testcase_40 AC 1,399 ms
24,628 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 2 ms
5,376 KB
testcase_43 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:6:32: warning: option '-Wincompatible-pointer-types' is valid for C/ObjC but not for C++ [-Wpragmas]
    6 | #pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
      |                                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

#if 0
cat <<EOF >mistaken-paste
#endif
// thx Ebi-chan!

#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>

#define BIG 2000000007
#define VERYBIG 20000000000000007LL

#define MOD 1000000007
#define FOD  998244353
typedef uint64_t ull;
typedef  int64_t sll;

#define N_MAX 1048576

#ifdef __cplusplus
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <functional>
#include <array>

using std::queue;
using std::priority_queue;
using std::stack;
using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
using std::get;

template <typename T, typename U>
pair<T, U> operator+(pair<T, U> l, pair<T, U> r) {
	return pair<T, U>(l.first + r.first, l.second + r.second);
}

#endif

#ifndef M_PI
#define M_PI 3.14159265358979323846264338327950
#endif

typedef struct {
	sll a;
	sll b;
} hwll;

typedef struct {
	sll a;
	sll b;
	sll c;
} hwllc;

typedef struct {
	hwll a;
	hwll b;
} linell;

typedef struct {
	double a;
	double b;
} hwreal;

sll n, m;
sll h, w;
sll k;
sll q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;

ull umin (ull x, ull y) {
	return (x < y) ? x : y;
}

ull umax (ull x, ull y) {
	return (x > y) ? x : y;
}

sll smin (sll x, sll y) {
	return (x < y) ? x : y;
}

sll smax (sll x, sll y) {
	return (x > y) ? x : y;
}

ull gcd (ull x, ull y) {
	if (y == 0) {
		return x;
	} else {
		return gcd(y, x % y);
	}
}

ull bitpow (ull a, ull x, ull modulo) {
	ull result = 1;
	while (x) {
		if (x & 1) {
			result *= a;
			result %= modulo;
		}
		x /= 2;
		a = (a * a) % modulo;
	}
	return result;
}

ull divide (ull a, ull b, ull modulo) {
	return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}

ull udiff (ull a, ull b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

sll sdiff (sll a, sll b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

int bitcount (ull n) {
	int result = 0;
	while (n) {
		if (n & 1) result++;
		n /= 2;
	}
	return result;
}

#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)
#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right
#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1

// int32_t pullcomp (const void *left, const void *right) {
// 	ull l = *(ull*)left;
// 	ull r = *(ull*)right;
// 	if (l < r) {
// 		return -1;
// 	}
// 	if (l > r) {
// 		return +1;
// 	}
// 	return 0;
// }
BEGCMP(pullcomp){
	DEFLR(ull);
	CMPRET(l, r);
	return 0;
}
BEGCMP(prevcomp){
	DEFLR(sll);
	CMPRET(r, l);
	return 0;
}
BEGCMP(psllcomp){
	DEFLR(sll);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pcharcomp){
	DEFLR(char);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pdoublecomp){
	DEFLR(double);
	CMPRET(l, r);
	return 0;
}

int32_t pstrcomp (const void *left, const void *right) {
	char* l = *(char**)left;
	char* r = *(char**)right;

	return strcmp(l, r);
}

BEGCMP(phwllABcomp){
	DEFLR(hwll);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}
BEGCMP(phwllREVcomp){
	DEFLR(hwll);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	return 0;
}
BEGCMP(ptriplecomp){
	DEFLR(hwllc);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	CMPRET(l.c, r.c);
	return 0;
}
BEGCMP(ptripleREVcomp){
	DEFLR(hwllc);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	CMPRET(l.c, r.c);
	return 0;
}
BEGCMP(ptripleCABcomp){
	DEFLR(hwllc);
	CMPRET(l.c, r.c);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}
BEGCMP(phwrealcomp){
	DEFLR(hwreal);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}

int32_t pquadcomp (const void *left, const void *right) {
	linell l = *(linell*)left;
	linell r = *(linell*)right;

	sll ac = phwllABcomp(&(l.a), &(r.a));
	if (ac) return ac;
	sll bc = phwllABcomp(&(l.b), &(r.b));
	if (bc) return bc;

	return 0;
}
int32_t pfracomp (const void *left, const void *right) {
	hwllc l = *(hwllc*)left;
	hwllc r = *(hwllc*)right;

	CMPRET(l.a * r.b, l.b * r.a);
	return 0;
}
bool isinrange (sll left, sll x, sll right) {
	return (left <= x && x <= right);
}

bool isinrange_soft (sll left, sll x, sll right) {
	return (left <= x && x <= right) || (left >= x && x >= right);
}

void sw (sll *l, sll *r) {
	sll t = *l;
	*l = *r;
	*r = t;
}

ull frac[N_MAX * 3], invf[N_MAX * 3];
ull ncr (sll n, sll r, ull m) {
	if (n < 0 || r < 0 || n < r) return 0;
	return frac[n] * (invf[r] * invf[n - r] % m) % m;
}

sll a[N_MAX + 5];
// ull a[N_MAX + 5];
// sll a[3001][3001];
sll b[N_MAX + 5];
// ull b[N_MAX + 5];
// sll b[3001][3001];
sll c[N_MAX + 5];
sll d[N_MAX + 5];
sll e[N_MAX * 4];
char s[N_MAX + 1];
// char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
char u[N_MAX + 1];
hwll xy[N_MAX + 5];
hwllc tup[N_MAX + 5];
sll table[3005][3005];
ull gin[N_MAX];
// here we go

ull dp[2019][2019];

vector<sll> g[300];

sll dist[300][300];
typedef pair<sll, sll> P;
typedef pair<sll, P> T;

void dijk (sll k) {
	for (sll i = 0; i < h; i++) {
		for (sll j = 0; j < w; j++) {
			dist[i][j] = VERYBIG;
		}
	}
	dist[va][vb] = k * k + table[va][vb];

	priority_queue<T, vector<T>, greater<T> > que;
	que.push(T(k * k + table[va][vb], P(va, vb)));
	while (!que.empty()) {
		T t = que.top();
		que.pop();

		sll cost = t.first;
		sll hi = t.second.first;
		sll wi = t.second.second;
		if (cost > dist[hi][wi]) continue;

		sll newc;
		if (hi) {
			newc = cost + table[hi - 1][wi] + k * k;
			if (newc < dist[hi - 1][wi]) {
				dist[hi - 1][wi] = newc;
				que.push(T(newc, P(hi - 1, wi)));
			}
		}
		if (hi < h - 1) {
			newc = cost + table[hi + 1][wi] + k * k;
			if (newc < dist[hi + 1][wi]) {
				dist[hi + 1][wi] = newc;
				que.push(T(newc, P(hi + 1, wi)));
			}
		}
		if (wi) {
			newc = cost + table[hi][wi - 1] + k * k;
			if (newc < dist[hi][wi - 1]) {
				dist[hi][wi - 1] = newc;
				que.push(T(newc, P(hi, wi - 1)));
			}
		}
		if (wi < w - 1) {
			newc = cost + table[hi][wi + 1] + k * k;
			if (newc < dist[hi][wi + 1]) {
				dist[hi][wi + 1] = newc;
				que.push(T(newc, P(hi, wi + 1)));
			}
		}
	}
}

ull solve () {
	sll i, j, ki, li;
	// ull result = 0;
	sll result = 0;
	double dresult = 0;
	// ull maybe = 0;
	sll maybe = 0;
	// ull sum = 0;
	sll sum = 0;
	sll item;
	sll *dpcell;

	scanf("%lld", &q);
	for (i = 0; i < q; i++) {
		scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
		a[i]--;
		b[i]--;
	}
	ull greed = 229;
	for (i = 0; i < q; i++) {
		if (c[i] > greed) {
			g[greed + 1].push_back(i);
		} else {
			g[c[i]].push_back(i);
		}
	}
	for (i = 1; i <= greed; i++) {
		if (g[i].empty()) continue;

		dijk(i);

		for (sll v : g[i]) {
			d[v] = dist[a[v]][b[v]];
		}
	}

	for (i = 0; i < h; i++) {
		for (j = 0; j < w; j++) {
			dist[i][j] = VERYBIG;
		}
	}
	dist[va][vb] = table[va][vb];
	for (i = va - 1; i >= 0; i--) {
		dist[i][vb] = dist[i + 1][vb] + table[i][vb];
	}
	for (i = va + 1; i < h; i++) {
		dist[i][vb] = dist[i - 1][vb] + table[i][vb];
	}
	for (j = vb - 1; j >= 0; j--) {
		dist[va][j] = dist[va][j + 1] + table[va][j];
	}
	for (j = vb + 1; j < w; j++) {
		dist[va][j] = dist[va][j - 1] + table[va][j];
	}
	for (i = va - 1; i >= 0; i--) {
		for (j = vb - 1; j >= 0; j--) {
			dist[i][j] = smin(dist[i + 1][j], dist[i][j + 1]) + table[i][j];
		}
		for (j = vb + 1; j < w; j++) {
			dist[i][j] = smin(dist[i + 1][j], dist[i][j - 1]) + table[i][j];
		}
	}
	for (i = va + 1; i < h; i++) {
		for (j = vb - 1; j >= 0; j--) {
			dist[i][j] = smin(dist[i - 1][j], dist[i][j + 1]) + table[i][j];
		}
		for (j = vb + 1; j < w; j++) {
			dist[i][j] = smin(dist[i - 1][j], dist[i][j - 1]) + table[i][j];
		}
	}

	for (sll v : g[greed + 1]) {
		d[v] = dist[a[v]][b[v]] + c[v] * c[v] * (sdiff(a[v], va) + sdiff(b[v], vb) + 1);
	}

	for (i = 0; i < q; i++) {
		printf("%lld\n", d[i]);
	}

	// printf("%lld\n", result);
	// printf("%.15f\n", dresult);
	// puts(s);

	return 0;

	success:
	// puts("YES");
	puts("Yes");
	// printf("%llu\n", result);
	// puts("0");
	// puts("First");
	return 0;

	fail:
	// puts("NO");
	puts("No");
	// puts("0");
	// puts("-1");
	// puts("-1 -1 -1");
	// puts("Second");
	return 1;
}

int32_t main (int argc, char *argv[]) {
	int32_t i, j;

	n = 4;
	m = 0;

	// scanf("%llu", &m);
	scanf("%llu%llu", &h, &w);
	// scanf("%llu", &n, &m);
	// scanf("%llu", &k, &n, &m);
	// scanf("%llu%llu", &h, &w);
	// scanf("%llu", &q);
	scanf("%lld%lld", &va, &vb, &vc, &vd);
	va--;
	vb--;
	// scanf("%llu%llu%llu%llu", &ua, &ub, &uc, &ud, &ue);
	// scanf("%s", s);
	// scanf("%s", t);
	// scanf("%s", u);
	// scanf("%llu", &k);
	// scanf("%lld", &m);
	// for (i = 0; i < n; i++) {
	// 	// scanf("%lld", &a[i]);
	// 	scanf("%lld", &d[i]);
	// }
	// scanf("%llu", &q);
	for (i = 0; i < 0; i++) {
		// scanf("%lld%lld", &xy[i].a, &xy[i].b);
		// scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
		// scanf("%lld", &c[i]);

		scanf("%lld", &a[i]);
		// scanf("%lld", &b[i]);
		// scanf("%lld", &c[i]);
		// scanf("%lld", &d[i]);
		// a[i]--;
		// b[i]--;
		// c[i]--;
		// d[i]--;
		// xy[i].a--;
		// xy[i].b--;
		// tup[i].a--;
		// tup[i].b--;
	}
	// scanf("%llu", &m);
	// for (i = 0; i < n; i++) {
	// 	// scanf("%lld%lld", &a[i], &b[i]);
	// 	scanf("%lld", &b[i]);
	// 	// a[i]--;
	// 	// b[i]--;
	// 	// scanf("%lld", &c[i]);
	// 	// scanf("%lld", &d[i]);
	// 	// scanf("%lld", &e[i]);
	// 	// c[i]--;
	// 	// d[i]--;
	// }

	// for (i = 0; i < q; i++) {
	// 	// scanf("%lld%lld", &xy[i].a, &xy[i].b);
	// 	scanf("%lld", &c[i]);
	// 	// xy[i].a--;
	// 	// xy[i].b--;
	// }

	for (i = 0; i < h; i++) {
		for (j = 0; j < w; j++) {
			scanf("%lld", &table[i][j]);
			// table[i][j]--;
		}
	}
	// for (i = 0; i < h; i++) {
	// 	scanf("%s", s[i]);
	// }
	// scanf("%llu", &q);

	solve();

	return 0;
}
0