Submission #421472

#	Time	Username	Problem	Language	Result	Execution time	Memory
421472		amunduzbaev	Semiexpress (JOI17_semiexpress)	C++14	0 / 100	2 ms	2508 KiB

semiexpress

/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 305;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, q, t, ans, res; //, a[N];
int a, b, c, used[N], dis[N][N], cost[N][N];
int pref[N], dp[N][N];
vpii edges[N];

void solve(int t_case){
	cin>>n>>m>>k>>a>>b>>c>>t;
	vii tt;
	for(int i=0, x;i<m;i++) cin>>x, tt.pb(x), used[x] = 1;
	for(int i=1;i<n;i++) edges[i].pb({i+1, a});
	for(int i=0;i<m-1;i++) edges[tt[i]].pb({tt[i+1], (tt[i+1] - tt[i]) * b});
	int K = k - m;
	
	priority_queue<pii> qq;
	qq.push({0, 1}); mem(dis, 127);
	dis[1][0] = 0;
	while(!qq.empty()){
		auto u = qq.top(); qq.pop();
		if(dis[u.ss][0] < -u.ff) continue;
		for(auto x : edges[u.ss]){
			if(umin(dis[x.ff][0], dis[u.ss][0] + x.ss)) qq.push({dis[x.ff][0], x.ff});
		}
	} 
	mem(dp, -1);
	dp[0][0] = 0;	
	for(int i=1;i<=n;i++) pref[i] = pref[i-1] + (dis[i][0] <= t);
	for(int last = -1, i=1;i<=n;i++) {
		if(used[i] && last == -1) last = i;
		dp[i][0] = pref[i], umin(dis[i][0], (~last ? dis[last][0] + (i - last) * c : a * (i - 1)));
	}
	for(int i=1;i<=n;i++) for(int j=i;j<=n;j++) cost[i][j] = (dis[i][0] + (j - i) * a <= t) + cost[i][j-1];
	
	
	for(int k=1;k<K;k++){
		for(int i=1;i<=n;i++) umin(dis[i][k], dis[i][k-1]);
		for(int i=1;i<=n;i++){
			if(used[i]) continue;
			int last = i + 1, cc = 0;
			for(int j=i-1;j>0;j--){
				if(used[j]) { 
					cc += cost[j][last - 1], last = j; 
					continue; 
				}
				if(dp[j][k-1] == -1) continue;
				if(umax(dp[i][k], dp[j][k-1] + cc + cost[j][last-1] - cost[j][j])){
					if(last < i);
					else dis[i][k] = dis[j][k-1] + (i - j) * c;
				} 
				
				else if(dp[i][k] == dp[j][k-1] + cc + cost[j][last-1] - cost[j][j]){
					if(last < i);
					else umin(dis[i][k], dis[j][k-1] + (i - j) * c);
				}
			}
		}
		
		for(int i=1;i<=n;i++){
			for(int j=i;j<=n;j++){
				cost[i][j] = (dis[i][k] + (j - i) * a <= t) + cost[i][j-1];
			}
		}
	} 
	
	int last = n + 1, cc = 0;
	for(int i=n;i>0;i--){
		if(used[i]){
			cc += cost[i][last-1], last = i;
			continue;
		} umax(res, dp[i][K-1] + cc + cost[i][last - 1] - cost[i][i]);
	}
	
	//~ for(int i=1;i<=n;i++) cout<<used[i]<<" ";
	//~ cout<<"\n";
	//~ for(int j=0;j<K;j++){
		//~ for(int i=1;i<=n;i++) cout<<dp[i][j]<<" ";
		//~ cout<<"\n";
		//~ for(int i=1;i<=n;i++) cout<<(dis[i][j] < mod ? dis[i][j] : -1)<<" ";
		//~ cout<<"\n\n";
	//~ } cout<<"\n";
	cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message (stderr)

semiexpress.cpp: In function 'void usaco(std::string)':
semiexpress.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 52