#982893 (C++14) No.2701 A cans -> B cans

• 問題: No.2701 A cans -> B cans
• ユーザー: Keeby
• 提出日時: 2024-05-20 06:58:26
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: RE
• 実行時間: -
• コード長: 1,724 bytes
• コンパイル時間: 1,958 ms
• コンパイル使用メモリ: 171,592 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-12-20 17:42:44
• 合計ジャッジ時間: 10,101 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 6
other	AC * 23 WA * 1 RE * 49

ソースコード

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
#include <bits/stdc++.h>
//#include <atcoder/modint>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
#define rep(i,n) for(long long i=0;i<n;i++)
#define rep1(i,n) for(long long i=1;i<=n;i++)
#define Rep(i,a,b) for(long long i=a;i<=b;i++)
#define all(a) (a).begin(), (a).end()
#define fst first
#define snd second
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> vvec;
typedef vector<long long> vecll;
typedef vector<vector<long long>> vvecll;
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
const ll mod=998244353;
//const ll mod=1e9+7;
const ll INF=5e18;
const int INT_INF=1e9;
const double pi=3.14159265358979;
//xのn乗をpで割ったあまりを求める
ll modpow(ll x,ll n,ll p=mod){
  if(n==0) return 1;
  if(n%2==1) return (x*modpow(x,n-1,p))%p;
  else{
    ll t=modpow(x,n/2,p);
    assert(t>0);
    return (t*t)%p;
  }
}
//xの逆元(p:素数)
ll inv(ll x,ll p=mod){
  return modpow(x,p-2,p);
}
template <typename T>
int index(vector<T> &a, T x){
    return lower_bound(all(a),x)-a.begin();
}
struct State{
    ll c;
    ll z;
    ll i;
};
int main(){
    int n,m;
    cin >> n >> m;
    vector<State> dp(n,{0,0,0});
    vecll a(n),b(n),c(n);
    rep(i,n) cin >> a[i] >> b[i] >> c[i];
    vecll ans(m+1,0);
    rep1(i,m){
        rep(j,n){
            State x=dp[j];
            x.z++;
            if(x.z+x.i>=a[j]){
                ll k=a[j];
                k-=x.i;
                x.i=max(x.i-k,0LL);
                x.z-=k;
                x.i+=b[j];
                x.c+=c[j]*b[j];
            }
            if(x.z<0){
                cout << 10 << endl;
                return 0;
            }
            dp[j]=x;
            if(a[j]<=i){
                assert(dp[j].z<=m);
                ans[i]=max(ans[i],dp[j].c+ans[dp[j].z]);
            }
        }
    }
    rep1(i,m){
        cout << ans[i] << endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX