oj.uz

Submission #502461

# Submission time Handle Problem Language Result Execution time Memory
502461 2022-01-06T04:19:37 Z wwdd Cloud Computing (CEOI18_clo) C++14
100 / 100
 328 ms 2180 KB 
// bruh this time complexity is so bad
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const ll INFL = 1e18;
struct OP {
	ll op,kt,val,so;
	OP(ll op_, ll kt_, ll val_, ll so_): op(op_), kt(kt_), val(val_), so(so_) {
	}
	bool operator<(const OP& ot) const {
		if(so != ot.so) {return so > ot.so;}
		return op > ot.op;
	};

};
int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	vector<OP> ops;
	ll n;
	cin >> n;
	for(int i=0;i<n;i++) {
		ll kt,so,val;
		cin >> kt >> so >> val;
		ops.emplace_back(1,kt,val,so);
	}
	ll m;
	cin >> m;
	for(int i=0;i<m;i++) {
		ll kt,so,val;
		cin >> kt >> so >> val;
		ops.emplace_back(-1,kt,val,so);
	}
	sort(ops.begin(),ops.end());
	vector<ll> dp;
	dp.push_back(0);
	for(const auto& op: ops) {
		if(op.op == 1) {
			dp.resize(dp.size()+op.kt,-INFL);
			for(int i=dp.size()-1;i>=op.kt;i--) {
				dp[i] = max(dp[i],dp[i-op.kt]-op.val);
			}
		} else {
			for(int i=0;i+op.kt<dp.size();i++) {
				dp[i] = max(dp[i],dp[i+op.kt]+op.val);
			}
		}
	}
	ll ans = 0;
	for(int i=0;i<dp.size();i++) {
		ans = max(ans,dp[i]);
	}
	cout << ans << '\n';
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:44:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for(int i=0;i+op.kt<dp.size();i++) {
      |                ~~~~~~~^~~~~~~~~~
clo.cpp:50:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i=0;i<dp.size();i++) {
      |              ~^~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 388 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 14 ms 804 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 67 ms 1224 KB Output is correct
8 Correct 8 ms 588 KB Output is correct
9 Correct 101 ms 1868 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 0 ms 316 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 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 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 154 ms 1392 KB Output is correct
6 Correct 299 ms 1404 KB Output is correct
7 Correct 299 ms 2180 KB Output is correct
8 Correct 281 ms 1692 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 12 ms 716 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 194 ms 2124 KB Output is correct
6 Correct 308 ms 1568 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 14 ms 804 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 67 ms 1224 KB Output is correct
16 Correct 8 ms 588 KB Output is correct
17 Correct 101 ms 1868 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 0 ms 312 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 308 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 4 ms 460 KB Output is correct
29 Correct 2 ms 452 KB Output is correct
30 Correct 154 ms 1392 KB Output is correct
31 Correct 299 ms 1404 KB Output is correct
32 Correct 299 ms 2180 KB Output is correct
33 Correct 281 ms 1692 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 12 ms 716 KB Output is correct
37 Correct 4 ms 332 KB Output is correct
38 Correct 194 ms 2124 KB Output is correct
39 Correct 308 ms 1568 KB Output is correct
40 Correct 13 ms 716 KB Output is correct
41 Correct 38 ms 956 KB Output is correct
42 Correct 4 ms 484 KB Output is correct
43 Correct 328 ms 1468 KB Output is correct
44 Correct 328 ms 1528 KB Output is correct
45 Correct 221 ms 1548 KB Output is correct
46 Correct 2 ms 452 KB Output is correct
47 Correct 4 ms 460 KB Output is correct
48 Correct 4 ms 584 KB Output is correct