oj.uz

Submission #361727

# Submission time Handle Problem Language Result Execution time Memory
361727 2021-01-31T12:08:08 Z knightron0 Cloud Computing (CEOI18_clo) C++14
100 / 100
 565 ms 2412 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("02")
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 900;

vector<pair<pair<int, int>, pair<int,int>>> vec;

bool compare(pair<pair<int, int>, pair<int,int>> p1, pair<pair<int, int>, pair<int,int>> p2){
    if(p1.fr.fr == p2.fr.fr){
        if(p1.fr.sc == p2.fr.sc){
            return p1.sc.sc < p1.sc.sc;
        } else {
            return p1.fr.sc < p2.fr.sc;
        }
    } else {
        return p1.fr.fr > p2.fr.fr;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n;
    cin>>n;
    int mx = 0;
    for(int i= 0;i<n;i++){
    	int t1, t2, t3;
    	cin>>t1>>t2>>t3;
    	vec.pb({{t2, -1},{t1, t3}});
        mx = max(mx, t1);
    }
    int m;
    cin>>m;
    for(int i= 0;i<m;i++){
    	int t1, t2, t3;
    	cin>>t1>>t2>>t3;
    	vec.pb({{t2, 1},{t1, t3}});
        mx = max(mx, t1);
    }
    int nm = n+m;
    int mk = mx*n;
    sort(all(vec), compare);
    int dp[2][mk+5];
    for(int i= 1;i<=mk;i++) dp[0][i] = -INF;
    dp[0][0] = 0;
    for(int i= 1;i<=nm;i++){
        int par = i%2;
		for(int j= 0;j<=mk;j++){
            if(vec[i-1].fr.sc == 1){
    			if(j + vec[i-1].sc.fr <= mk){
	    			dp[par][j] = max(dp[par^1][j+vec[i-1].sc.fr] + vec[i-1].sc.sc, dp[par^1][j]);
	    		} else {
					dp[par][j] = dp[par^1][j];
	    		}
            } else {
                if(j >= vec[i-1].sc.fr){
    	    		dp[par][j] = max(dp[par^1][j-vec[i-1].sc.fr]-vec[i-1].sc.sc, dp[par^1][j]);
                } else {
                    dp[par][j] = dp[par^1][j];
                }
            }
    	}
    }
    int ans = 0;
	for(int j=0;j<=mk;j++){
		ans = max(ans, dp[(nm%2)][j]);
	}
    cout<<ans<<endl;
    return 0;
}

Compilation message

clo.cpp: In function 'bool compare(std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> >, std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> >)':
clo.cpp:27:29: warning: self-comparison always evaluates to false [-Wtautological-compare]
   27 |             return p1.sc.sc < p1.sc.sc;
      |                             ^

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 53 ms 1132 KB Output is correct
6 Correct 39 ms 876 KB Output is correct
7 Correct 259 ms 2156 KB Output is correct
8 Correct 225 ms 1772 KB Output is correct
9 Correct 241 ms 2028 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 396 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 154 ms 1668 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 500 ms 2284 KB Output is correct
6 Correct 533 ms 2252 KB Output is correct
7 Correct 526 ms 2284 KB Output is correct
8 Correct 509 ms 2316 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 31 ms 876 KB Output is correct
4 Correct 10 ms 620 KB Output is correct
5 Correct 520 ms 2244 KB Output is correct
6 Correct 565 ms 2284 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 53 ms 1132 KB Output is correct
14 Correct 39 ms 876 KB Output is correct
15 Correct 259 ms 2156 KB Output is correct
16 Correct 225 ms 1772 KB Output is correct
17 Correct 241 ms 2028 KB Output is correct
18 Correct 1 ms 396 KB Output is correct
19 Correct 1 ms 380 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 154 ms 1668 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 500 ms 2284 KB Output is correct
31 Correct 533 ms 2252 KB Output is correct
32 Correct 526 ms 2284 KB Output is correct
33 Correct 509 ms 2316 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 31 ms 876 KB Output is correct
37 Correct 10 ms 620 KB Output is correct
38 Correct 520 ms 2244 KB Output is correct
39 Correct 565 ms 2284 KB Output is correct
40 Correct 35 ms 748 KB Output is correct
41 Correct 115 ms 1132 KB Output is correct
42 Correct 8 ms 620 KB Output is correct
43 Correct 536 ms 2284 KB Output is correct
44 Correct 527 ms 2380 KB Output is correct
45 Correct 526 ms 2412 KB Output is correct
46 Correct 4 ms 492 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 8 ms 620 KB Output is correct