oj.uz

Submission #941187

# Submission time Handle Problem Language Result Execution time Memory
941187 2024-03-08T09:07:24 Z vjudge1 Cloud Computing (CEOI18_clo) C++17
18 / 100
 1667 ms 4080 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;
 
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 2005, mxc = 105, inf = 1e9;
 
 
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n, m;
	cin >> n;
	vector <array <int, 3> > a;
	for(int i = 0; i < n; i++){
		int x, y, z;
		cin >> x >> y >> z;
		a.pb({y, x, z});
	}
	cin >> m;
	vector <array <int, 3>  > b;
	for(int i = 0; i < m; i++){
		int x, y, z;
		cin >> x >> y >> z;
		b.pb({y, x, z});
	}
	b.pb({inf, inf, inf});
	a.pb({inf, inf, inf});
	sort(rall(b));
	sort(rall(a));
	vector < vector <int> > dp(mxc, vector<int>(N, -inf));
	auto prev = dp;
	prev[0][0] = 0;
	int ans = 0;
	for(int j = 1; j <= n; j++){
		for(int i = 0; i <= m; i++){
			for(int c = 0; c < mxc; c++){
				if(j != 0)
				dp[c][i] = max(dp[c][i], prev[c][i]);
				if(i != 0)
				dp[c][i] = max(dp[c][i], dp[c][i - 1]);
				if(a[j][1] <= c && j != 0)
					dp[c][i] = max(dp[c][i], prev[c - a[j][1]][i] - a[j][2]);
				if(c + b[i][1] < mxc && i != 0 && b[i][0] <= a[j][0])
					dp[c][i] = max(dp[c][i], dp[c + b[i][1]][i - 1] + b[i][2]);
				
				ans = max(dp[c][i], ans);
			}
		}
		if(j == 1)
			prev[0][0] = -inf;
		swap(prev, dp);
	}
	cout << ans << endl;
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

clo.cpp:21:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | main(){
      | ^~~~
clo.cpp: In function 'void fp(std::string)':
clo.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 2 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 2 ms 3752 KB Output is correct
5 Correct 14 ms 3672 KB Output is correct
6 Incorrect 15 ms 3676 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3676 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 2 ms 3676 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 7 ms 3676 KB Output is correct
7 Correct 14 ms 3672 KB Output is correct
8 Incorrect 15 ms 3672 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 3 ms 3676 KB Output is correct
3 Correct 5 ms 3676 KB Output is correct
4 Correct 5 ms 3676 KB Output is correct
5 Incorrect 16 ms 3788 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3928 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 7 ms 3676 KB Output is correct
4 Correct 13 ms 4080 KB Output is correct
5 Incorrect 1585 ms 3892 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct
3 Correct 61 ms 3676 KB Output is correct
4 Correct 507 ms 3824 KB Output is correct
5 Correct 1667 ms 3928 KB Output is correct
6 Correct 1667 ms 3876 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 2 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 2 ms 3752 KB Output is correct
5 Correct 14 ms 3672 KB Output is correct
6 Incorrect 15 ms 3676 KB Output isn't correct
7 Halted 0 ms 0 KB -