oj.uz

Submission #321678

# Submission time Handle Problem Language Result Execution time Memory
321678 2020-11-13T03:16:16 Z Kevin_Zhang_TW Semiexpress (JOI17_semiexpress) C++17
18 / 100
 1 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define AI(i) begin(i), end(i)
#define pb emplace_back
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template <class T, class ...U> 
void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template <class T>
void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

template <class T>
bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
template <class T>
bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }

#define int ll
const int MAX_N = 3010;
int n, m, k;
ll a, b, c, T;
ll s[MAX_N];
int solve() {
	int ad = k - m, res = 0;

	vector<int> obj;

	assert(a > c && c > b);

	for (int i = 1;i <= m;++i) {
		ll et = (s[i] - 1) * b;

		if (et > T) break;

		if (i == m) {
			++res;
			break;
		}
		int id = s[i];
		ll ex = (T - et) / a;
		if (id + ex >= s[i+1] - 1) {
			res += s[i+1] - s[i];
			continue;
		}
		res += ex + 1;
		id += ex + 1;
		et += c * (ex + 1);

		while ( ad && id < s[i+1] ) {

			if (et > T) break;

			ll ex = (T - et) / a;

			if (id + ex < s[i+1]) {
				--ad;
				res += ex + 1;
				id += ex + 1;
				et += c * (ex + 1);
			}
			else {
				obj.pb( s[i+1] - id );
				assert(s[i+1] > id);
				break;
			}
		}
	}
	assert(ad >= 0);

	sort(AI(obj));

	while (ad-- && obj.size())
		res += obj.back(), obj.pop_back();

	assert(res <= n);
	return res - 1;
}
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m >> k >> a >> b >> c >> T;
	for (int i = 1;i <= m;++i)
		cin >> s[i];
	cout << solve() << '\n';
}

Subtask #1
18.0 / 18.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Incorrect 0 ms 364 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Incorrect 0 ms 364 KB Output isn't correct
15 Halted 0 ms 0 KB -