Submission #1269782

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269782		bnd2100	Cloud Computing (CEOI18_clo)	C++20	18 / 100	3095 ms	1980 KiB

clo

/*
* @Author: Twynzz
* @Last Modified by: Twynzz
* @Note For This Problem: https://wbd.ms/share/v2/aHR0cHM6Ly93aGl0ZWJvYXJkLm1pY3Jvc29mdC5jb20vYXBpL3YxLjAvd2hpdGVib2FyZHMvcmVkZWVtLzM3MDM5NDkwNGRkNDQ1NTc5Y2Y3NWFhNjI3ZmMxOGIyX0JCQTcxNzYyLTEyRTAtNDJFMS1CMzI0LTVCMTMxRjQyNEUzRF9iZmM4ZDc5MC05ZTEwLTQ4MGEtYjliYy04OGRhZDVhNTJlZWQ=
*/


#include <bits/stdc++.h>
using namespace std;

// ------------ Define ------------

#define el "\n"
#define int long long
#define ld long double
#define str string
#define file(name) {freopen(name".inp","r",stdin);freopen(name".out","w",stdout);}
#define IOS {std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define _TBN_ signed main()
#define setp(n) setprecision(n)<< fixed
#define fi first
#define se second
#define ii pair<int,int>
#define gcd(a,b) __gcd(a,b)
#define iii tuple<int, int, int>
#define pb push_back
#define pf push_front
#define eb emplace_back
#define sz(v) (int)v.size()

const int maxn = 1e6+9;
const long long oo = 1e18;
const int MOD = 1e9+7, Mod = 1e9+9;
const int base = 311, base2 = 293;

template<class X>
    bool maximize(X &a, const X &b)
    {
        if (a<b)
        {
            a = b;
            return 1;
        }
        return 0;
    }

template<class X>
    bool minimize(X &a, const X &b)
    {
        if (a>b)
        {
            a = b;
            return 1;
        }
        return 0;
    }

namespace sub1
{
    bool checkSub1();
    void sub1();
}
namespace sub2
{
    bool checkSub2();
    void sub2();
}
namespace sub3
{
    bool checkSub3();
    void sub3();
}

int lcm(int a, int b)
{
    return a/gcd(a,b)*b;
}

int sqr(int x) {return x*x;}

inline bool MASK(int mask, int bit) {return ((mask>>bit)&1);}
inline long long F(int n) {return n*(n+1)/2;}
inline void add(int &a, int b, int m = MOD)
{
    (a += b) %= m;
    if (a >= m) a -= m;
}
inline void sub(int &a, int b, int m = MOD)
{
    (a -= b) %= m;
    if (a < 0) a += m;
}
inline void mul(int &a, int b, int m = MOD)
{
    a %= m, b %= m;
    (a *= b) %= m;
}

int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};

// ------------ Code ------------

struct triplet
{
    int m, f, p;
};

int n, m;
triplet a[maxn], b[maxn];

_TBN_
{
    IOS;
    if (fopen("WSHIPPER.inp","r")) file("WSHIPPER");
    cin >>n;
    for(int i = 1; i <= n; i++)
        cin >>a[i].m >>a[i].f >>a[i].p;
    cin >>m;
    for(int i = 1; i <= m; i++)
        cin >>b[i].m >>b[i].f >>b[i].p;
    for(int i = 1; i <= 1; i++)
    {
        if (sub1::checkSub1()) {sub1::sub1(); continue;}
        if (sub2::checkSub2()) {sub2::sub2(); continue;}
        // if (sub3::checkSub3()) {sub3::sub3(); continue;}
    }
    return 0;
}

namespace sub1
{
    bool checkSub1()
    {
        for(int i = 1; i <= n; i++)
            if (a[i].f != 1) return 0;
        for(int i = 1; i <= m; i++)
            if (b[i].f != 1) return 0;
        return 1;
    }
    int dp[maxn], dp1[maxn];
    void sub1()
    {
        int sum = 0;
        for(int i = 1; i <= n; i++) sum += a[i].m;
        for(int i = 1; i <= sum; i++) dp[i] = dp1[i] = -oo;
        for(int i = 1; i <= n; i++)
        {
            for(int j = sum; j >= a[i].m; j--)
            {
                maximize(dp[j], dp[j - a[i].m] - a[i].p);
            }
        }
        for(int j = sum - 1; j >= 0; j--)
            maximize(dp[j], dp[j + 1]);
        for(int i = 1; i <= m; i++)
        {
            for(int j = sum; j >= b[i].m; j--)
            {
                maximize(dp1[j], dp1[j - b[i].m] + b[i].p);
            }
        }
        int mx = -oo;
        for(int j = 0; j <= sum; j++) maximize(mx, dp[j] + dp1[j]);
        cout<< mx<< el;
    }
}

namespace sub2
{
    bool checkSub2()
    {
        return n <= 15;
    }
    int ans, dp[maxn];
    vector<triplet> vec;
    void solve()
    {
        int sum = 0, cost = 0;
        for(triplet i : vec)
        {
            sum += i.m;
            cost += i.p;
        }
        for(int i = 0; i <= sum; i++) dp[i] = -oo;
        dp[0] = 0;
        int j = 0;
        sum = 0;
        for(int i = 1; i <= m; i++)
        {
            while(j < sz(vec) && vec[j].f > b[i].f)
                sum += vec[j++].m;
            for(int j = sum; j >= b[i].m; j--)
                maximize(dp[j], dp[j - b[i].m] + b[i].p);
        }
        int x = *max_element(dp, dp + 1 + sum) - cost;
        maximize(ans, x);
    }
    void sub2()
    {
        sort(a + 1, a + 1 + n, [&](triplet x, triplet y){
            return x.f > y.f;
        });
        sort(b + 1, b + 1 + m, [&](triplet x, triplet y){
            return x.f > y.f;
        });
        // b[i].f se ke thua a[j].f tu b[i - 1].f
        ans = 0;
        for(int mask = 1; mask < (1ll << n); mask++)
        {
            vec.clear();
            for(int i = 0; i < n; i++)
                if (MASK(mask, i)) vec.pb(a[i + 1]);
            solve();
        }
        cout<< ans<< el;
    }
}

Compilation message (stderr)

clo.cpp: In function 'int main()':
clo.cpp:17:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | #define file(name) {freopen(name".inp","r",stdin);freopen(name".out","w",stdout);}
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
clo.cpp:115:36: note: in expansion of macro 'file'
  115 |     if (fopen("WSHIPPER.inp","r")) file("WSHIPPER");
      |                                    ^~~~
clo.cpp:17:58: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | #define file(name) {freopen(name".inp","r",stdin);freopen(name".out","w",stdout);}
      |                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:115:36: note: in expansion of macro 'file'
  115 |     if (fopen("WSHIPPER.inp","r")) file("WSHIPPER");
      |                                    ^~~~

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 18 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10