結果

問題 No.5017 Tool-assisted Shooting
ユーザー FplusFplusFFplusFplusF
提出日時 2023-08-08 10:52:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,184 bytes
コンパイル時間 2,850 ms
コンパイル使用メモリ 227,212 KB
実行使用メモリ 24,516 KB
スコア 4,130,649
平均クエリ数 390.00
最終ジャッジ日時 2023-08-08 10:55:55
合計ジャッジ時間 90,755 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,929 ms
23,400 KB
testcase_01 AC 1,937 ms
24,072 KB
testcase_02 AC 1,902 ms
23,436 KB
testcase_03 AC 1,932 ms
23,424 KB
testcase_04 AC 1,924 ms
23,544 KB
testcase_05 AC 1,909 ms
24,288 KB
testcase_06 AC 1,904 ms
23,388 KB
testcase_07 AC 1,915 ms
23,652 KB
testcase_08 AC 1,920 ms
24,060 KB
testcase_09 AC 1,913 ms
23,652 KB
testcase_10 AC 1,934 ms
23,436 KB
testcase_11 AC 1,913 ms
23,676 KB
testcase_12 AC 1,933 ms
23,400 KB
testcase_13 AC 1,920 ms
23,676 KB
testcase_14 AC 1,934 ms
23,412 KB
testcase_15 AC 1,932 ms
23,436 KB
testcase_16 AC 1,917 ms
24,276 KB
testcase_17 AC 1,938 ms
23,400 KB
testcase_18 AC 1,926 ms
23,664 KB
testcase_19 AC 1,934 ms
24,084 KB
testcase_20 AC 1,917 ms
23,532 KB
testcase_21 AC 1,930 ms
24,072 KB
testcase_22 AC 1,904 ms
23,652 KB
testcase_23 AC 1,924 ms
23,856 KB
testcase_24 AC 1,933 ms
23,868 KB
testcase_25 AC 1,928 ms
23,856 KB
testcase_26 AC 1,924 ms
23,400 KB
testcase_27 AC 1,922 ms
23,652 KB
testcase_28 AC 1,938 ms
24,036 KB
testcase_29 AC 1,908 ms
24,012 KB
testcase_30 AC 1,903 ms
24,408 KB
testcase_31 AC 1,923 ms
24,024 KB
testcase_32 AC 1,918 ms
24,336 KB
testcase_33 AC 1,938 ms
24,072 KB
testcase_34 AC 1,911 ms
23,664 KB
testcase_35 AC 1,913 ms
24,024 KB
testcase_36 AC 1,901 ms
23,640 KB
testcase_37 AC 1,913 ms
23,556 KB
testcase_38 AC 1,929 ms
24,012 KB
testcase_39 AC 1,950 ms
24,288 KB
testcase_40 AC 1,932 ms
23,544 KB
testcase_41 AC 1,919 ms
23,568 KB
testcase_42 AC 1,928 ms
23,556 KB
testcase_43 AC 1,918 ms
24,060 KB
testcase_44 AC 1,940 ms
23,568 KB
testcase_45 AC 1,919 ms
23,400 KB
testcase_46 TLE -
testcase_47 AC 1,914 ms
24,036 KB
testcase_48 AC 1,962 ms
23,400 KB
testcase_49 AC 1,926 ms
24,396 KB
testcase_50 AC 1,959 ms
24,288 KB
testcase_51 AC 1,929 ms
23,676 KB
testcase_52 AC 1,950 ms
24,384 KB
testcase_53 AC 1,916 ms
23,568 KB
testcase_54 AC 1,953 ms
24,384 KB
testcase_55 AC 1,933 ms
23,568 KB
testcase_56 AC 1,929 ms
23,544 KB
testcase_57 AC 1,943 ms
24,048 KB
testcase_58 AC 1,930 ms
24,408 KB
testcase_59 AC 1,966 ms
24,420 KB
testcase_60 AC 1,927 ms
23,568 KB
testcase_61 AC 1,934 ms
24,060 KB
testcase_62 AC 1,926 ms
23,400 KB
testcase_63 AC 1,967 ms
23,640 KB
testcase_64 AC 1,928 ms
23,676 KB
testcase_65 AC 1,980 ms
24,504 KB
testcase_66 AC 1,949 ms
24,048 KB
testcase_67 AC 1,923 ms
23,640 KB
testcase_68 AC 1,955 ms
23,556 KB
testcase_69 AC 1,927 ms
23,568 KB
testcase_70 AC 1,963 ms
24,408 KB
testcase_71 AC 1,938 ms
23,412 KB
testcase_72 AC 1,934 ms
24,072 KB
testcase_73 AC 1,938 ms
24,300 KB
testcase_74 AC 1,940 ms
24,036 KB
testcase_75 AC 1,930 ms
23,556 KB
testcase_76 AC 1,956 ms
24,204 KB
testcase_77 AC 1,961 ms
24,048 KB
testcase_78 AC 1,927 ms
23,424 KB
testcase_79 AC 1,955 ms
24,060 KB
testcase_80 AC 1,928 ms
24,516 KB
testcase_81 AC 1,941 ms
24,504 KB
testcase_82 AC 1,920 ms
23,400 KB
testcase_83 AC 1,936 ms
24,348 KB
testcase_84 AC 1,922 ms
24,048 KB
testcase_85 AC 1,946 ms
24,336 KB
testcase_86 AC 1,945 ms
24,036 KB
testcase_87 AC 1,916 ms
23,544 KB
testcase_88 AC 1,963 ms
23,676 KB
testcase_89 AC 1,973 ms
24,060 KB
testcase_90 AC 1,971 ms
23,568 KB
testcase_91 TLE -
testcase_92 AC 1,899 ms
23,688 KB
testcase_93 AC 1,958 ms
23,688 KB
testcase_94 AC 1,928 ms
23,436 KB
testcase_95 AC 1,934 ms
24,408 KB
testcase_96 AC 1,941 ms
24,036 KB
testcase_97 AC 1,937 ms
23,436 KB
testcase_98 AC 1,943 ms
24,036 KB
testcase_99 AC 1,946 ms
24,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
int H=60,W=25,T=1000;
struct Input{
    int n;
    vector<int> h,p,x;
    void input_cin(){
        cin >> n;
        if(n==-1) exit(0);
        h.assign(n,0);
        p.assign(n,0);
        x.assign(n,0);
        rep(i,n) cin >> h[i] >> p[i] >> x[i];
    }
}Input;
struct shooter{
    int i;
    int j;
    int l;
    int s;
};
struct enemy{
    int i;
    int fh;
    int h;
    int p;
};
struct state{
    int turn;
    double point;
    vector<queue<enemy>> q_enemy;
    shooter me;
    string root;
};
bool operator<(const state &a,const state &b){
    return (double)a.point*(double)a.me.l<(double)b.point*(double)b.me.l;
}
bool operator>(const state &a,const state &b){
    return (double)a.point*(double)a.me.l>(double)b.point*(double)b.me.l;
}
struct solver{
    string beam_search(int now_turn,state first_state,int depth,int width){
        vector<state> now_beam,next_beam;
        now_beam.push_back(first_state);
        rep(d,depth){
            rep(w,width){
                if((int)now_beam.size()<=w) break;
                rep(m,3){
                    state new_state=now_beam[w];
                    if(m==0){
                        new_state.root.push_back('S');
                    }
                    if(m==1){
                        new_state.me.j--;
                        if(new_state.me.j<0) new_state.me.j+=W;
                        new_state.root.push_back('L');
                    }
                    if(m==2){
                        new_state.me.j++;
                        if(W<=new_state.me.j) new_state.me.j-=W;
                        new_state.root.push_back('R');
                    }
                    if(!new_state.q_enemy[new_state.me.j].empty()&&new_state.me.i==new_state.q_enemy[new_state.me.j].front().i) new_state.point=-1e9;
                    if(!new_state.q_enemy[new_state.me.j].empty()&&0<new_state.q_enemy[new_state.me.j].front().h){
                        new_state.q_enemy[new_state.me.j].front().h-=new_state.me.l;
                        if(new_state.root.back()=='S') new_state.point+=T-now_turn;
                        if(new_state.q_enemy[new_state.me.j].front().h<=0){
                            /*if(now_turn<=300) new_state.point+=new_state.q_enemy[new_state.me.j].front().fh*new_state.q_enemy[new_state.me.j].front().fh;
                            else new_state.point+=new_state.q_enemy[new_state.me.j].front().fh*new_state.q_enemy[new_state.me.j].front().p;*/
                            new_state.point+=new_state.q_enemy[new_state.me.j].front().fh;
                            new_state.point+=(depth-(new_state.turn-now_turn))*(depth-(new_state.turn-now_turn));
                            new_state.me.s+=new_state.q_enemy[new_state.me.j].front().p;
                            new_state.q_enemy[new_state.me.j].pop();
                        }
                    }else{
                        int now_d=2;
                        if(300<=now_turn) now_d=5;
                        new_state.point-=now_d;
                        int sz=new_state.root.size();
                        if(1<=sz&&new_state.root[sz-1]=='S') new_state.point-=now_d;
                        if(2<=sz&&((new_state.root[sz-1]=='L'&&new_state.root[sz-2]=='R')||(new_state.root[sz-1]=='R'&&new_state.root[sz-2]=='L'))) new_state.point-=now_d;
                    }
                    new_state.me.l=1+new_state.me.s/100;
                    new_state.me.i--;
                    rep(j,W){
                        if(!new_state.q_enemy[j].empty()&&new_state.me.i<new_state.q_enemy[j].front().i){
                            new_state.point-=new_state.q_enemy[j].front().fh-new_state.q_enemy[j].front().h;
                            new_state.q_enemy[j].pop();
                        }
                    }
                    if(!new_state.q_enemy[new_state.me.j].empty()&&new_state.me.i==new_state.q_enemy[new_state.me.j].front().i) new_state.point=-1e9;
                    new_state.turn++;
                    next_beam.push_back(new_state);
                }
            }
            partial_sort(next_beam.begin(),next_beam.begin()+min((int)next_beam.size(),width),next_beam.end(),[](state &a,state &b){return a>b;});
            swap(now_beam,next_beam);
            next_beam.clear();
        }
        return now_beam.front().root;
    }
    void solve(){
        int score=0;
        shooter me={H+T,12,1,0};
        vector<queue<enemy>> q_enemy(W);
        string root;
        rep(t,T){
            me.i--;
            rep(j,W){
                if(!q_enemy[j].empty()&&me.i<q_enemy[j].front().i) q_enemy[j].pop();
            }
            if(!q_enemy[me.j].empty()&&me.i==q_enemy[me.j].front().i) assert(0);
            Input.input_cin();
            rep(i,Input.n){
                q_enemy[Input.x[i]].push({me.i-H+1,Input.h[i],Input.h[i],Input.p[i]});
            }
            state first_state={0,0,q_enemy,me,""};
            if(t%5==0){
                root=beam_search(t,first_state,22,22);
                reverse(all(root));
            }
            char c=root.back();
            cout << c << endl;
            if(c=='L'){
                me.j--;
                if(me.j<0) me.j+=W;
            }
            if(c=='R'){
                me.j++;
                if(W<=me.j) me.j-=W;
            }
            root.pop_back();
            if(!q_enemy[me.j].empty()&&me.i==q_enemy[me.j].front().i) assert(0);
            if(!q_enemy[me.j].empty()&&0<q_enemy[me.j].front().h){
                q_enemy[me.j].front().h-=me.l;
                if(q_enemy[me.j].front().h<=0){
                    score+=q_enemy[me.j].front().fh;
                    me.s+=q_enemy[me.j].front().p;
                    q_enemy[me.j].pop();
                }
            }
            me.l=1+me.s/100;
            
        }
    }
}Solver;
int main(){
    Solver.solve();
}
0