oj.uz

Submission #1006552

# Submission time Handle Problem Language Result Execution time Memory
1006552 2024-06-24T03:07:07 Z kebine Cloud Computing (CEOI18_clo) C++17
100 / 100
 345 ms 1624 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long int ull;
const ll md = -1e18+7;
const int ukr = 1e5+10;
int read() {
    int ketek = 0; bool ne=0;
    register char c = getchar();
    while(c == ' ' or c =='\n') c =getchar();
    if(c=='-'){ne = 1; c = getchar();}
    while(c >= '0' and c <='9') { ketek = (ketek<<3)+(ketek<<1)+c-'0'; c = getchar();}
    if(ne) ketek*=-1;
    return ketek;
}   
void print(int x) {
    if (x < 0) {putchar('-');x = -x;}
    int len = 0, buf[10];
    if (x == 0) {putchar('0');return;}
    while (x > 0) {buf[len++] = x % 10; x/=10;}
    while (len > 0) {putchar('0' + buf[--len]);}
}
void File_Work(){
  freopen("test.in","r",stdin);
  freopen("test.out","w",stdout);
}
int n, m, a, b, c, d, id;
struct babi{
    ll fx, id, c, val;
    bool operator < (const babi &other) const{
        if(fx == other.fx){
            return id > other.id;
        }
        return fx > other.fx;
    }
};
struct babis{
    ll x, y;
};
ll gcd(ll a, ll b) {
   if (b == 0) return a;
   return gcd(b, a % b);
}
ll pgkt(ll rnx, ll rny){
    if(rny == 0) return 1;
    ll nwrn = pgkt(rnx, rny/2);
    if(rny%2){
        return (((nwrn*nwrn)%md)*rnx)%md;
    }else{
        return (nwrn*nwrn)%md;
    }
}
vector<babi> v;
string s;
ll dp[ukr];
void solve(){
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> a >> b >> c;
        v.push_back({b, 1, a, c});
    }
    cin >> m;
    for(int i = 0; i < m; i++){
        cin >> a >> b >> c;
        v.push_back({b, 0, a, c});
    }
    sort(all(v));
    dp[0] = 0;
    for(ll i = 1; i < ukr; i++){
        dp[i] = md;
    }
    for(auto i : v){
        if(!i.id){
            for(int j = 0; j < ukr-i.c; j++){
                if(dp[j+i.c] != md) dp[j] =  max(dp[j], dp[j+i.c]+i.val);
            }
        }else{
            for(int j = ukr-1; j >= i.c; j--){
                if(dp[j-i.c] != md) dp[j] =  max(dp[j], dp[j-i.c]-i.val);
            }
        }
    }
    ll ans = 0;
    for(int j = 0; j < ukr; j++){
        ans = max(ans, dp[j]);
    }
    cout << ans <<  "\n";
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
  int t =1;
    //cin >> t;
    for(int i = 1; i <= t; i++){
        //cout << "Case " << i << ": ";
        solve();
    }
}

Compilation message

clo.cpp: In function 'int read()':
clo.cpp:10:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   10 |     register char c = getchar();
      |                   ^
clo.cpp: In function 'void File_Work()':
clo.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen("test.in","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
clo.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen("test.out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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 1116 KB Output is correct
3 Correct 9 ms 1192 KB Output is correct
4 Correct 19 ms 1260 KB Output is correct
5 Correct 189 ms 1116 KB Output is correct
6 Correct 184 ms 1116 KB Output is correct
7 Correct 194 ms 1364 KB Output is correct
8 Correct 188 ms 1112 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 6 ms 1244 KB Output is correct
5 Correct 66 ms 1116 KB Output is correct
6 Correct 64 ms 1116 KB Output is correct
7 Correct 115 ms 1116 KB Output is correct
8 Correct 127 ms 1116 KB Output is correct
9 Correct 129 ms 1368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 15 ms 1260 KB Output is correct
4 Correct 16 ms 1256 KB Output is correct
5 Correct 29 ms 1112 KB Output is correct
6 Correct 29 ms 1116 KB Output is correct
7 Correct 61 ms 1116 KB Output is correct
8 Correct 63 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 100 ms 1348 KB Output is correct
4 Correct 181 ms 1368 KB Output is correct
5 Correct 297 ms 1368 KB Output is correct
6 Correct 281 ms 1624 KB Output is correct
7 Correct 268 ms 1372 KB Output is correct
8 Correct 248 ms 1368 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 14 ms 1256 KB Output is correct
3 Correct 53 ms 1112 KB Output is correct
4 Correct 190 ms 1116 KB Output is correct
5 Correct 299 ms 1372 KB Output is correct
6 Correct 273 ms 1472 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 1116 KB Output is correct
3 Correct 9 ms 1192 KB Output is correct
4 Correct 19 ms 1260 KB Output is correct
5 Correct 189 ms 1116 KB Output is correct
6 Correct 184 ms 1116 KB Output is correct
7 Correct 194 ms 1364 KB Output is correct
8 Correct 188 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1116 KB Output is correct
12 Correct 6 ms 1244 KB Output is correct
13 Correct 66 ms 1116 KB Output is correct
14 Correct 64 ms 1116 KB Output is correct
15 Correct 115 ms 1116 KB Output is correct
16 Correct 127 ms 1116 KB Output is correct
17 Correct 129 ms 1368 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 15 ms 1260 KB Output is correct
21 Correct 16 ms 1256 KB Output is correct
22 Correct 29 ms 1112 KB Output is correct
23 Correct 29 ms 1116 KB Output is correct
24 Correct 61 ms 1116 KB Output is correct
25 Correct 63 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 100 ms 1348 KB Output is correct
29 Correct 181 ms 1368 KB Output is correct
30 Correct 297 ms 1368 KB Output is correct
31 Correct 281 ms 1624 KB Output is correct
32 Correct 268 ms 1372 KB Output is correct
33 Correct 248 ms 1368 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 14 ms 1256 KB Output is correct
36 Correct 53 ms 1112 KB Output is correct
37 Correct 190 ms 1116 KB Output is correct
38 Correct 299 ms 1372 KB Output is correct
39 Correct 273 ms 1472 KB Output is correct
40 Correct 84 ms 1300 KB Output is correct
41 Correct 160 ms 1376 KB Output is correct
42 Correct 262 ms 1488 KB Output is correct
43 Correct 326 ms 1368 KB Output is correct
44 Correct 345 ms 1620 KB Output is correct
45 Correct 300 ms 1572 KB Output is correct
46 Correct 165 ms 1368 KB Output is correct
47 Correct 247 ms 1368 KB Output is correct
48 Correct 239 ms 1492 KB Output is correct