oj.uz

Submission #396596

# Submission time Handle Problem Language Result Execution time Memory
396596 2021-04-30T11:26:26 Z keta_tsimakuridze Semiexpress (JOI17_semiexpress) C++14
100 / 100
 2 ms 336 KB 
#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,s[N],ans;
set<pair<int,pair<int,int> > > st;
 main(){
	int n,m,k,a,b,c,T;
	cin>>n>>m>>k;
	cin>>a>>b>>c;
	cin>>T;
	for(int i=1;i<=m;i++){
		cin>>s[i];
	}
	if((s[m]-1)*b <=T)ans++;
	for(int i=1;i<m;i++){
		int cur=s[i];
		int timer=(s[i]-1)*b;
		if(timer>T) continue;
		ans += min(s[i+1]-s[i],(T-timer)/a+1);
		cur = s[i] + min(s[i+1]-s[i],(T-timer)/a+1); 
		if(cur>=s[i+1]) continue;	
		timer+=c*(cur-s[i]);  
		if(timer> T) continue; 
		st.insert({min(s[i+1]-cur,(T-timer)/a+1),{i,cur+min(s[i+1]-cur,(T-timer)/a+1)}});

	}
	k-=m; 
	while(k && st.size()){
		pair<int,pair<int,int> > p = *--st.end(); 
		int i = p.s.f;
		int adds=p.f; ans+=adds;
		int cur=p.s.s;
		int timer=(s[i]-1)*b+(cur-s[i])*c; 
		st.erase(p);
		k--;
		if(timer>T || cur>=s[i+1]) continue;
		adds = min(s[i+1]-cur,(T-timer)/a+1);
		cur += adds; 
	
		st.insert({adds,{i,cur}});
	
	}
	cout<<ans-1;
}

Compilation message

semiexpress.cpp:9:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    9 |  main(){
      |       ^

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 304 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct