結果
問題 | No.1123 Afforestation |
ユーザー | e869120 |
提出日時 | 2020-07-02 23:54:28 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,206 bytes |
コンパイル時間 | 2,298 ms |
コンパイル使用メモリ | 85,624 KB |
実行使用メモリ | 131,076 KB |
最終ジャッジ日時 | 2023-10-14 23:32:19 |
合計ジャッジ時間 | 19,814 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
7,600 KB |
testcase_01 | AC | 3 ms
7,660 KB |
testcase_02 | AC | 3 ms
7,676 KB |
testcase_03 | AC | 3 ms
7,936 KB |
testcase_04 | AC | 13 ms
13,160 KB |
testcase_05 | AC | 92 ms
42,136 KB |
testcase_06 | AC | 524 ms
126,508 KB |
testcase_07 | AC | 3 ms
7,716 KB |
testcase_08 | AC | 3 ms
7,592 KB |
testcase_09 | AC | 2 ms
7,708 KB |
testcase_10 | AC | 3 ms
7,944 KB |
testcase_11 | AC | 8 ms
11,204 KB |
testcase_12 | AC | 54 ms
25,776 KB |
testcase_13 | AC | 682 ms
131,076 KB |
testcase_14 | AC | 3 ms
7,652 KB |
testcase_15 | AC | 2 ms
7,596 KB |
testcase_16 | AC | 2 ms
7,704 KB |
testcase_17 | AC | 3 ms
7,704 KB |
testcase_18 | AC | 4 ms
8,020 KB |
testcase_19 | AC | 15 ms
13,396 KB |
testcase_20 | AC | 154 ms
44,092 KB |
testcase_21 | AC | 690 ms
130,636 KB |
testcase_22 | AC | 665 ms
130,708 KB |
testcase_23 | AC | 685 ms
130,768 KB |
testcase_24 | AC | 667 ms
130,752 KB |
testcase_25 | AC | 623 ms
130,764 KB |
testcase_26 | WA | - |
testcase_27 | AC | 2 ms
5,528 KB |
testcase_28 | AC | 74 ms
9,992 KB |
testcase_29 | AC | 2 ms
5,592 KB |
testcase_30 | AC | 3 ms
5,576 KB |
testcase_31 | AC | 75 ms
13,800 KB |
testcase_32 | AC | 3 ms
7,652 KB |
testcase_33 | AC | 3 ms
7,656 KB |
testcase_34 | AC | 4 ms
8,008 KB |
testcase_35 | AC | 4 ms
8,076 KB |
testcase_36 | AC | 2 ms
7,640 KB |
testcase_37 | AC | 3 ms
7,704 KB |
testcase_38 | AC | 2 ms
7,912 KB |
testcase_39 | AC | 4 ms
8,096 KB |
testcase_40 | AC | 4 ms
8,048 KB |
testcase_41 | AC | 4 ms
8,056 KB |
testcase_42 | AC | 9 ms
10,980 KB |
testcase_43 | AC | 18 ms
13,304 KB |
testcase_44 | AC | 35 ms
17,052 KB |
testcase_45 | AC | 35 ms
17,064 KB |
testcase_46 | AC | 38 ms
17,640 KB |
testcase_47 | AC | 39 ms
18,040 KB |
testcase_48 | AC | 2 ms
7,608 KB |
testcase_49 | AC | 3 ms
7,652 KB |
testcase_50 | AC | 4 ms
7,928 KB |
testcase_51 | AC | 4 ms
8,004 KB |
testcase_52 | AC | 3 ms
7,620 KB |
testcase_53 | AC | 3 ms
7,708 KB |
testcase_54 | AC | 3 ms
7,636 KB |
testcase_55 | AC | 4 ms
7,984 KB |
testcase_56 | AC | 4 ms
8,040 KB |
testcase_57 | AC | 4 ms
8,104 KB |
testcase_58 | AC | 8 ms
10,952 KB |
testcase_59 | AC | 18 ms
13,344 KB |
testcase_60 | AC | 32 ms
17,088 KB |
testcase_61 | AC | 35 ms
17,104 KB |
testcase_62 | AC | 40 ms
17,736 KB |
testcase_63 | AC | 37 ms
17,704 KB |
testcase_64 | AC | 2 ms
7,820 KB |
testcase_65 | AC | 3 ms
7,672 KB |
testcase_66 | AC | 3 ms
7,708 KB |
testcase_67 | AC | 3 ms
7,712 KB |
testcase_68 | AC | 4 ms
8,132 KB |
testcase_69 | AC | 6 ms
8,888 KB |
testcase_70 | AC | 8 ms
10,960 KB |
testcase_71 | AC | 19 ms
13,220 KB |
testcase_72 | AC | 2 ms
5,528 KB |
testcase_73 | AC | 2 ms
5,672 KB |
testcase_74 | WA | - |
testcase_75 | AC | 3 ms
7,584 KB |
testcase_76 | AC | 2 ms
5,600 KB |
testcase_77 | AC | 2 ms
7,576 KB |
testcase_78 | AC | 2 ms
4,352 KB |
testcase_79 | AC | 2 ms
4,352 KB |
testcase_80 | AC | 2 ms
5,588 KB |
testcase_81 | AC | 2 ms
5,608 KB |
testcase_82 | AC | 3 ms
7,648 KB |
testcase_83 | AC | 3 ms
7,692 KB |
testcase_84 | AC | 334 ms
126,484 KB |
testcase_85 | AC | 455 ms
130,604 KB |
testcase_86 | AC | 2 ms
5,684 KB |
testcase_87 | AC | 2 ms
5,560 KB |
testcase_88 | AC | 312 ms
99,880 KB |
testcase_89 | AC | 317 ms
122,516 KB |
testcase_90 | AC | 3 ms
7,584 KB |
testcase_91 | AC | 2 ms
5,736 KB |
testcase_92 | AC | 2 ms
7,652 KB |
ソースコード
#include <iostream> #include <vector> #include <algorithm> using namespace std; #pragma warning (disable: 4996) struct Node { int to, cap, rev; }; class MaxFlow { public: vector<Node> G[5009]; bool used[5009]; void add_edge(int u, int v, int c, int d) { G[u].push_back(Node{ v, c - d, (int)G[v].size() }); G[v].push_back(Node{ u, d, (int)G[u].size() - 1 }); } int dfs(int pos, int to, int f) { if (pos == to) return f; used[pos] = true; for (int i = 0; i < G[pos].size(); i++) { if (used[G[pos][i].to] == true || G[pos][i].cap == 0) continue; int F = dfs(G[pos][i].to, to, min(f, G[pos][i].cap)); if (F == 0) continue; G[pos][i].cap -= F; G[G[pos][i].to][G[pos][i].rev].cap += F; return F; } return 0; } int max_flow(int u, int v) { int f = 0; while (true) { for (int i = 0; i < 5009; i++) used[i] = false; int g = dfs(u, v, 100000007); f += g; if (g == 0) break; } return f; } }; // 入力 int H, A[2509]; int W, B[2509]; int K, X[19], Y[19]; // その他 int Answer[2509][2509]; bool used[2509][2509]; bool forced[2509][2509]; MaxFlow G; int main() { // 入力 cin >> H >> W; for (int i = 1; i <= H; i++) cin >> A[i]; for (int i = 1; i <= W; i++) cin >> B[i]; cin >> K; for (int i = 1; i <= K; i++) cin >> X[i] >> Y[i]; // 貪欲法 vector<pair<int, int>> CA, CB; for (int i = 1; i <= K; i++) forced[X[i]][Y[i]] = true; for (int i = 1; i <= H; i++) CA.push_back(make_pair(A[i], i)); for (int i = 1; i <= W; i++) CB.push_back(make_pair(B[i], i)); sort(CA.begin(), CA.end()); reverse(CA.begin(), CA.end()); sort(CB.begin(), CB.end()); reverse(CB.begin(), CB.end()); for (int i = 0; i < H; i++) { for (int j = 0; j < CA[i].first; j++) used[CA[i].second][CB[j].second] = true; for (int j = 0; j < CA[i].first; j++) CB[j].first -= 1; sort(CB.begin(), CB.end()); reverse(CB.begin(), CB.end()); } if (CB[0].first >= 1) { printf(":(\n"); return 0; } // 家の部分を消去 int cnts = 0; for (int i = 1; i <= K; i++) { if (used[X[i]][Y[i]] == false) continue; used[X[i]][Y[i]] = false; cnts++; } // 辺を貼る for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) { if (forced[i][j] == true) continue; G.add_edge(i, H + j, 1, (int)used[i][j]); } } for (int i = 1; i <= H; i++) { int cnts = 0; for (int j = 1; j <= W; j++) cnts += (int)used[i][j]; G.add_edge(H + W + 1, i, A[i], cnts); } for (int i = 1; i <= W; i++) { int cnts = 0; for (int j = 1; j <= H; j++) cnts += used[j][i]; G.add_edge(H + i, H + W + 2, B[i], cnts); } // フローを流す int Ret = G.max_flow(H + W + 1, H + W + 2); if (Ret != cnts) { printf(":(\n"); return 0; } // 復元する for (int i = 1; i <= H; i++) { for (int j = 0; j < G.G[i].size(); j++) { int pos = G.G[i][j].to; if (pos <= H || pos >= H + W + 1) continue; if (G.G[i][j].cap == 0) Answer[i][pos - H] = 1; } } for (int i = 1; i <= K; i++) Answer[X[i]][Y[i]] = 2; // 出力 printf("Yay!\n"); for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) { if (Answer[i][j] == 0) printf("."); if (Answer[i][j] == 1) printf("o"); if (Answer[i][j] == 2) printf("x"); } printf("\n"); } return 0; }