oj.uz

Submission #883805

# Submission time Handle Problem Language Result Execution time Memory
883805 2023-12-06T05:46:59 Z phoenix0423 Cloud Computing (CEOI18_clo) C++17
100 / 100
 313 ms 1380 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define ckmin(a, b) a = min(a, b)
#define ckmax(a, b) a = max(a, b)
#define int long long
const int maxn = 1e5 + 5;
const ll INF = 1e18;
struct info{
    int c, f, v, t;
    info(){}
    info(int _c, int _f, int _v, int _t) : c(_c), f(_f), v(_v), t(_t){}
    bool operator < (const info& other) const{
        return f < other.f || (f == other.f && t < other.t);
    }
    bool operator > (const info& other) const{
        return f > other.f || (f == other.f && t > other.t);
    }
};

signed main(void){
	fastio;
	int n;
	cin>>n;
	vector<info> a;
	for(int i = 0; i < n; i++){
		int c, f, v;
		cin>>c>>f>>v;
		a.pb(info(c, f, v, 1));
	}
	int m;
	cin>>m;
	for(int i = 0; i < m; i++){
		int c, f, v;
		cin>>c>>f>>v;
		a.pb(info(c, f, v, -1));
	}
	sort(a.begin(), a.end(), greater<info>());
	vector<int> dp(maxn + 1, -INF);
	dp[0] = 0;
	for(auto [c, f, v, t] : a){
		if(t == 1){
			for(int i = maxn - 1; i >= c; i--) dp[i] = max(dp[i], dp[i - c] - v);
		}
		else{
			for(int i = 0; i < maxn - c; i++) dp[i] = max(dp[i], dp[i + c] + v);
		}
	}
	int ans = 0;
	for(int i = 0; i < maxn; i++) ans = max(ans, dp[i]);
	cout<<ans<<"\n";

}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1224 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1116 KB Output is correct
5 Correct 145 ms 1372 KB Output is correct
6 Correct 140 ms 1368 KB Output is correct
7 Correct 152 ms 1372 KB Output is correct
8 Correct 149 ms 1372 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 67 ms 1116 KB Output is correct
6 Correct 69 ms 1116 KB Output is correct
7 Correct 186 ms 1372 KB Output is correct
8 Correct 148 ms 1372 KB Output is correct
9 Correct 159 ms 1372 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 14 ms 1116 KB Output is correct
4 Correct 14 ms 1112 KB Output is correct
5 Correct 28 ms 1116 KB Output is correct
6 Correct 27 ms 1368 KB Output is correct
7 Correct 37 ms 1116 KB Output is correct
8 Correct 37 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1220 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 110 ms 1368 KB Output is correct
4 Correct 132 ms 1372 KB Output is correct
5 Correct 307 ms 1380 KB Output is correct
6 Correct 291 ms 1368 KB Output is correct
7 Correct 292 ms 1372 KB Output is correct
8 Correct 292 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 12 ms 1116 KB Output is correct
3 Correct 61 ms 1112 KB Output is correct
4 Correct 145 ms 1368 KB Output is correct
5 Correct 290 ms 1372 KB Output is correct
6 Correct 293 ms 1372 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1224 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1116 KB Output is correct
5 Correct 145 ms 1372 KB Output is correct
6 Correct 140 ms 1368 KB Output is correct
7 Correct 152 ms 1372 KB Output is correct
8 Correct 149 ms 1372 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 67 ms 1116 KB Output is correct
14 Correct 69 ms 1116 KB Output is correct
15 Correct 186 ms 1372 KB Output is correct
16 Correct 148 ms 1372 KB Output is correct
17 Correct 159 ms 1372 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 14 ms 1116 KB Output is correct
21 Correct 14 ms 1112 KB Output is correct
22 Correct 28 ms 1116 KB Output is correct
23 Correct 27 ms 1368 KB Output is correct
24 Correct 37 ms 1116 KB Output is correct
25 Correct 37 ms 1116 KB Output is correct
26 Correct 3 ms 1220 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 110 ms 1368 KB Output is correct
29 Correct 132 ms 1372 KB Output is correct
30 Correct 307 ms 1380 KB Output is correct
31 Correct 291 ms 1368 KB Output is correct
32 Correct 292 ms 1372 KB Output is correct
33 Correct 292 ms 1372 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 12 ms 1116 KB Output is correct
36 Correct 61 ms 1112 KB Output is correct
37 Correct 145 ms 1368 KB Output is correct
38 Correct 290 ms 1372 KB Output is correct
39 Correct 293 ms 1372 KB Output is correct
40 Correct 77 ms 1116 KB Output is correct
41 Correct 142 ms 1236 KB Output is correct
42 Correct 222 ms 1372 KB Output is correct
43 Correct 290 ms 1368 KB Output is correct
44 Correct 293 ms 1368 KB Output is correct
45 Correct 313 ms 1372 KB Output is correct
46 Correct 149 ms 1372 KB Output is correct
47 Correct 221 ms 1372 KB Output is correct
48 Correct 216 ms 1372 KB Output is correct