Submission #706646

#	Time	Username	Problem	Language	Result	Execution time	Memory
706646		Baytoro	Semiexpress (JOI17_semiexpress)	C++17	100 / 100	38 ms	33260 KiB

semiexpress

#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define endl '\n'
#define ll long long
#define int long long
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const ll INF=1e18,mod=998244353,N=2e5+5;
int s[N],ans=0;
priority_queue<int> pq;
void solve(){
	int n,m,k,a,b,c,t;
	cin>>n>>m>>k>>a>>b>>c>>t;
	for(int i=0;i<m;i++) cin>>s[i];
	if((n-1)*b<=t) ans++;
	for(int i=0;i<m-1;i++){
		int x=(s[i]-1)*b;
		if(x>t) break;
		int y=(t-x)/a;
		int range=min(s[i+1]-1,s[i]+y);
		ans+=(range-s[i]+1);
		if(i==0) ans--;
		for(int j=0;j<k && range<s[i+1]-1;j++){
			int tmp=x+(range-s[i]+1)*c;
			if(tmp>t) break;
			int q=(t-tmp)/a;
			int r=min(s[i+1]-1,range+1+q);
			pq.push(r-range);
			range=r;
		}
	}
	for(int i=m;i<k && !pq.empty();i++){
		ans+=pq.top();
		pq.pop();
	}
	cout<<ans;
}
main(){
	//fopn("cbarn");
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message (stderr)

semiexpress.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main(){
      | ^~~~
semiexpress.cpp: In function 'void fopn(std::string)':
semiexpress.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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