#892786 (C++17) No.5017 Tool-assisted Shooting

• 問題: No.5017 Tool-assisted Shooting
• ユーザー: かえで
• 提出日時: 2023-07-18 00:11:28
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 229 ms / 2,000 ms
• コード長: 6,331 bytes
• コンパイル時間: 1,671 ms
• コンパイル使用メモリ: 149,552 KB
• 実行使用メモリ: 24,420 KB
• スコア: 173,687
• 平均クエリ数: 2523.69
• 最終ジャッジ日時: 2023-07-18 00:11:52
• 合計ジャッジ時間: 21,554 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	162 ms; 23,424 KB
testcase_01	AC	87 ms; 23,412 KB
testcase_02	AC	149 ms; 24,348 KB
testcase_03	AC	61 ms; 23,412 KB
testcase_04	AC	150 ms; 23,832 KB
testcase_05	AC	154 ms; 24,372 KB
testcase_06	AC	124 ms; 23,664 KB
testcase_07	AC	159 ms; 23,388 KB
testcase_08	AC	155 ms; 23,844 KB
testcase_09	AC	166 ms; 24,060 KB
testcase_10	AC	165 ms; 23,556 KB
testcase_11	AC	145 ms; 23,412 KB
testcase_12	AC	161 ms; 23,676 KB
testcase_13	AC	137 ms; 24,012 KB
testcase_14	AC	37 ms; 23,400 KB
testcase_15	AC	32 ms; 23,424 KB
testcase_16	AC	144 ms; 23,364 KB
testcase_17	AC	165 ms; 24,384 KB
testcase_18	AC	163 ms; 23,364 KB
testcase_19	AC	57 ms; 24,024 KB
testcase_20	AC	155 ms; 23,664 KB
testcase_21	AC	165 ms; 23,388 KB
testcase_22	AC	141 ms; 23,388 KB
testcase_23	AC	158 ms; 23,832 KB
testcase_24	AC	160 ms; 23,820 KB
testcase_25	AC	76 ms; 24,276 KB
testcase_26	AC	156 ms; 23,640 KB
testcase_27	AC	157 ms; 24,384 KB
testcase_28	AC	171 ms; 23,424 KB
testcase_29	AC	142 ms; 23,532 KB
testcase_30	AC	152 ms; 23,652 KB
testcase_31	AC	146 ms; 24,024 KB
testcase_32	AC	158 ms; 23,544 KB
testcase_33	AC	80 ms; 23,544 KB
testcase_34	AC	151 ms; 24,024 KB
testcase_35	AC	158 ms; 24,396 KB
testcase_36	AC	157 ms; 23,616 KB
testcase_37	AC	160 ms; 24,036 KB
testcase_38	AC	164 ms; 24,060 KB
testcase_39	AC	159 ms; 23,556 KB
testcase_40	AC	77 ms; 23,364 KB
testcase_41	AC	161 ms; 24,024 KB
testcase_42	AC	170 ms; 23,544 KB
testcase_43	AC	40 ms; 23,640 KB
testcase_44	AC	100 ms; 23,664 KB
testcase_45	AC	158 ms; 24,420 KB
testcase_46	AC	80 ms; 24,024 KB
testcase_47	AC	141 ms; 23,856 KB
testcase_48	AC	164 ms; 23,820 KB
testcase_49	AC	157 ms; 23,388 KB
testcase_50	AC	168 ms; 24,024 KB
testcase_51	AC	158 ms; 23,376 KB
testcase_52	AC	165 ms; 24,348 KB
testcase_53	AC	45 ms; 24,048 KB
testcase_54	AC	164 ms; 24,024 KB
testcase_55	AC	39 ms; 24,360 KB
testcase_56	AC	77 ms; 24,060 KB
testcase_57	AC	144 ms; 23,556 KB
testcase_58	AC	160 ms; 24,048 KB
testcase_59	AC	62 ms; 23,532 KB
testcase_60	AC	157 ms; 23,844 KB
testcase_61	AC	88 ms; 24,396 KB
testcase_62	AC	159 ms; 24,276 KB
testcase_63	AC	29 ms; 23,724 KB
testcase_64	AC	97 ms; 23,436 KB
testcase_65	AC	229 ms; 23,976 KB
testcase_66	AC	60 ms; 23,544 KB
testcase_67	AC	51 ms; 24,024 KB
testcase_68	AC	156 ms; 23,388 KB
testcase_69	AC	160 ms; 24,360 KB
testcase_70	AC	161 ms; 23,424 KB
testcase_71	AC	159 ms; 24,048 KB
testcase_72	AC	151 ms; 23,544 KB
testcase_73	AC	113 ms; 23,376 KB
testcase_74	AC	138 ms; 24,012 KB
testcase_75	AC	158 ms; 23,388 KB
testcase_76	AC	156 ms; 23,400 KB
testcase_77	AC	168 ms; 23,400 KB
testcase_78	AC	152 ms; 24,024 KB
testcase_79	AC	155 ms; 24,276 KB
testcase_80	AC	161 ms; 23,388 KB
testcase_81	AC	149 ms; 24,252 KB
testcase_82	AC	66 ms; 23,544 KB
testcase_83	AC	153 ms; 24,024 KB
testcase_84	AC	39 ms; 23,412 KB
testcase_85	AC	154 ms; 23,532 KB
testcase_86	AC	175 ms; 23,376 KB
testcase_87	AC	155 ms; 23,376 KB
testcase_88	AC	30 ms; 24,336 KB
testcase_89	AC	153 ms; 23,664 KB
testcase_90	AC	160 ms; 24,276 KB
testcase_91	AC	182 ms; 24,276 KB
testcase_92	AC	152 ms; 24,396 KB
testcase_93	AC	93 ms; 23,844 KB
testcase_94	AC	139 ms; 24,024 KB
testcase_95	AC	161 ms; 23,652 KB
testcase_96	AC	80 ms; 23,376 KB
testcase_97	AC	152 ms; 24,024 KB
testcase_98	AC	98 ms; 24,396 KB
testcase_99	AC	169 ms; 24,036 KB

ソースコード

#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
//#include <limits.n>//INT_MAX
//#include <math.n>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

constexpr int width = 25;        // フィールドの幅
constexpr int height = 60;       // フィールドの高さ
constexpr int max_turn = 1000;   // ゲームの最大ターン数
const char choice[3] = {'L', 'R', 'S'};
int masu[25][60];
int masu1[25][60];
int sx = 12;
int power=0;
int kogeki=1;
struct Data {
    int h;
    int p;
    int x;
    int y;

    Data(int h, int p, int x, int y) : h(h), p(p), x(x), y(y) {}
};

bool compareByValue(const Data& a, const Data& b) {
    int valueA = a.y - std::abs(sx - a.x) - 1 - a.h;
    int valueB = b.y - std::abs(sx - b.x) - 1 - b.h;
    if (valueA != valueB)
        return valueA > valueB;
    else
        return std::abs(sx - a.x) < std::abs(sx - b.x);
}

int main() {
    //vector<int>P(25);
    //rep(i,25)cin>>P[i];
    vector<Data> data,data_mae;
    rep(i,25)data_mae.emplace_back(-1,-1,-1,-1);
    for (int turn = 1; turn <= max_turn; turn++) {
        // 入力の受け取り
        int n;
        cin >> n;
        if (n == -1)
            return 0;
        for(auto& z:data_mae)if(z.h<=0){
            power+=z.p;
            if(!data.empty()){
                int sho=100;
                rep(i,data.size()){
                    if(z.x==data[i].x&&data[i].h>0&&sho>data[i].y){
                        sho=data[i].y;
                        z.h=data[i].h;
                        z.x=data[i].x;
                        z.p=data[i].p;
                        z.y=data[i].y;
                    }
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int h1, p1, x1;
            cin >> h1 >> p1 >> x1;
            //cerr<<h1<<" "<<p1<<" "<<x1<<" "<<endl;
            data.emplace_back(h1, p1, x1, 59);
            masu[x1][59]=1;
            if(data_mae[x1].y==-1||data_mae[x1].x==-1){
                data_mae[x1].h=h1;
                data_mae[x1].p=p1;
                data_mae[x1].x=x1;
                data_mae[x1].y=59; 
                //cerr<<"kakunin:"<<h1<<" "<<data_mae[x1].h<<endl;               
            }
        }
        /*
        if(turn<=2){
        rep(i,25){
          rep(j,60)cerr<<masu[i][j]<<" ";
          cerr<<endl;
        }
        cerr<<endl;
        }*/

        if (!data.empty()) {
            sort(data.begin(), data.end(), compareByValue);
        }
        
        int min_i=-1;
        int sho=1000;
        kogeki=1;

        for(auto z:data_mae){
            kogeki=1+(power/100);
            if(kogeki==0)kogeki=1;
            //cerr<<__LINE__<<"---"<<kogeki<<endl;
            //cerr<<z.h<<" "<<kogeki<<endl;
            int tmp=z.y-(int)((z.h+kogeki-1)/kogeki)-abs(sx-z.x)-1;
            //cerr<<__LINE__<<"---"<<endl;
            
            if(tmp>0&&sho>abs(sx-z.x)&&z.y!=-1&&z.x!=-1&&z.h>0){
                min_i=z.x;
                sho=abs(sx-z.x);
            }
        }

        int r = 2;
        if(!data.empty()){
            if(min_i==-1)min_i=sx;
            //cerr<<"moto sx"<<sx<<" ";
        if (sx > min_i&&sx>=1&&masu[sx-1][0]==0&&masu[sx-1][1]==0&&masu[sx-1][2]==0) {
            r = 0;//L
            sx--;
        } else if (sx < min_i&&sx<24&&masu[sx+1][0]==0&&masu[sx+1][1]==0&&masu[sx+1][2]==0) {
            r = 1;//R
            sx++;
        } else {
            r = 2;
            if (masu[sx][0]==1||masu[sx][1]==1||masu[sx][2]==1) {
                if (sx >= 1&&masu[sx-1][0]==0&&masu[sx-1][1]==0&&masu[sx-1][2]==0) {
                    sx--;
                    r = 0;
                } else if(sx <24&&masu[sx+1][0]==0&&masu[sx+1][1]==0&&masu[sx+1][2]==0){
                    sx++;
                    r = 1;
                }else if(sx==0&&masu[24][0]==0&&masu[24][1]==0&&masu[24][2]==0){
                  r=0;
                  sx=24;
                }else if(sx ==24&&masu[0][0]==0&&masu[0][1]==0&&masu[0][2]==0){
                  r=1;
                  sx=0;
                }
            }
        }
        }

        char c = choice[r];
        cout << c << endl;
        cout << "#" << c << " sx:" << sx <<endl;
        //if(!data.empty())cout<<"#nerai x:"<<data[0].x<<" y:"<<data[0].y<<" h"<<data[0].h<<endl;
        for(auto &z:data_mae){
            if(z.x==sx)z.h-=kogeki;
        }
        cout<<"#nerai x:"<<min_i<<" y:"<<data_mae[min_i].y<<" h"<<data_mae[min_i].h<<endl;       
        for(auto &z:data_mae){
            if(z.y!=-1)z.y=z.y-1;
        }
        int ichi = 100;
        rep(i,25){
          rep(j,60){
            if(masu[i][j]==1){
              masu1[i][j]=0;
              if(j-1>=0)masu1[i][j-1]=1;
            }
          }
        }

        rep(i,25)rep(j,60)masu[i][j]=masu1[i][j];
        if (!data.empty()) {
            for (auto& z : data) {
                z.y -=1;
                if (z.x == sx) {
                    ichi = min(ichi, z.y);
                }
            }
        }
        if (ichi != -1&&!data.empty()) {
            for (auto it = data.begin(); it != data.end(); ++it) {
                if (ichi == it->y && it->x == sx) {
                    int z=kogeki;
                    if (it->h >z) {
                        it->h -= z;                                                                }
                    else{
                        data.erase(it);
                    }
                    break;   
                }
                if(it->h<=0)data.erase(it);
            }
        }
    }
    return 0;
}