結果
問題 | No.5017 Tool-assisted Shooting |
ユーザー | Shun_PI |
提出日時 | 2023-07-16 16:39:41 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 119 ms / 2,000 ms |
コード長 | 4,995 bytes |
コンパイル時間 | 2,978 ms |
コンパイル使用メモリ | 201,136 KB |
実行使用メモリ | 24,408 KB |
スコア | 1,963,694 |
平均クエリ数 | 1467.58 |
最終ジャッジ日時 | 2023-07-16 16:40:00 |
合計ジャッジ時間 | 17,178 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 88 ms
23,400 KB |
testcase_01 | AC | 86 ms
24,348 KB |
testcase_02 | AC | 112 ms
23,832 KB |
testcase_03 | AC | 117 ms
24,228 KB |
testcase_04 | AC | 54 ms
24,036 KB |
testcase_05 | AC | 91 ms
23,400 KB |
testcase_06 | AC | 74 ms
24,036 KB |
testcase_07 | AC | 115 ms
23,424 KB |
testcase_08 | AC | 114 ms
23,628 KB |
testcase_09 | AC | 80 ms
23,400 KB |
testcase_10 | AC | 115 ms
23,844 KB |
testcase_11 | AC | 114 ms
24,036 KB |
testcase_12 | AC | 63 ms
23,532 KB |
testcase_13 | AC | 93 ms
24,348 KB |
testcase_14 | AC | 116 ms
23,664 KB |
testcase_15 | AC | 116 ms
24,036 KB |
testcase_16 | AC | 82 ms
23,400 KB |
testcase_17 | AC | 86 ms
24,372 KB |
testcase_18 | AC | 116 ms
23,676 KB |
testcase_19 | AC | 115 ms
23,652 KB |
testcase_20 | AC | 118 ms
23,532 KB |
testcase_21 | AC | 117 ms
23,388 KB |
testcase_22 | AC | 95 ms
23,436 KB |
testcase_23 | AC | 115 ms
23,388 KB |
testcase_24 | AC | 99 ms
23,652 KB |
testcase_25 | AC | 115 ms
24,024 KB |
testcase_26 | AC | 39 ms
23,424 KB |
testcase_27 | AC | 42 ms
24,036 KB |
testcase_28 | AC | 90 ms
23,652 KB |
testcase_29 | AC | 114 ms
24,336 KB |
testcase_30 | AC | 84 ms
24,048 KB |
testcase_31 | AC | 78 ms
24,396 KB |
testcase_32 | AC | 82 ms
23,664 KB |
testcase_33 | AC | 97 ms
23,532 KB |
testcase_34 | AC | 94 ms
23,856 KB |
testcase_35 | AC | 87 ms
23,664 KB |
testcase_36 | AC | 84 ms
23,388 KB |
testcase_37 | AC | 75 ms
23,556 KB |
testcase_38 | AC | 74 ms
23,388 KB |
testcase_39 | AC | 81 ms
24,132 KB |
testcase_40 | AC | 119 ms
24,060 KB |
testcase_41 | AC | 114 ms
23,640 KB |
testcase_42 | AC | 118 ms
23,556 KB |
testcase_43 | AC | 79 ms
24,336 KB |
testcase_44 | AC | 87 ms
23,364 KB |
testcase_45 | AC | 114 ms
23,388 KB |
testcase_46 | AC | 32 ms
24,324 KB |
testcase_47 | AC | 113 ms
24,048 KB |
testcase_48 | AC | 83 ms
24,060 KB |
testcase_49 | AC | 78 ms
24,384 KB |
testcase_50 | AC | 117 ms
23,388 KB |
testcase_51 | AC | 97 ms
23,652 KB |
testcase_52 | AC | 85 ms
24,396 KB |
testcase_53 | AC | 84 ms
23,376 KB |
testcase_54 | AC | 43 ms
24,060 KB |
testcase_55 | AC | 66 ms
23,436 KB |
testcase_56 | AC | 90 ms
24,348 KB |
testcase_57 | AC | 38 ms
23,664 KB |
testcase_58 | AC | 114 ms
23,556 KB |
testcase_59 | AC | 99 ms
24,336 KB |
testcase_60 | AC | 115 ms
24,036 KB |
testcase_61 | AC | 38 ms
23,676 KB |
testcase_62 | AC | 114 ms
23,412 KB |
testcase_63 | AC | 85 ms
23,424 KB |
testcase_64 | AC | 88 ms
24,060 KB |
testcase_65 | AC | 116 ms
23,652 KB |
testcase_66 | AC | 115 ms
23,388 KB |
testcase_67 | AC | 91 ms
23,544 KB |
testcase_68 | AC | 117 ms
24,324 KB |
testcase_69 | AC | 114 ms
24,048 KB |
testcase_70 | AC | 37 ms
23,424 KB |
testcase_71 | AC | 76 ms
23,676 KB |
testcase_72 | AC | 65 ms
23,832 KB |
testcase_73 | AC | 114 ms
24,360 KB |
testcase_74 | AC | 32 ms
23,664 KB |
testcase_75 | AC | 115 ms
24,324 KB |
testcase_76 | AC | 115 ms
23,424 KB |
testcase_77 | AC | 116 ms
23,628 KB |
testcase_78 | AC | 116 ms
23,844 KB |
testcase_79 | AC | 83 ms
23,544 KB |
testcase_80 | AC | 66 ms
23,532 KB |
testcase_81 | AC | 82 ms
24,372 KB |
testcase_82 | AC | 70 ms
24,288 KB |
testcase_83 | AC | 114 ms
24,036 KB |
testcase_84 | AC | 114 ms
24,396 KB |
testcase_85 | AC | 115 ms
23,976 KB |
testcase_86 | AC | 115 ms
24,396 KB |
testcase_87 | AC | 48 ms
24,060 KB |
testcase_88 | AC | 30 ms
24,024 KB |
testcase_89 | AC | 114 ms
23,544 KB |
testcase_90 | AC | 72 ms
23,640 KB |
testcase_91 | AC | 115 ms
23,400 KB |
testcase_92 | AC | 73 ms
24,012 KB |
testcase_93 | AC | 114 ms
24,336 KB |
testcase_94 | AC | 113 ms
23,664 KB |
testcase_95 | AC | 114 ms
23,388 KB |
testcase_96 | AC | 47 ms
24,408 KB |
testcase_97 | AC | 94 ms
24,036 KB |
testcase_98 | AC | 68 ms
24,024 KB |
testcase_99 | AC | 75 ms
23,424 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using lint = long long int; using P = pair<int, int>; using PL = pair<lint, lint>; #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) #define ALL(a) (a).begin(),(a).end() constexpr int MOD = 1000000007; constexpr lint B1 = 1532834020; constexpr lint M1 = 2147482409; constexpr lint B2 = 1388622299; constexpr lint M2 = 2147478017; constexpr int INF = 1e9; void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";} template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; } template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; } vector<int> dx = {-1, -1, 0, 0, 1, 1}; vector<int> dy = {-1, 0, -1, 1, 0, 1}; struct Enemy { int x, y = 59, h, p; }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); //vector<int> P(25); //REP(i, 25) cin >> P[i]; vector<int> enemy_cnt(25); int enemy_s = 0; vector<Enemy> enemy; int cur_x = 12; int cur_power = 100; REP(turn, 1001) { if(turn == 0) { cout << "S" << endl; cout.flush(); continue; } cerr << turn << " " << cur_x << " " << cur_power << endl; FOR(i, enemy_s, enemy.size()) { enemy[i].y--; if(enemy[i].y == -1) enemy_s++; } int n; cin >> n; if(n == -1) return 0; REP(i, n) { Enemy e; cin >> e.h >> e.p >> e.x; enemy.push_back(e); } REP(i, n) enemy_cnt[enemy[i].x]++; vector<vector<bool>> is_enemy(25, vector<bool>(60)); FOR(i, enemy_s, enemy.size()) if(enemy[i].h > 0) is_enemy[enemy[i].x][enemy[i].y] = true; if(turn == 373) { IREP(j, 60) { REP(i, 25) { if(is_enemy[i][j]) cerr << "o"; else if(i == cur_x && j == 0) cerr << "X"; else cerr << "."; } cerr << endl; } } //ある敵のみを倒すことを考えて移動した場合を考える //倒した敵の集合を管理 //その敵に相対することのできる位置までの最小距離をDPで求める //その敵を倒せるかどうかを判定 vector<vector<int>> dp(25, vector<int>(60, INF)); vector<vector<int>> dpd(25, vector<int>(60, INF)); dp[cur_x][0] = 0; dpd[cur_x][0] = 0; REP(j, 59) REP(i, 25) if(dp[i][j] != INF) for(int d : {-1, 1, 0}) { int x = (i + d + 25) % 25; int y = j + 1; if(is_enemy[x][y]) continue; dp[x][y] = dp[i][j] + 1; if(i == cur_x && j == 0) dpd[x][y] = d; else dpd[x][y] = dpd[i][j]; } if(turn == 373) { IREP(j, 60) { REP(i, 25) { if(dpd[i][j] == INF) cerr << "x"; else cerr << dpd[i][j]; } cerr << endl; } } int min_value = INF; int best_move = 0; int best_enemy_id = -1; FOR(i, enemy_s, enemy.size()) if(enemy[i].h > 0) { int x = enemy[i].x; int y = enemy[i].y; int miny = INF; while(true) { y--; if(y == -1) break; if(is_enemy[x][y]) break; if(dp[x][y] != INF) miny = y; } if(miny == INF) continue; int dist = enemy[i].y - miny - 1; int need_turn = enemy[i].h / (cur_power / 100) + (enemy[i].h % (cur_power/100) != 0); if(need_turn > dist) continue; if(miny < min_value) { min_value = miny; best_move = dpd[x][miny]; best_enemy_id = i; } } if(best_enemy_id == -1) { best_move = dpd[cur_x][59]; } if(best_move == 0) cout << "S" << endl; else if(best_move == -1) cout << "L" << endl; else cout << "R" << endl; if(best_enemy_id != -1) cout << "# " << enemy[best_enemy_id].x << " " << enemy[best_enemy_id].y << " " << min_value << endl; cout.flush(); cur_x = (cur_x + best_move + 25) % 25; //update int min_y = INF; int damage_enemy = -1; FOR(i, enemy_s, enemy.size()) { if(enemy[i].x == cur_x && enemy[i].y >= 0 && enemy[i].y < min_y && enemy[i].h > 0) { min_y = enemy[i].y; damage_enemy = i; } } if(damage_enemy != -1) { enemy[damage_enemy].h -= (cur_power/100); if(enemy[damage_enemy].h <= 0) cur_power += enemy[damage_enemy].p; } } }