oj.uz

Submission #126073

# Submission time Handle Problem Language Result Execution time Memory
126073 2019-07-07T01:59:53 Z briansu Cloud Computing (CEOI18_clo) C++14
100 / 100
 1482 ms 2456 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS()
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t> void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
	fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
	_do(__VA_ARGS__);\
}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...)
#define endl '\n'
#endif

const ll MAXn = 2e3 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;


struct tg{
	ll c, f, v, tp;	
};

vector<tg> dt;

ll dp[2][51 * MAXn];

int main(){
	IOS();
	ll n, m;
	cin>>n;
	REP(i, n)
	{
		ll c, f, v;
		cin>>c>>f>>v;
		dt.pb({c, f, v, 1});
	}
	cin>>m;
	REP(i, m)
	{
		ll c, f, v;
		cin>>c>>f>>v;
		dt.pb({c, f, v, 0});
	}
	sort(ALL(dt), [](tg &a, tg &b){return ii(a.f, a.tp) < ii(b.f, b.tp);});
	ll C = 0;
	ll fg = 0;
	for(auto &t:dt)
	{
		fg = !fg;
		for(int i = 0;i <= C;i ++)dp[fg][i] = dp[!fg][i];
		if(t.tp == 0)
		{
			for(int i = 0;i <= C;i ++)dp[fg][i + t.c] = max(dp[fg][i + t.c], dp[!fg][i] + t.v);
			C += t.c;
		}
		else
		{
			for(int i = 0;i <= C;i ++)dp[fg][max(0LL, i - t.c)] = max(dp[fg][max(0LL, i - t.c)], dp[fg][i] - t.v);
		}
	}
	cout<<dp[fg][0]<<endl;
}

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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 224 ms 1404 KB Output is correct
6 Correct 108 ms 760 KB Output is correct
7 Correct 468 ms 2220 KB Output is correct
8 Correct 438 ms 2040 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 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 10 ms 600 KB Output is correct
9 Correct 9 ms 504 KB Output is correct

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 44 ms 632 KB Output is correct
5 Correct 647 ms 1528 KB Output is correct
6 Correct 1333 ms 2108 KB Output is correct
7 Correct 1328 ms 2112 KB Output is correct
8 Correct 1285 ms 2168 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 888 ms 2176 KB Output is correct
6 Correct 1436 ms 2256 KB Output is correct

Subtask #6
10.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 224 ms 1404 KB Output is correct
6 Correct 108 ms 760 KB Output is correct
7 Correct 468 ms 2220 KB Output is correct
8 Correct 438 ms 2040 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 10 ms 600 KB Output is correct
17 Correct 9 ms 504 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 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 380 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 44 ms 632 KB Output is correct
30 Correct 647 ms 1528 KB Output is correct
31 Correct 1333 ms 2108 KB Output is correct
32 Correct 1328 ms 2112 KB Output is correct
33 Correct 1285 ms 2168 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 22 ms 504 KB Output is correct
38 Correct 888 ms 2176 KB Output is correct
39 Correct 1436 ms 2256 KB Output is correct
40 Correct 60 ms 920 KB Output is correct
41 Correct 252 ms 1400 KB Output is correct
42 Correct 14 ms 632 KB Output is correct
43 Correct 1461 ms 2280 KB Output is correct
44 Correct 1482 ms 2456 KB Output is correct
45 Correct 974 ms 2428 KB Output is correct
46 Correct 8 ms 504 KB Output is correct
47 Correct 14 ms 632 KB Output is correct
48 Correct 13 ms 632 KB Output is correct