#955128 (C++14) No.5017 Tool-assisted Shooting

• 問題: No.5017 Tool-assisted Shooting
• ユーザー: gucci0512
• 提出日時: 2024-02-25 01:52:58
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 66 ms / 2,000 ms
• コード長: 3,142 bytes
• コンパイル時間: 5,626 ms
• コンパイル使用メモリ: 234,260 KB
• 実行使用メモリ: 24,112 KB
• スコア: 77,565
• 平均クエリ数: 915.12
• 最終ジャッジ日時: 2024-02-25 01:53:15
• 合計ジャッジ時間: 16,009 ms
• ジャッジサーバーID （参考情報）: judge11 / judge14

ファイルパターン	結果
other	AC * 100

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
clock_t start=clock();
clock_t process=clock();
// random_device seed_gen;
// mt19937 engine(seed_gen());
mt19937 engine(0);
const int W = 25;
const int H = 60;
const int T = 1000;
const int OFFSET = 59;
const int INF = (1<<30);
void LocalInput(){
    rep(i,0,W){
        int p;cin >> p;
    }
}
int field[T+H+10][W];
vector<int> h,p,x,t,point;
deque<int> enemies[W];
void Init(){
    rep(i,0,T+H+10)rep(j,0,W) field[i][j] = -1;
    field[0][12] = -2;
}
void Input(int turn){
    int n;cin >> n;
    if(n==-1) exit(0);
    rep(i,0,n){
        int _h,_p,_x;cin >> _h >> _p >> _x;
        int idx=h.size();
        h.push_back(_h);
        p.push_back(_p);
        x.push_back(_x);
        point.push_back(_h);
        field[OFFSET+turn+1][x[idx]] = idx;
        t.push_back(OFFSET+turn+1);
        enemies[x[idx]].push_back(idx);
    }
}
int my_i = 0;
int my_j = 12;
void Output(char action){
    cout << action << endl;
    field[my_i][my_j] = -1;
    if(action=='L'){
        my_j--;
    }
    if(action=='R'){
        my_j++;
    }
    my_j = (my_j+W)%W;
    field[my_i][my_j] = -2;
}
int S = 0;
int level = 1;
int score = 0;
void MoveEnemy(int turn){
    field[my_i][my_j] = -1;
    my_i++;
    field[my_i][my_j] = -2;
    rep(j,0,W){
        while(enemies[j].size()>0){
            int enemy_idx = enemies[j].front();
            if(enemy_idx<my_i){
                enemies[j].pop_front();
            }
            else{
                break;
            }
        }
        
    }
    return;
}
void AppearenceEnemy(int turn){
    Input(turn);
}
void MoveMine(int turn){
    if(field[my_i+1][my_j] == -1){
        Output('S');
        return;
    }
    else{
        if(field[my_i][(my_j+1)%W] == -1&&field[my_i+1][(my_j+1)%W] == -1){
            Output('R');
            return;
        }
        else{
            Output('L');
            return;
        }
    }
    return;
}
void AtackMine(int turn){
    if(enemies[my_j].size()==0){
        return;
    }
    int enemy_idx = enemies[my_j].front();
    h[enemy_idx] -= level;
    if(h[enemy_idx]<=0){
        enemies[my_j].pop_front();
        field[t[enemy_idx]][x[enemy_idx]] = -1;
        score += point[enemy_idx];
        S += p[enemy_idx];
        level = (1+S/100);
    }
    return;
}
void Solve(){
    rep(turn,0,T){
        MoveEnemy(turn);
        AppearenceEnemy(turn);
        MoveMine(turn);
        AtackMine(turn);
    }
    cerr << "OK" << endl;
}   
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    if(string(getenv("HOME"))!="/home/judge"){
        LocalInput();
    }
    Init();
    Solve();
    cerr << "# Score : " << score << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX