oj.uz

Submission #446819

# Submission time Handle Problem Language Result Execution time Memory
446819 2021-07-23T11:34:51 Z ritul_kr_singh Semiexpress (JOI17_semiexpress) C++17
100 / 100
 47 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, m, k, a, b, c, t, s[3000], ans, pre;
priority_queue<int> q;

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m >> k >> a >> b >> c >> t;
	for(int i=0; i<m; ++i) cin >> s[i];

	for(int i=0; i+1<m; ++i){
		int diff = s[i+1] - s[i];
		for(int j=0, x=0; j<=k-m; ++j){
			int v = min(diff - x, (t - x*c + a) / a);
			if(v < 0) break;
			ans += v, x += v;
			if(j){
				q.push(-v);
				if(size(q) > k-m) ans += q.top(), q.pop();
			}
		}
		t -= diff * b;
	}

	cout << ans - 1 + (0 <= t);
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:21:16: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   21 |     if(size(q) > k-m) ans += q.top(), q.pop();
      |        ~~~~~~~~^~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 8 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 47 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 14 ms 332 KB Output is correct
30 Correct 9 ms 344 KB Output is correct