oj.uz

Submission #445312

# Submission time Handle Problem Language Result Execution time Memory
445312 2021-07-17T12:10:52 Z hhhhaura Cloud Computing (CEOI18_clo) C++14
100 / 100
 354 ms 1356 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define int long long int
#define lld long double
#define pii pair<int, int> 
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
	int n, m;
	vector<int> c1, f1, v1;
	vector<int> c2, f2, v2;
	vector<int> dp;
	vector<pii> id;
	void init_n(int _n) {
		n = _n;
		c1.assign(n + 1, 0);
		f1.assign(n + 1, 0);
		v1.assign(n + 1, 0);
		dp.assign(50 * n + 1, -INF);
	}
	void init_m(int _m) {
		m = _m;
		c2.assign(m + 1, 0);
		f2.assign(m + 1, 0);
		v2.assign(m + 1, 0);
	}
	int solve() {
		rep(i, 1, n) id.push_back({i, 0});
		rep(i, 1, m) id.push_back({i, 1});
		sort(all(id), [](pii a, pii b) {
			int fa = (a.second ? f2[a.first] : f1[a.first]);
			int fb = (b.second ? f2[b.first] : f1[b.first]);
			if(fa != fb) return fa > fb;
			else return a.second < b.second;
		});
		dp[0] = 0;
		int cur = 0;
		rep(i, 0, m + n - 1) {
			int tp = id[i].second, idx = id[i].first;
			if(!tp) cur += c1[idx];
			if(tp == 0) rrep(j, c1[idx], cur) dp[j] = max(dp[j], dp[j - c1[idx]] - v1[idx]);
			else rep(j, 0, cur - c2[idx]) dp[j] = max(dp[j], dp[j + c2[idx]] + v2[idx]);
		}
		int ans = 0;
		rep(i, 0, cur) ans = max(ans, dp[i]);
		return ans;
	}
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n; cin >> n;
	init_n(n);
	rep(i, 1, n) cin >> c1[i] >> f1[i] >> v1[i];
	int m; cin >> m;
	init_m(m);
	rep(i, 1, m) cin >> c2[i] >> f2[i] >> v2[i];
	cout << solve() << "\n";
	return 0;
}

Compilation message

clo.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
clo.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
clo.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~

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 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 14 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 64 ms 1220 KB Output is correct
8 Correct 12 ms 1272 KB Output is correct
9 Correct 112 ms 1192 KB Output is correct

Subtask #3
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 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 5 ms 972 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 170 ms 1356 KB Output is correct
6 Correct 307 ms 1356 KB Output is correct
7 Correct 352 ms 1356 KB Output is correct
8 Correct 335 ms 1228 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 12 ms 588 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 188 ms 1356 KB Output is correct
6 Correct 283 ms 1348 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 14 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 64 ms 1220 KB Output is correct
16 Correct 12 ms 1272 KB Output is correct
17 Correct 112 ms 1192 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 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 1 ms 320 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 170 ms 1356 KB Output is correct
31 Correct 307 ms 1356 KB Output is correct
32 Correct 352 ms 1356 KB Output is correct
33 Correct 335 ms 1228 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 12 ms 588 KB Output is correct
37 Correct 5 ms 716 KB Output is correct
38 Correct 188 ms 1356 KB Output is correct
39 Correct 283 ms 1348 KB Output is correct
40 Correct 23 ms 580 KB Output is correct
41 Correct 55 ms 732 KB Output is correct
42 Correct 5 ms 1100 KB Output is correct
43 Correct 347 ms 1356 KB Output is correct
44 Correct 354 ms 1356 KB Output is correct
45 Correct 247 ms 1356 KB Output is correct
46 Correct 3 ms 844 KB Output is correct
47 Correct 5 ms 1100 KB Output is correct
48 Correct 4 ms 1100 KB Output is correct