結果

問題 No.5016 Worst Mayor
ユーザー e869120e869120
提出日時 2023-04-28 22:11:41
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,929 ms / 2,000 ms
コード長 6,833 bytes
コンパイル時間 1,408 ms
コンパイル使用メモリ 97,972 KB
実行使用メモリ 26,436 KB
スコア 23,554,141,328
平均クエリ数 400.00
最終ジャッジ日時 2023-04-29 12:34:06
合計ジャッジ時間 101,771 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,926 ms
26,032 KB
testcase_01 AC 1,902 ms
25,496 KB
testcase_02 AC 1,911 ms
26,280 KB
testcase_03 AC 1,904 ms
25,812 KB
testcase_04 AC 1,899 ms
26,128 KB
testcase_05 AC 1,912 ms
25,692 KB
testcase_06 AC 1,915 ms
26,360 KB
testcase_07 AC 1,912 ms
25,824 KB
testcase_08 AC 1,904 ms
25,760 KB
testcase_09 AC 1,917 ms
26,184 KB
testcase_10 AC 1,922 ms
25,656 KB
testcase_11 AC 1,908 ms
25,912 KB
testcase_12 AC 1,914 ms
26,436 KB
testcase_13 AC 1,912 ms
26,324 KB
testcase_14 AC 1,915 ms
26,104 KB
testcase_15 AC 1,909 ms
25,428 KB
testcase_16 AC 1,909 ms
26,020 KB
testcase_17 AC 1,916 ms
26,176 KB
testcase_18 AC 1,915 ms
26,296 KB
testcase_19 AC 1,906 ms
26,016 KB
testcase_20 AC 1,904 ms
26,268 KB
testcase_21 AC 1,916 ms
25,992 KB
testcase_22 AC 1,920 ms
26,084 KB
testcase_23 AC 1,917 ms
25,652 KB
testcase_24 AC 1,921 ms
25,568 KB
testcase_25 AC 1,915 ms
25,696 KB
testcase_26 AC 1,913 ms
25,780 KB
testcase_27 AC 1,917 ms
25,948 KB
testcase_28 AC 1,929 ms
26,076 KB
testcase_29 AC 1,919 ms
26,072 KB
testcase_30 AC 1,924 ms
25,432 KB
testcase_31 AC 1,906 ms
25,504 KB
testcase_32 AC 1,922 ms
25,892 KB
testcase_33 AC 1,904 ms
25,904 KB
testcase_34 AC 1,909 ms
25,904 KB
testcase_35 AC 1,899 ms
26,224 KB
testcase_36 AC 1,909 ms
25,760 KB
testcase_37 AC 1,901 ms
26,028 KB
testcase_38 AC 1,917 ms
26,088 KB
testcase_39 AC 1,924 ms
26,164 KB
testcase_40 AC 1,920 ms
25,500 KB
testcase_41 AC 1,908 ms
25,708 KB
testcase_42 AC 1,906 ms
25,768 KB
testcase_43 AC 1,922 ms
26,392 KB
testcase_44 AC 1,917 ms
25,508 KB
testcase_45 AC 1,903 ms
26,076 KB
testcase_46 AC 1,914 ms
25,448 KB
testcase_47 AC 1,914 ms
25,720 KB
testcase_48 AC 1,918 ms
25,652 KB
testcase_49 AC 1,908 ms
26,208 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];

// 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;
}

// Set Roads
// Mode = 0: Build Roads on left
// Mode = 1: Build Roads on right
// Mode = 2: Build Roads on up
// Mode = 3: Build Roads on down
void SetRoads(vector<int> vec, int Mode) {
	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;
	}
	for (int i = 0; i < vec.size(); i++) {
		for (int j = 0; j < 13; j++) {
			if (Mode == 0 || Mode == 1) D2[vec[i]][j] = 1;
			if (Mode == 2 || Mode == 3) D1[j][vec[i]] = 1;
		}
	}
	for (int i = 0; i < 13; i++) {
		if (Mode == 0) D1[i][ 0] = 1;
		if (Mode == 1) D1[i][13] = 1;
		if (Mode == 2) D2[ 0][i] = 1;
		if (Mode == 3) D2[13][i] = 1;
	}
}

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 Rectangles
	int NumberOfRoads = 5;
	int Maximum = 0;
	pair<int, int> MaxID = make_pair(-1, -1);
	for (int i = 0; i < 4; i++) {
		vector<bool> Flag(14, false);
		for (int j = 0; j < NumberOfRoads; j++) {
			while (true) {
				int pos = rand() % 14;
				if (Flag[pos] == false) { Flag[pos] = true; break; }
			}
		}

		// Start Yakinamashi
		int CurrentScore = 0;
		int TIME = 450;
		int ti = clock();
		while (clock() - ti < TIME * CLOCKS_PER_SEC / 1000) {
			double temp = 7000.0 * (1.0 - 1.0 * (clock() - ti) / (TIME * CLOCKS_PER_SEC / 1000));
			int pos1 = rand() % 14;
			int pos2 = rand() % 14;
			swap(Flag[pos1], Flag[pos2]);
			vector<int> vec;
			for (int j = 0; j < 14; j++) {
				if (Flag[j] == true) vec.push_back(j);
			}
			SetRoads(vec, i);
			int CandScore = GetEarnedMoney();
			if (Randouble() < exp(1.0 * (CandScore - CurrentScore) / temp)) {
				CurrentScore = CandScore;
			}
			else {
				swap(Flag[pos1], Flag[pos2]);
			}
		}

		// Update
		if (Maximum < CurrentScore) {
			int mask = 0;
			for (int j = 0; j < 14; j++) {
				if (Flag[j] == true) mask += (1 << j);
			}
			Maximum = CurrentScore;
			MaxID = make_pair(i, mask);
		}
	}

	// Sort Lines (by distance from center)
	vector<pair<int, int>> Lines;
	for (int i = 0; i < 14; i++) {
		if ((MaxID.second & (1 << i)) == 0) continue;
		Lines.push_back(make_pair(abs(13 - 2 * i), i));
	}
	sort(Lines.begin(), Lines.end());

	// Calculate the Order of Adding Edges
	vector<tuple<int, int, int, int>> Edges;
	for (int i = 0; i < Lines.size(); i++) {
		int to = Lines[i].second;
		int ord[13] = { 6, 5, 7, 4, 8, 3, 9, 2, 10, 1, 11, 0, 12 };
		if (i >= 1) {
			for (int j = 0; j < 13; j++) ord[j] = j;
			if (MaxID.first == 1 || MaxID.first == 3) reverse(ord, ord + 13);
		}
		for (int j = 0; j < 13; j++) {
			if (MaxID.first == 0 || MaxID.first == 1) Edges.push_back(make_tuple(to, ord[j], to, ord[j] + 1));
			if (MaxID.first == 2 || MaxID.first == 3) Edges.push_back(make_tuple(ord[j], to, ord[j] + 1, to));
		}
		if (i == 0) {
			for (int j = 0; j < 13; j++) {
				if (MaxID.first == 0) Edges.push_back(make_tuple(ord[j],  0, ord[j] + 1,  0));
				if (MaxID.first == 1) Edges.push_back(make_tuple(ord[j], 13, ord[j] + 1, 13));
				if (MaxID.first == 2) Edges.push_back(make_tuple( 0, ord[j],  0, ord[j] + 1));
				if (MaxID.first == 3) Edges.push_back(make_tuple(13, ord[j], 13, ord[j] + 1));
			}
		}
	}

	// 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, (int)Edges.size());

		// Get Acts
		if (i <= 50) {
			Ask(2, -1, -1, -1, -1);
		}
		else if (BuiltRoads == (int)Edges.size()) {
			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 {
			Ask(1, get<0>(Edges[BuiltRoads]) + 1, get<1>(Edges[BuiltRoads]) + 1, get<2>(Edges[BuiltRoads]) + 1, get<3>(Edges[BuiltRoads]) + 1);
			BuiltRoads += 1;
		}
	}
	return 0;
}
0