oj.uz

Submission #665983

# Submission time Handle Problem Language Result Execution time Memory
665983 2022-11-27T14:33:02 Z ktkerem Cloud Computing (CEOI18_clo) C++17
100 / 100
 1307 ms 1420 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
//typedef int ll;
typedef long long ll;
typedef unsigned long long ull;
typedef std::string str;
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e15 + 7; 
const ll ous = 1e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
ll n , m;std::vector<std::pair<llll , llll>> ar;
bool cmp(std::pair<llll , llll> a , std::pair<llll , llll> b){
    if(a.fi.sec != b.fi.sec){
        return a.fi.sec > b.fi.sec;
    }
    return a.sec.sec < b.sec.sec;
}
void solve(){
    std::cin >> n;
    ll tot = 0;
    for(ll i = 0;n>i;i++){
        ll x , y , z;std::cin >> x >> y >> z;
        ar.pb({{x , y} , {z , -1}});
        tot += x;
    }
    std::cin >> m;
    for(ll i = 0;m>i;i++){
        ll x , y , z;std::cin >> x >> y >> z;
        ar.pb({{x , y} , {z , 1}});
    }
    std::sort(all(ar) , cmp);
    std::vector<ll> dp(tot + 5 , -limit);
    dp[0] = 0;
    for(ll i = 0;ar.size()>i;i++){
        if(ar[i].sec.sec == -1){
            for(ll j = tot - ar[i].fi.fi;0<=j;j--){
                dp[j + ar[i].fi.fi] = std::max(dp[j + ar[i].fi.fi] , dp[j] - ar[i].sec.fi);
            }
        }
        else{
            for(ll j = ar[i].fi.fi;tot>=j;j++){
                dp[j - ar[i].fi.fi] = std::max(dp[j - ar[i].fi.fi] , dp[j] + ar[i].sec.fi);
            }
        }
    }
    ll mx = 0;
    for(ll i =0;tot>=i;i++){
        mx = std::max(dp[i] , mx);
    }
    std::cout << mx << "\n";
    return;/**/
}
signed main(){
    ll t=1;
    //std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0;
}/**/

Compilation message

clo.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
clo.cpp: In function 'void solve()':
clo.cpp:47:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   47 |     for(ll i = 0;ar.size()>i;i++){
      |                  ~~~~~~~~~^~
clo.cpp: In function 'int main()':
clo.cpp:69:8: warning: unused variable 'o' [-Wunused-variable]
   69 |     ll o = 1;
      |        ^

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 4 ms 388 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 8 ms 440 KB Output is correct
8 Correct 7 ms 468 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 75 ms 564 KB Output is correct
6 Correct 4 ms 308 KB Output is correct
7 Correct 353 ms 852 KB Output is correct
8 Correct 67 ms 468 KB Output is correct
9 Correct 567 ms 1108 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 25 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 613 ms 996 KB Output is correct
6 Correct 1207 ms 1296 KB Output is correct
7 Correct 1174 ms 1356 KB Output is correct
8 Correct 1113 ms 1268 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 60 ms 468 KB Output is correct
4 Correct 15 ms 440 KB Output is correct
5 Correct 1143 ms 1296 KB Output is correct
6 Correct 1147 ms 1356 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 4 ms 388 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 8 ms 440 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 75 ms 564 KB Output is correct
14 Correct 4 ms 308 KB Output is correct
15 Correct 353 ms 852 KB Output is correct
16 Correct 67 ms 468 KB Output is correct
17 Correct 567 ms 1108 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 25 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 613 ms 996 KB Output is correct
31 Correct 1207 ms 1296 KB Output is correct
32 Correct 1174 ms 1356 KB Output is correct
33 Correct 1113 ms 1268 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 60 ms 468 KB Output is correct
37 Correct 15 ms 440 KB Output is correct
38 Correct 1143 ms 1296 KB Output is correct
39 Correct 1147 ms 1356 KB Output is correct
40 Correct 76 ms 468 KB Output is correct
41 Correct 220 ms 596 KB Output is correct
42 Correct 19 ms 468 KB Output is correct
43 Correct 1307 ms 1364 KB Output is correct
44 Correct 1286 ms 1400 KB Output is correct
45 Correct 1223 ms 1420 KB Output is correct
46 Correct 9 ms 340 KB Output is correct
47 Correct 18 ms 468 KB Output is correct
48 Correct 18 ms 468 KB Output is correct