oj.uz

Submission #70177

# Submission time Handle Problem Language Result Execution time Memory
70177 2018-08-22T12:58:16 Z model_code Cloud Computing (CEOI18_clo) C++17
100 / 100
 2436 ms 5800 KB 
// Kamil Debowski
// OBL, AC solution
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
	vector<pair<int, pair<int,int>>> events;
	for(int rep = 0; rep < 2; ++rep) {
		int n;
		scanf("%d", &n);
		while(n--) {
			int cnt, freq, cost;
			scanf("%d%d%d", &cnt, &freq, &cost);
			if(rep == 0) {
				cost *= -1; // cost of CPU
			}
			else {
				cnt *= -1;
			}
			// otherwise gain from a task
			events.push_back({freq, {cnt, cost}});
		}
	}
	sort(events.rbegin(), events.rend());
	vector<ll> dp{0};
	for(int i = 0; i < (int) events.size(); ++i) {
		vector<ll> dp2 = dp;
		for(int cnt = 0; cnt < (int) dp.size(); ++cnt) {
			int cnt2 = cnt + events[i].second.first;
			ll maybe_cost = dp[cnt] + events[i].second.second;
			if(cnt2 >= 0) {
				while((int) dp2.size() <= cnt2) dp2.push_back(LONG_LONG_MIN / 2);
				dp2[cnt2] = max(dp2[cnt2], maybe_cost);
			}
		}
		dp = dp2;
	}
	ll answer = 0;
	for(ll x : dp) answer = max(answer, x);
	printf("%lld\n", answer);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
clo.cpp:13:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d", &cnt, &freq, &cost);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 5 ms 488 KB Output is correct
6 Correct 6 ms 492 KB Output is correct
7 Correct 8 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 120 ms 1656 KB Output is correct
6 Correct 7 ms 1656 KB Output is correct
7 Correct 654 ms 2984 KB Output is correct
8 Correct 58 ms 2984 KB Output is correct
9 Correct 1170 ms 4744 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4744 KB Output is correct
2 Correct 3 ms 4744 KB Output is correct
3 Correct 39 ms 4744 KB Output is correct
4 Correct 7 ms 4744 KB Output is correct
5 Correct 1389 ms 4744 KB Output is correct
6 Correct 2273 ms 4852 KB Output is correct
7 Correct 2260 ms 5096 KB Output is correct
8 Correct 2087 ms 5096 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5096 KB Output is correct
2 Correct 3 ms 5096 KB Output is correct
3 Correct 103 ms 5096 KB Output is correct
4 Correct 21 ms 5096 KB Output is correct
5 Correct 1656 ms 5096 KB Output is correct
6 Correct 2278 ms 5180 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 5 ms 488 KB Output is correct
6 Correct 6 ms 492 KB Output is correct
7 Correct 8 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 4 ms 520 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 120 ms 1656 KB Output is correct
14 Correct 7 ms 1656 KB Output is correct
15 Correct 654 ms 2984 KB Output is correct
16 Correct 58 ms 2984 KB Output is correct
17 Correct 1170 ms 4744 KB Output is correct
18 Correct 2 ms 4744 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 3 ms 4744 KB Output is correct
21 Correct 4 ms 4744 KB Output is correct
22 Correct 2 ms 4744 KB Output is correct
23 Correct 4 ms 4744 KB Output is correct
24 Correct 3 ms 4744 KB Output is correct
25 Correct 3 ms 4744 KB Output is correct
26 Correct 3 ms 4744 KB Output is correct
27 Correct 3 ms 4744 KB Output is correct
28 Correct 39 ms 4744 KB Output is correct
29 Correct 7 ms 4744 KB Output is correct
30 Correct 1389 ms 4744 KB Output is correct
31 Correct 2273 ms 4852 KB Output is correct
32 Correct 2260 ms 5096 KB Output is correct
33 Correct 2087 ms 5096 KB Output is correct
34 Correct 2 ms 5096 KB Output is correct
35 Correct 3 ms 5096 KB Output is correct
36 Correct 103 ms 5096 KB Output is correct
37 Correct 21 ms 5096 KB Output is correct
38 Correct 1656 ms 5096 KB Output is correct
39 Correct 2278 ms 5180 KB Output is correct
40 Correct 98 ms 5180 KB Output is correct
41 Correct 274 ms 5180 KB Output is correct
42 Correct 16 ms 5180 KB Output is correct
43 Correct 2427 ms 5472 KB Output is correct
44 Correct 2436 ms 5800 KB Output is correct
45 Correct 1854 ms 5800 KB Output is correct
46 Correct 8 ms 5800 KB Output is correct
47 Correct 18 ms 5800 KB Output is correct
48 Correct 14 ms 5800 KB Output is correct