結果
問題 | No.2509 Beam Shateki |
ユーザー | Syed Shakil Mahmud (Shajib) |
提出日時 | 2023-10-20 21:56:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,596 bytes |
コンパイル時間 | 812 ms |
コンパイル使用メモリ | 76,312 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-20 18:43:06 |
合計ジャッジ時間 | 2,220 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | AC | 1 ms
6,940 KB |
testcase_60 | WA | - |
testcase_61 | AC | 1 ms
6,940 KB |
testcase_62 | WA | - |
testcase_63 | WA | - |
ソースコード
#include <iostream> #include <vector> #include <algorithm> int main() { int H, W; std::cin >> H >> W; // Create a 2D vector to represent the grid std::vector<std::vector<int>> A(H + 2, std::vector<int>(W + 2, 0)); // Input the values of the inner grid for (int i = 1; i <= H; ++i) { for (int j = 1; j <= W; ++j) { std::cin >> A[i][j]; } } // Initialize the maximum sum to 0 int maxSum = 0; // Iterate over all possible beam directions for (int dx1 = -1; dx1 <= 1; ++dx1) { for (int dy1 = -1; dy1 <= 1; ++dy1) { for (int dx2 = -1; dx2 <= 1; ++dx2) { for (int dy2 = -1; dy2 <= 1; ++dy2) { // Skip cases where both directions are (0, 0) or the same if ((dx1 == 0 && dy1 == 0) || (dx2 == 0 && dy2 == 0) || (dx1 == dx2 && dy1 == dy2)) { continue; } // Initialize a temporary grid to store destroyed values std::vector<std::vector<int>> tempGrid(A); // Perform the first beam operation for (int x = 1; x <= H; ++x) { for (int y = 1; y <= W; ++y) { if (x + dx1 >= 0 && x + dx1 <= H + 1 && y + dy1 >= 0 && y + dy1 <= W + 1) { tempGrid[x + dx1][y + dy1] = std::max(tempGrid[x + dx1][y + dy1], A[x][y]); } } } // Perform the second beam operation for (int x = 1; x <= H; ++x) { for (int y = 1; y <= W; ++y) { if (x + dx2 >= 0 && x + dx2 <= H + 1 && y + dy2 >= 0 && y + dy2 <= W + 1) { tempGrid[x + dx2][y + dy2] = std::max(tempGrid[x + dx2][y + dy2], A[x][y]); } } } // Calculate the sum of destroyed values int sum = 0; for (int x = 1; x <= H; ++x) { for (int y = 1; y <= W; ++y) { if (tempGrid[x][y] > A[x][y]) { sum += tempGrid[x][y] - A[x][y]; } } } // Update the maximum sum maxSum = std::max(maxSum, sum); } } } } std::cout << maxSum << std::endl; return 0; }