#include #include #include #include #include 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 Edge[90]; tuple EdgeList[90] = { make_tuple(0, 2, 1, 2), make_tuple(0, 3, 1, 3), make_tuple(0, 11, 1, 11), make_tuple(1, 1, 2, 1), make_tuple(1, 3, 2, 3), make_tuple(1, 10, 2, 10), make_tuple(2, 4, 3, 4), make_tuple(2, 10, 3, 10), make_tuple(3, 3, 4, 3), make_tuple(3, 11, 4, 11), make_tuple(4, 4, 5, 4), make_tuple(4, 12, 5, 12), make_tuple(5, 3, 6, 3), make_tuple(5, 7, 6, 7), make_tuple(5, 8, 6, 8), make_tuple(5, 9, 6, 9), make_tuple(6, 1, 7, 1), make_tuple(6, 2, 7, 2), make_tuple(6, 7, 7, 7), make_tuple(6, 10, 7, 10), make_tuple(7, 2, 8, 2), make_tuple(7, 11, 8, 11), make_tuple(8, 3, 9, 3), make_tuple(8, 10, 9, 10), make_tuple(9, 1, 10, 1), make_tuple(9, 9, 10, 9), make_tuple(10, 2, 11, 2), make_tuple(10, 9, 11, 9), make_tuple(10, 11, 11, 11), make_tuple(10, 12, 11, 12), make_tuple(11, 1, 12, 1), make_tuple(11, 3, 12, 3), make_tuple(11, 10, 12, 10), make_tuple(11, 12, 12, 12), make_tuple(12, 2, 13, 2), make_tuple(12, 10, 13, 10), make_tuple(12, 12, 13, 12), make_tuple(0, 0, 0, 1), make_tuple(0, 2, 0, 3), make_tuple(0, 9, 0, 10), make_tuple(0, 10, 0, 11), make_tuple(1, 1, 1, 2), make_tuple(1, 9, 1, 10), make_tuple(1, 10, 1, 11), make_tuple(2, 3, 2, 4), make_tuple(3, 3, 3, 4), make_tuple(3, 10, 3, 11), make_tuple(3, 11, 3, 12), make_tuple(4, 1, 4, 2), make_tuple(4, 2, 4, 3), make_tuple(4, 3, 4, 4), make_tuple(4, 4, 4, 5), make_tuple(4, 11, 4, 12), make_tuple(5, 1, 5, 2), make_tuple(5, 2, 5, 3), make_tuple(5, 3, 5, 4), make_tuple(5, 7, 5, 8), make_tuple(5, 9, 5, 10), make_tuple(5, 10, 5, 11), make_tuple(5, 11, 5, 12), 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, 2, 7, 3), make_tuple(7, 3, 7, 4), make_tuple(7, 4, 7, 5), make_tuple(7, 5, 7, 6), make_tuple(7, 6, 7, 7), make_tuple(7, 9, 7, 10), make_tuple(7, 10, 7, 11), make_tuple(7, 11, 7, 12), make_tuple(8, 1, 8, 2), make_tuple(8, 2, 8, 3), make_tuple(8, 9, 8, 10), make_tuple(8, 10, 8, 11), make_tuple(8, 11, 8, 12), make_tuple(9, 1, 9, 2), make_tuple(9, 2, 9, 3), make_tuple(9, 9, 9, 10), make_tuple(10, 1, 10, 2), make_tuple(10, 11, 10, 12), make_tuple(11, 1, 11, 2), make_tuple(11, 2, 11, 3), make_tuple(11, 9, 11, 10), make_tuple(11, 10, 11, 11), make_tuple(12, 1, 12, 2), make_tuple(12, 9, 12, 10), make_tuple(13, 1, 13, 2), make_tuple(13, 2, 13, 3) }; // 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 < 90; 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 < 90; j++) Edge[j] = EdgeList[j]; } // Rotate for (int j = 0; j < 90; 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 < 90; 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 Used(90, false); vector> Shortest(196, vector(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, 90); // Get Acts if (i <= 50) { Ask(2, -1, -1, -1, -1); } else if (BuiltRoads == 90) { 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 < 90; 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; }