oj.uz

Submission #764845

# Submission time Handle Problem Language Result Execution time Memory
764845 2023-06-24T05:40:43 Z abhinavshukla408 Cloud Computing (CEOI18_clo) C++17
100 / 100
 749 ms 2004 KB 
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <math.h>
 
using namespace std;
 
#define endl "\n"
#define int int64_t 
#define pb push_back
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR0(i,a) FOR(i,0,a)
#define FOR1(i,a) for (int i = (1); i <= (a); ++i)
#define TRAV(a,x) for (auto& a: x)

using pii = pair<int,int>;
using vi = vector<int>;
struct transaction{
	int cores;
	int frames;
	int profit;
};

bool cmp(transaction a, transaction b){
	if(a.frames!=b.frames){
		return a.frames>b.frames;
	}else{
		return a.profit<b.profit;
	}
}
int32_t main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin>>N;
	int cores=0;
	vector<transaction> transactions;
	FOR0(i,N){
		int a,b,c;
		cin>>a>>b>>c;
		cores+=a;
		transactions.pb({a,b,-c});
	}
	int M;
	cin>>M;
	FOR0(i,M){
		int a,b,c;
		cin>>a>>b>>c;
		transactions.pb({-a,b,c});
	}
	sort(transactions.begin(),transactions.end(),cmp);
	// TRAV(i,transactions){
	// 	cout<<i.cores<<" "<<i.frames<<" "<<i.profit<<endl;
	// }
	vi dp(cores+3);
	FOR1(i,cores){
		dp[i]=-1010000000000000000;
	}
	dp[0]=0;
	int num=1;

	TRAV(i,transactions){
		vi cur(cores+3);
		cur=dp;
		int curCores=i.cores;
		for(int c=0;c<=cores;c++){
			int left=c-i.cores;
			if(left>=0 && left<=cores && dp[left]!=(-1010000000000000000)){
				cur[c]=max(cur[c],dp[left]+i.profit);
			}
		}
		dp=cur;
		num++;
	}

	int ans=0;
	FOR0(i,cores+1){
		ans=max(ans,dp[i]);
	}

	cout<<ans<<endl;
	return 0;
}

Compilation message

clo.cpp: In function 'int32_t main()':
clo.cpp:73:7: warning: unused variable 'curCores' [-Wunused-variable]
   73 |   int curCores=i.cores;
      |       ^~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 32 ms 724 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 179 ms 1236 KB Output is correct
8 Correct 25 ms 468 KB Output is correct
9 Correct 258 ms 1748 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 305 ms 1236 KB Output is correct
6 Correct 572 ms 1936 KB Output is correct
7 Correct 588 ms 1936 KB Output is correct
8 Correct 557 ms 1876 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 35 ms 724 KB Output is correct
4 Correct 7 ms 420 KB Output is correct
5 Correct 613 ms 1876 KB Output is correct
6 Correct 572 ms 1876 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 32 ms 724 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 179 ms 1236 KB Output is correct
16 Correct 25 ms 468 KB Output is correct
17 Correct 258 ms 1748 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 10 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 305 ms 1236 KB Output is correct
31 Correct 572 ms 1936 KB Output is correct
32 Correct 588 ms 1936 KB Output is correct
33 Correct 557 ms 1876 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 35 ms 724 KB Output is correct
37 Correct 7 ms 420 KB Output is correct
38 Correct 613 ms 1876 KB Output is correct
39 Correct 572 ms 1876 KB Output is correct
40 Correct 42 ms 724 KB Output is correct
41 Correct 112 ms 852 KB Output is correct
42 Correct 9 ms 468 KB Output is correct
43 Correct 645 ms 2004 KB Output is correct
44 Correct 646 ms 2004 KB Output is correct
45 Correct 749 ms 2004 KB Output is correct
46 Correct 3 ms 340 KB Output is correct
47 Correct 7 ms 468 KB Output is correct
48 Correct 6 ms 468 KB Output is correct