제출 #1006552

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006552		kebine	Cloud Computing (CEOI18_clo)	C++17	100 / 100	345 ms	1624 KiB

clo

#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();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10