Submission #146105

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
146105	2019-08-22T06:55:45 Z	raghav0307	Cloud Computing (CEOI18_clo)	C++14	72 / 100	3000 ms	5012 KB

clo

// 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	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	6 ms	376 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	9 ms	380 KB	Output is correct
8	Correct	9 ms	376 KB	Output is correct

Subtask #2

18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	152 ms	1568 KB	Output is correct
6	Correct	6 ms	372 KB	Output is correct
7	Correct	775 ms	2976 KB	Output is correct
8	Correct	71 ms	900 KB	Output is correct
9	Correct	1352 ms	4852 KB	Output is correct

Subtask #3

18.0 / 18.0

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

Subtask #4

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	296 KB	Output is correct
3	Correct	43 ms	712 KB	Output is correct
4	Correct	9 ms	376 KB	Output is correct
5	Correct	1783 ms	3084 KB	Output is correct
6	Correct	2986 ms	4836 KB	Output is correct
7	Execution timed out	3024 ms	5012 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #5

18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	356 KB	Output is correct
2	Correct	3 ms	504 KB	Output is correct
3	Correct	134 ms	1580 KB	Output is correct
4	Correct	28 ms	632 KB	Output is correct
5	Correct	2140 ms	5000 KB	Output is correct
6	Correct	2999 ms	4992 KB	Output is correct

Subtask #6

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	6 ms	376 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	9 ms	380 KB	Output is correct
8	Correct	9 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	152 ms	1568 KB	Output is correct
14	Correct	6 ms	372 KB	Output is correct
15	Correct	775 ms	2976 KB	Output is correct
16	Correct	71 ms	900 KB	Output is correct
17	Correct	1352 ms	4852 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	380 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	296 KB	Output is correct
28	Correct	43 ms	712 KB	Output is correct
29	Correct	9 ms	376 KB	Output is correct
30	Correct	1783 ms	3084 KB	Output is correct
31	Correct	2986 ms	4836 KB	Output is correct
32	Execution timed out	3024 ms	5012 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-