oj.uz

Submission #72893

# Submission time Handle Problem Language Result Execution time Memory
72893 2018-08-27T07:44:27 Z zscoder Cloud Computing (CEOI18_clo) C++17
100 / 100
 901 ms 2564 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;

const int N = 111111;
ll dp[2][N];
const ll INF=ll(1e18);

void amax(ll &a, ll b)
{
	if(b>a) a=b; 
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin>>n;
	vector<pair<ii,ii> > vec;
	for(int i=0;i<n;i++)
	{
		int c,f,v; cin>>c>>f>>v;
		vec.pb(mp(mp(f,1),mp(c,v)));
	}
	int m; cin>>m;
	for(int i=0;i<m;i++)
	{
		int c,f,v; cin>>c>>f>>v;
		vec.pb(mp(mp(f,0),mp(c,v)));
	}
	sort(vec.rbegin(),vec.rend());
	for(int i=0;i<N;i++)
	{
		dp[0][i]=dp[1][i]=-INF;
	}
	dp[1][0] = 0;
	for(int i=0;i<vec.size();i++)
	{
		int cur=i&1; int pre=cur^1;
		int ty=vec[i].fi.se;
		int c=vec[i].se.fi;
		ll v=vec[i].se.se;
		for(int j=0;j<min(N,50*(i+2));j++)
		{
			dp[cur][j] = -INF;
		}
		for(int j=0;j<min(N,50*(i+2));j++)
		{
			if(dp[pre][j]>-INF)
			{
				ll val=dp[pre][j];
				amax(dp[cur][j], val);
				//apply operation
				if(ty) //buy
				{
					amax(dp[cur][j+c], val-v);
				}
				else
				{
					if(j>=c) amax(dp[cur][j-c],val+v);
				}
			}
		}
	}
	ll ans=0;
	for(int j=0;j<N;j++)
	{
		ans=max(ans,dp[(int(vec.size())-1)&1][j]);
	}
	cout<<ans<<'\n';
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:50:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<vec.size();i++)
              ~^~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2040 KB Output is correct
2 Correct 3 ms 2144 KB Output is correct
3 Correct 4 ms 2220 KB Output is correct
4 Correct 5 ms 2220 KB Output is correct
5 Correct 113 ms 2300 KB Output is correct
6 Correct 145 ms 2364 KB Output is correct
7 Correct 117 ms 2412 KB Output is correct
8 Correct 141 ms 2516 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2516 KB Output is correct
2 Correct 4 ms 2516 KB Output is correct
3 Correct 5 ms 2516 KB Output is correct
4 Correct 4 ms 2516 KB Output is correct
5 Correct 44 ms 2516 KB Output is correct
6 Correct 33 ms 2516 KB Output is correct
7 Correct 205 ms 2516 KB Output is correct
8 Correct 142 ms 2516 KB Output is correct
9 Correct 250 ms 2516 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2516 KB Output is correct
2 Correct 4 ms 2516 KB Output is correct
3 Correct 104 ms 2516 KB Output is correct
4 Correct 98 ms 2516 KB Output is correct
5 Correct 576 ms 2516 KB Output is correct
6 Correct 820 ms 2536 KB Output is correct
7 Correct 768 ms 2536 KB Output is correct
8 Correct 736 ms 2560 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2560 KB Output is correct
2 Correct 4 ms 2560 KB Output is correct
3 Correct 45 ms 2560 KB Output is correct
4 Correct 140 ms 2564 KB Output is correct
5 Correct 695 ms 2564 KB Output is correct
6 Correct 901 ms 2564 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2040 KB Output is correct
2 Correct 3 ms 2144 KB Output is correct
3 Correct 4 ms 2220 KB Output is correct
4 Correct 5 ms 2220 KB Output is correct
5 Correct 113 ms 2300 KB Output is correct
6 Correct 145 ms 2364 KB Output is correct
7 Correct 117 ms 2412 KB Output is correct
8 Correct 141 ms 2516 KB Output is correct
9 Correct 4 ms 2516 KB Output is correct
10 Correct 4 ms 2516 KB Output is correct
11 Correct 5 ms 2516 KB Output is correct
12 Correct 4 ms 2516 KB Output is correct
13 Correct 44 ms 2516 KB Output is correct
14 Correct 33 ms 2516 KB Output is correct
15 Correct 205 ms 2516 KB Output is correct
16 Correct 142 ms 2516 KB Output is correct
17 Correct 250 ms 2516 KB Output is correct
18 Correct 4 ms 2516 KB Output is correct
19 Correct 4 ms 2516 KB Output is correct
20 Correct 4 ms 2516 KB Output is correct
21 Correct 6 ms 2516 KB Output is correct
22 Correct 8 ms 2516 KB Output is correct
23 Correct 9 ms 2516 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 11 ms 2516 KB Output is correct
26 Correct 4 ms 2516 KB Output is correct
27 Correct 4 ms 2516 KB Output is correct
28 Correct 104 ms 2516 KB Output is correct
29 Correct 98 ms 2516 KB Output is correct
30 Correct 576 ms 2516 KB Output is correct
31 Correct 820 ms 2536 KB Output is correct
32 Correct 768 ms 2536 KB Output is correct
33 Correct 736 ms 2560 KB Output is correct
34 Correct 4 ms 2560 KB Output is correct
35 Correct 4 ms 2560 KB Output is correct
36 Correct 45 ms 2560 KB Output is correct
37 Correct 140 ms 2564 KB Output is correct
38 Correct 695 ms 2564 KB Output is correct
39 Correct 901 ms 2564 KB Output is correct
40 Correct 66 ms 2564 KB Output is correct
41 Correct 172 ms 2564 KB Output is correct
42 Correct 278 ms 2564 KB Output is correct
43 Correct 627 ms 2564 KB Output is correct
44 Correct 463 ms 2564 KB Output is correct
45 Correct 476 ms 2564 KB Output is correct
46 Correct 155 ms 2564 KB Output is correct
47 Correct 271 ms 2564 KB Output is correct
48 Correct 275 ms 2564 KB Output is correct