Submission #422010

#	Time	Username	Problem	Language	Result	Execution time	Memory
422010		amunduzbaev	Semiexpress (JOI17_semiexpress)	C++14	100 / 100	15 ms	4548 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 = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res; //, a[N];
int a, b, c, fast[N];

void solve(int t_case){
	cin>>n>>m>>k>>a>>b>>c>>t;
	for(int i=0;i<m;i++) cin>>fast[i], fast[i]--;
	fast[m] = n;
	sort(fast, fast+m+1);
	
	vii all;
	for(int i=0;i<m;i++){
		int cur = fast[i];
		for(int l=0;l<k-m+1;l++){
			int rem = t - b * fast[i] - c * (cur - fast[i]);
			if(rem < 0) break;
			int next = min(fast[i + 1] - 1, cur + rem / a);
			//~ cout<<cur<<" "<<next<<"\n";
			if(next < cur) break;
			if(!l) res += (next - cur + 1);
			else all.pb(next - cur + 1);
			cur = next + 1;
		}
	}
	
	sort(rall(all));
	//~ for(auto x : all) cout<<x<<" ";
	//~ cout<<"\n";
	for(int i=0;i<min(sz(all), k-m);i++) res += all[i];
	cout<<res - 1<<"\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: 18 / 18
• Subtask 2: 30 / 30
• Subtask 3: 52 / 52