#965433 (C++17) No.2701 A cans -> B cans

提出ソース

結果

問題	No.2701 A cans -> B cans
ユーザー	HIR180
提出日時	2024-03-29 21:06:31
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,329 bytes
コンパイル時間	2,897 ms
コンパイル使用メモリ	182,528 KB
実行使用メモリ	199,376 KB
最終ジャッジ日時	2024-09-30 15:26:16
合計ジャッジ時間	17,631 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	109 ms 199,168 KB
testcase_01	AC	110 ms 199,244 KB
testcase_02	AC	142 ms 199,120 KB
testcase_03	AC	106 ms 199,020 KB
testcase_04	AC	109 ms 199,168 KB
testcase_05	AC	108 ms 199,128 KB
testcase_06	AC	109 ms 199,168 KB
testcase_07	AC	110 ms 199,080 KB
testcase_08	AC	110 ms 199,040 KB
testcase_09	AC	111 ms 199,168 KB
testcase_10	AC	111 ms 199,168 KB
testcase_11	AC	111 ms 199,040 KB
testcase_12	AC	112 ms 199,040 KB
testcase_13	AC	111 ms 199,020 KB
testcase_14	AC	111 ms 199,040 KB
testcase_15	AC	114 ms 199,168 KB
testcase_16	AC	113 ms 198,968 KB
testcase_17	AC	113 ms 199,040 KB
testcase_18	AC	112 ms 199,168 KB
testcase_19	AC	112 ms 199,012 KB
testcase_20	AC	111 ms 198,976 KB
testcase_21	AC	113 ms 199,076 KB
testcase_22	AC	113 ms 199,156 KB
testcase_23	AC	114 ms 199,144 KB
testcase_24	AC	113 ms 199,168 KB
testcase_25	AC	112 ms 199,040 KB
testcase_26	AC	187 ms 199,220 KB
testcase_27	AC	188 ms 199,128 KB
testcase_28	AC	168 ms 199,168 KB
testcase_29	AC	180 ms 199,168 KB
testcase_30	AC	179 ms 199,148 KB
testcase_31	AC	178 ms 199,168 KB
testcase_32	AC	179 ms 199,132 KB
testcase_33	AC	181 ms 199,168 KB
testcase_34	AC	179 ms 199,168 KB
testcase_35	AC	179 ms 199,232 KB
testcase_36	AC	179 ms 199,260 KB
testcase_37	AC	179 ms 199,220 KB
testcase_38	AC	180 ms 199,168 KB
testcase_39	AC	179 ms 199,296 KB
testcase_40	AC	178 ms 199,176 KB
testcase_41	AC	178 ms 199,168 KB
testcase_42	WA	-
testcase_43	AC	178 ms 199,148 KB
testcase_44	AC	179 ms 199,296 KB
testcase_45	WA	-
testcase_46	AC	178 ms 199,168 KB
testcase_47	AC	179 ms 199,128 KB
testcase_48	AC	176 ms 199,168 KB
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	AC	187 ms 199,164 KB
testcase_70	AC	190 ms 199,304 KB
testcase_71	AC	185 ms 199,168 KB
testcase_72	AC	187 ms 199,168 KB
testcase_73	AC	186 ms 199,168 KB
testcase_74	AC	185 ms 199,200 KB
testcase_75	AC	188 ms 199,168 KB
testcase_76	AC	182 ms 199,232 KB
testcase_77	AC	185 ms 199,168 KB
testcase_78	AC	190 ms 199,192 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
//#include <unordered_map>
//#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <atcoder/convolution>
//#include <atcoder/lazysegtree>
//#include <atcoder/maxflow>
//#include <atcoder/mincostflow>
//#include <atcoder/segtree>
//#include <atcoder/string>
using namespace std;
//using namespace atcoder;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define gnr(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define per(i,b) gnr(i,0,b)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) (int)(x.size())
#define pcnt(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());

struct mint{
	ll v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint& s(ll vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint &operator+=(const mint&rhs){return s(v+rhs.v);}
	mint &operator-=(const mint&rhs){return s(v+mod-rhs.v);}
	mint &operator*=(const mint&rhs){v=ll(v)*rhs.v%mod;return *this;}
	mint &operator/=(const mint&rhs){return *this*=rhs.inv();}
	mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}
	mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}
	mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}
	mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}
	mint pow(ll n)const{
		if(n<0)return inv().pow(-n);
		mint res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
	friend mint operator+(ll x,const mint&y){
		return mint(x)+y;
	}
	friend mint operator-(ll x,const mint&y){
		return mint(x)-y;
	}
	friend mint operator*(ll x,const mint&y){
		return mint(x)*y;
	}
	friend mint operator/(ll x,const mint&y){
		return mint(x)/y;
	}
	friend ostream& operator<<(ostream&os,const mint&m){
		return os<<m.v;
	}
	friend istream& operator>>(istream&is,mint&m){
		ll x;is>>x;
		m=mint(x);
		return is;
	}
	bool operator<(const mint&r)const{return v<r.v;}
	bool operator==(const mint&r)const{return v==r.v;}
	bool operator!=(const mint&r)const{return v!=r.v;}
	explicit operator bool()const{
		return v;
	}
};
ll modpow(ll x,ll n,ll _md=mod){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%_md;
		x=x*x%_md;
		n>>=1;
	}
	return res;
}
#define _sz 1
mint F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;
	R[_sz-1] = F[_sz-1].pow(mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);
}
mint C(int a,int b){
	if(b < 0 || a < b) return mint();
	return F[a]*R[b]*R[a-b];
}
using ld=long double;
using vi=vc<int>;
using ull=unsigned long long;
/*int dst(P p, P q){
	return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b);
}*/
/*template<class t>
void add_inplace(t &a, t b){
	if(a.size() < b.size()) swap(a, b);
	for(int i=0;i<si(b);i++){
		a[i] += b[i];
		if(a[i] < 0) a[i] += mod;
		if(a[i] >= mod) a[i] -= mod;
	}
	return ;
}*/
template<class t>
void ov(const vc<t>&a){
	if(a.empty()) return;
	rep(i, si(a)) cout << a[i] << (i+1==si(a)?'\n':' ');
}
//o(ans?"Yes":"No");

int dp[5005][5005];
int n,m,a[5005],b[5005],c[5005];
void solve(){
	cin>>n>>m;
	rep(i,n){
		cin>>a[i]>>b[i]>>c[i];
	}
	rep(a,5005) rep(b,5005) dp[a][b] = -1e18;
	dp[0][0] = 0;
	rep(i,n){
		rep(j,m+1-a[i]){
			if(dp[i][j] < 0) continue;
			chmax(dp[i+1][j+a[i]], b[i]*c[i]);
		}
		repn(j,m){
			chmax(dp[i+1][j], dp[i+1][j-1]);
			if(j >= a[i]-b[i]) chmax(dp[i+1][j], dp[i+1][j-a[i]+b[i]]+b[i]*c[i]);
		}
		rep(j,m+1) chmax(dp[i+1][j], dp[i][j]);
	}
	repn(j,m) o(max(0LL,dp[n][j]));
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t=1;//cin >> t;
	while(t--) solve();
}

yukicoder

結果

テストケース

ソースコード