結果

問題 No.5016 Worst Mayor
ユーザー e869120e869120
提出日時 2023-04-29 16:41:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 242 ms / 2,000 ms
コード長 8,756 bytes
コンパイル時間 1,141 ms
コンパイル使用メモリ 91,616 KB
実行使用メモリ 26,264 KB
スコア 24,150,604,394
平均クエリ数 400.00
最終ジャッジ日時 2023-04-29 16:41:22
合計ジャッジ時間 15,734 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 221 ms
25,372 KB
testcase_01 AC 216 ms
25,608 KB
testcase_02 AC 215 ms
25,512 KB
testcase_03 AC 215 ms
25,648 KB
testcase_04 AC 217 ms
25,800 KB
testcase_05 AC 214 ms
25,376 KB
testcase_06 AC 215 ms
25,748 KB
testcase_07 AC 217 ms
25,712 KB
testcase_08 AC 216 ms
25,996 KB
testcase_09 AC 214 ms
26,136 KB
testcase_10 AC 215 ms
25,816 KB
testcase_11 AC 216 ms
25,396 KB
testcase_12 AC 216 ms
26,176 KB
testcase_13 AC 213 ms
25,548 KB
testcase_14 AC 214 ms
26,048 KB
testcase_15 AC 214 ms
25,480 KB
testcase_16 AC 217 ms
26,056 KB
testcase_17 AC 215 ms
25,452 KB
testcase_18 AC 216 ms
25,880 KB
testcase_19 AC 216 ms
25,652 KB
testcase_20 AC 241 ms
25,732 KB
testcase_21 AC 221 ms
26,016 KB
testcase_22 AC 224 ms
25,524 KB
testcase_23 AC 242 ms
25,372 KB
testcase_24 AC 215 ms
26,048 KB
testcase_25 AC 216 ms
25,772 KB
testcase_26 AC 214 ms
26,264 KB
testcase_27 AC 216 ms
25,644 KB
testcase_28 AC 216 ms
25,652 KB
testcase_29 AC 215 ms
26,140 KB
testcase_30 AC 213 ms
25,900 KB
testcase_31 AC 216 ms
25,360 KB
testcase_32 AC 214 ms
25,640 KB
testcase_33 AC 215 ms
25,916 KB
testcase_34 AC 217 ms
25,756 KB
testcase_35 AC 215 ms
25,660 KB
testcase_36 AC 235 ms
25,716 KB
testcase_37 AC 214 ms
25,984 KB
testcase_38 AC 216 ms
25,704 KB
testcase_39 AC 239 ms
26,032 KB
testcase_40 AC 240 ms
25,576 KB
testcase_41 AC 214 ms
26,000 KB
testcase_42 AC 236 ms
25,668 KB
testcase_43 AC 216 ms
25,592 KB
testcase_44 AC 239 ms
25,684 KB
testcase_45 AC 216 ms
25,544 KB
testcase_46 AC 216 ms
25,612 KB
testcase_47 AC 215 ms
25,648 KB
testcase_48 AC 216 ms
26,112 KB
testcase_49 AC 240 ms
25,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <tuple>
#include <cmath>
#include <algorithm>
using namespace std;

// Input Information
int DEBUG = 1;
int N, T;
int A[3009], B[3009], C[3009], D[3009];
int CurrentMoney, DebugMoney = 1000000;
int CurrentCorps, DebugCorps = 1;

// Other Variables
int Build[1009];
int Money[2000009];
int Cost[199][199];
int D1[15][16];
int D2[16][15];

// Edge List
tuple<int, int, int, int> Edge[80];
tuple<int, int, int, int> EdgeList[80] = {
	make_tuple(0, 2, 1, 2),
	make_tuple(1, 2, 2, 2),
	make_tuple(1, 7, 2, 7),
	make_tuple(1, 9, 2, 9),
	make_tuple(1, 10, 2, 10),
	make_tuple(1, 12, 2, 12),
	make_tuple(2, 1, 3, 1),
	make_tuple(2, 9, 3, 9),
	make_tuple(2, 12, 3, 12),
	make_tuple(3, 1, 4, 1),
	make_tuple(3, 3, 4, 3),
	make_tuple(3, 4, 4, 4),
	make_tuple(3, 5, 4, 5),
	make_tuple(3, 9, 4, 9),
	make_tuple(4, 2, 5, 2),
	make_tuple(4, 6, 5, 6),
	make_tuple(4, 7, 5, 7),
	make_tuple(4, 9, 5, 9),
	make_tuple(5, 1, 6, 1),
	make_tuple(5, 7, 6, 7),
	make_tuple(5, 8, 6, 8),
	make_tuple(5, 9, 6, 9),
	make_tuple(5, 10, 6, 10),
	make_tuple(5, 11, 6, 11),
	make_tuple(6, 2, 7, 2),
	make_tuple(6, 9, 7, 9),
	make_tuple(6, 11, 7, 11),
	make_tuple(7, 1, 8, 1),
	make_tuple(7, 11, 8, 11),
	make_tuple(8, 3, 9, 3),
	make_tuple(8, 12, 9, 12),
	make_tuple(9, 2, 10, 2),
	make_tuple(9, 12, 10, 12),
	make_tuple(10, 1, 11, 1),
	make_tuple(10, 9, 11, 9),
	make_tuple(10, 10, 11, 10),
	make_tuple(10, 12, 11, 12),
	make_tuple(11, 1, 12, 1),
	make_tuple(11, 11, 12, 11),
	make_tuple(12, 3, 13, 3),
	make_tuple(1, 1, 1, 2),
	make_tuple(1, 6, 1, 7),
	make_tuple(1, 9, 1, 10),
	make_tuple(2, 1, 2, 2),
	make_tuple(2, 7, 2, 8),
	make_tuple(2, 8, 2, 9),
	make_tuple(2, 10, 2, 11),
	make_tuple(2, 11, 2, 12),
	make_tuple(3, 3, 3, 4),
	make_tuple(3, 12, 3, 13),
	make_tuple(4, 1, 4, 2),
	make_tuple(4, 2, 4, 3),
	make_tuple(4, 4, 4, 5),
	make_tuple(4, 5, 4, 6),
	make_tuple(5, 1, 5, 2),
	make_tuple(5, 6, 5, 7),
	make_tuple(5, 7, 5, 8),
	make_tuple(5, 10, 5, 11),
	make_tuple(6, 1, 6, 2),
	make_tuple(6, 2, 6, 3),
	make_tuple(6, 8, 6, 9),
	make_tuple(6, 9, 6, 10),
	make_tuple(7, 1, 7, 2),
	make_tuple(8, 1, 8, 2),
	make_tuple(8, 2, 8, 3),
	make_tuple(8, 10, 8, 11),
	make_tuple(8, 11, 8, 12),
	make_tuple(8, 12, 8, 13),
	make_tuple(9, 2, 9, 3),
	make_tuple(10, 1, 10, 2),
	make_tuple(10, 2, 10, 3),
	make_tuple(10, 9, 10, 10),
	make_tuple(11, 7, 11, 8),
	make_tuple(11, 8, 11, 9),
	make_tuple(11, 10, 11, 11),
	make_tuple(11, 11, 11, 12),
	make_tuple(12, 1, 12, 2),
	make_tuple(12, 2, 12, 3),
	make_tuple(12, 11, 12, 12),
	make_tuple(13, 4, 13, 5),
};

// Initialize Money
void Initialize() {
	for (int i = 0; i <= 1000; i++) {
		for (int j = 0; j < 1000; j++) {
			Money[1000 * i + 223 * j] = 60 * j;
		}
	}
	for (int i = 1; i <= 1000; i++) {
		Build[i] = (int)(10000000.0 / sqrt(1.0 * i));
	}
}

// Get Total Earned Money
int GetEarnedMoney() {
	for (int i = 0; i < 199; i++) {
		for (int j = 0; j < 199; j++) Cost[i][j] = 1000000;
		Cost[i][i] = 0;
	}

	// Initialize Cost
	for (int i = 0; i < 13; i++) {
		for (int j = 0; j < 14; j++) {
			int a1 = (i + 0) * 14 + (j + 0);
			int a2 = (i + 1) * 14 + (j + 0);
			if (D1[i][j] == 1) {
				Cost[a1][a2] = 223;
				Cost[a2][a1] = 223;
			}
			else {
				Cost[a1][a2] = 1000;
				Cost[a2][a1] = 1000;
			}
		}
	}
	for (int i = 0; i < 14; i++) {
		for (int j = 0; j < 13; j++) {
			int a1 = (i + 0) * 14 + (j + 0);
			int a2 = (i + 0) * 14 + (j + 1);
			if (D2[i][j] == 1) {
				Cost[a1][a2] = 223;
				Cost[a2][a1] = 223;
			}
			else {
				Cost[a1][a2] = 1000;
				Cost[a2][a1] = 1000;
			}
		}
	}

	// Warshall-Floyd
	for (int k = 0; k < 196; k++) {
		for (int i = 0; i < 196; i++) {
			for (int j = 0; j < 196; j++) Cost[i][j] = min(Cost[i][j], Cost[i][k] + Cost[k][j]);
		}
	}
	int sum = 0;
	for (int i = 1; i <= N; i++) {
		int pos1 = (A[i] - 1) * 14 + (B[i] - 1);
		int pos2 = (C[i] - 1) * 14 + (D[i] - 1);
		sum += Money[Cost[pos1][pos2]];
	}
	return sum;
}

void Ask(int a1, int a2, int a3, int a4, int a5) {
	if (DEBUG == 1) {
		if (a1 == 1) cout << a1 << " " << a2 << " " << a3 << " " << a4 << " " << a5 << endl;
		if (a1 == 2) cout << a1 << endl;
		if (a1 == 3) cout << a1 << endl;
	}
	if (DEBUG == 2) {
		if (a1 == 1) {
			if (a2 > a4) { swap(a2, a4); swap(a3, a5); }
			if (a3 > a5) { swap(a2, a4); swap(a3, a5); }
			if (a3 == a5) D1[a2 - 1][a3 - 1] = 1;
			if (a2 == a4) D2[a2 - 1][a3 - 1] = 1;
			DebugMoney -= Build[DebugCorps];
		}
		if (a1 == 2) {
			DebugCorps += 1;
		}
		if (a1 == 3) {
			DebugMoney += 50000;
		}
		DebugMoney += GetEarnedMoney();
	}
}

double Randouble() {
	double s = 0, t = 1;
	for (int i = 0; i < 3; i++) {
		t /= 1024.0;
		s += 1.0 * (rand() % 1024) * t;
	}
	return s;
}

int main() {
	// Input
	Initialize();
	cin >> N >> T;
	for (int i = 1; i <= N; i++) cin >> A[i] >> B[i] >> C[i] >> D[i];

	// Brute Force
	int MaxScore = 0;
	for (int i = 0; i < 8; i++) {
		for (int j = 0; j < 13; j++) {
			for (int k = 0; k < 14; k++) D1[j][k] = 0;
			for (int k = 0; k < 14; k++) D2[k][j] = 0;
		}
		for (int j = 0; j < 80; j++) {
			int px1 = get<0>(EdgeList[j]);
			int py1 = get<1>(EdgeList[j]);
			int px2 = get<2>(EdgeList[j]);
			int py2 = get<3>(EdgeList[j]);
			if (px1 == px2) D2[px1][min(py1, py2)] = 1;
			if (py1 == py2) D1[min(px1, px2)][py1] = 1;
		}
		int CandScore = GetEarnedMoney();
		if (MaxScore < CandScore) {
			MaxScore = CandScore;
			for (int j = 0; j < 80; j++) Edge[j] = EdgeList[j];
		}

		// Rotate
		for (int j = 0; j < 80; j++) {
			int px1 = get<0>(EdgeList[j]);
			int py1 = get<1>(EdgeList[j]);
			int px2 = get<2>(EdgeList[j]);
			int py2 = get<3>(EdgeList[j]);
			EdgeList[j] = make_tuple(13 - py1, px1, 13 - py2, px2);
		}
		if (i % 4 == 3) {
			for (int j = 0; j < 80; j++) {
				int px1 = get<0>(EdgeList[j]);
				int py1 = get<1>(EdgeList[j]);
				int px2 = get<2>(EdgeList[j]);
				int py2 = get<3>(EdgeList[j]);
				EdgeList[j] = make_tuple(13 - px1, py1, 13 - px2, py2);
			}
		}
	}

	// Initialize Shortest Distance
	vector<bool> Used(80, false);
	vector<vector<int>> Shortest(196, vector<int>(196, 1000000));
	for (int i = 0; i < 196; i++) Shortest[i][i] = 0;
	for (int i = 0; i < 13; i++) {
		for (int j = 0; j < 14; j++) {
			Shortest[i * 14 + j][(i + 1) * 14 + j] = 1000;
			Shortest[(i + 1) * 14 + j][i * 14 + j] = 1000;
			Shortest[j * 14 + i][j * 14 + (i + 1)] = 1000;
			Shortest[j * 14 + (i + 1)][j * 14 + i] = 1000;
		}
	}
	for (int k = 0; k < 196; k++) {
		for (int i = 0; i < 196; i++) {
			for (int j = 0; j < 196; j++) Shortest[i][j] = min(Shortest[i][j], Shortest[i][k] + Shortest[k][j]);
		}
	}

	// Reset D1, D2 for Debug
	for (int i = 0; i < 13; i++) {
		for (int j = 0; j < 14; j++) D1[i][j] = 0;
	}
	for (int i = 0; i < 14; i++) {
		for (int j = 0; j < 13; j++) D2[i][j] = 0;
	}

	// Answer Query
	int BuiltRoads = 0;
	for (int i = 1; i <= T; i++) {
		if (DEBUG == 1) {
			cin >> CurrentMoney >> CurrentCorps;
			if (CurrentMoney == -1 && CurrentCorps == -1) break;
		}
		if (DEBUG == 2) {
			CurrentMoney = DebugMoney;
			CurrentCorps = DebugCorps;
		}
		fprintf(stderr, "Turn =% 4d, Money=% 10d, Corps =% 3d, Roads =% 3d/%d\n", i, CurrentMoney, CurrentCorps, BuiltRoads, 80);

		// Get Acts
		if (i <= 50) {
			Ask(2, -1, -1, -1, -1);
		}
		else if (BuiltRoads == 80) {
			Ask(3, -1, -1, -1, -1);
		}
		else if (BuiltRoads >= 3 && CurrentMoney < Build[CurrentCorps]) {
			Ask(2, -1, -1, -1, -1);
		}
		else if (BuiltRoads <= 2 && CurrentMoney < Build[CurrentCorps]) {
			Ask(3, -1, -1, -1, -1);
		}
		else {
			int CurrentScore = -1;
			int CurrentID = 0;
			for (int j = 0; j < 80; j++) {
				if (Used[j] == true) continue;
				int sum = 0;
				int edge1 = get<0>(Edge[j]) * 14 + get<1>(Edge[j]);
				int edge2 = get<2>(Edge[j]) * 14 + get<3>(Edge[j]);
				for (int k = 1; k <= N; k++) {
					int pos1 = (A[k] - 1) * 14 + (B[k] - 1);
					int pos2 = (C[k] - 1) * 14 + (D[k] - 1);
					int v1 = Shortest[pos1][pos2];
					int v2 = Shortest[pos1][edge1] + 223 + Shortest[edge2][pos2];
					int v3 = Shortest[pos1][edge2] + 223 + Shortest[edge1][pos2];
					sum += Money[min({ v1, v2, v3 })];
				}
				if (CurrentScore < sum) {
					CurrentScore = sum;
					CurrentID = j;
				}
			}
			Ask(1, get<0>(Edge[CurrentID]) + 1, get<1>(Edge[CurrentID]) + 1, get<2>(Edge[CurrentID]) + 1, get<3>(Edge[CurrentID]) + 1);
			BuiltRoads += 1;
			Used[CurrentID] = true;
			int edgeA = get<0>(Edge[CurrentID]) * 14 + get<1>(Edge[CurrentID]);
			int edgeB = get<2>(Edge[CurrentID]) * 14 + get<3>(Edge[CurrentID]);
			for (int j = 0; j < 196; j++) {
				for (int k = 0; k < 196; k++) {
					int v1 = Shortest[j][k];
					int v2 = Shortest[j][edgeA] + 223 + Shortest[edgeB][k];
					int v3 = Shortest[j][edgeB] + 223 + Shortest[edgeA][k];
					Shortest[j][k] = min({ v1,v2,v3 });
				}
			}
		}
	}
	return 0;
}
0