Submission #1164560

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164560		thelegendary08	Tricks of the Trade (CEOI23_trade)	C++17	5 / 100	1466 ms	2162688 KiB

trade

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,k);
	vin(c,n);
	vin(s,n);
	vvi dp(n, vi(k+1, -4e18));
	vector<vvi> dpdex(n, vvi(k+1));
	vi p(n);
	p[0] = c[0];
	vi f(k+5, -4e18);
	vvi dex(k+5);
	FOR(i, 1, n)p[i] = p[i-1] + c[i];
	dp[0][1] = s[0] - c[0];
	f[2] = dp[0][1] + p[0];
	dex[2] = {0};
	FOR(i, 1, n){
		dp[i][1] = s[i] - c[i];
		FOR(j, 2, k+1){
			if(j - 1 <= i){
				dp[i][j] = f[j] - p[i] + s[i];
				dpdex[i][j] = dex[j];
			}
			
		}
		FOR(j, 1, k+1){
			if(f[j+1] < dp[i][j] + p[i]){
				f[j+1] = dp[i][j] + p[i];
				dex[j+1] = {i};
			}
			else if(f[j+1] == dp[i][j] + p[i]){
				dex[j+1].pb(i);
			}
		}
	}
	/*
	f0r(i,k+1){
		f0r(j,n){
			if(dp[j][i] == -4e18)cout<<'x'<<' ';
			else cout<<dp[j][i]<<' ';
		}
		cout<<'\n';
	}
	*/
	int ans = -4e18;
	int ansdex = 0;
	vb ra(n);
	f0r(i,n){
		if(ans < dp[i][k]){
			ans = dp[i][k];
			ansdex = i;
		}
	}
	out(ans);
	vi ansv;
	int kk = k;
	f0r(i,n){
		if(dp[i][kk] == ans){
			queue<pii>q;
			q.push(mp(i, k));
			ra[i] = 1;
			while(!q.empty()){
				pii node = q.front();
				q.pop();
				for(auto u : dpdex[node.first][node.second]){
					if(!ra[u]){
						ra[u] = 1;
						q.push(mp(u, node.second - 1));
					}
				}
			}
		}
	}
	
	
	//for(auto u : ansv)ra[u] = 1;
	for(auto u : ra)cout<<u;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45