Submission #1114367

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114367		hihihihaw	Cloud Computing (CEOI18_clo)	C++17	100 / 100	269 ms	1548 KiB

clo

#pragma GCC optimize("O3,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define pii pair<int, int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 999999992000000023
#define MOD 1000000007
#define cint(x) int x;cin >> x;
#define cinarr(a, n)  int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
#define coutarr(a) for (auto d : a){cout << d << " ";} cout << endl;
#define coutarrD(a) for (auto d : a) {cout << d.fi << "," << d.se << " "; }cout << endl;
#define BERKAY_TUP  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start + end) / 2
#define vvi vector<vector<int>>

int t=1;
int interactive=0;
int usaco=0;
int testCase=0;

void solve(){
    int n;
    cin>>n;
    int dp[100023];
    vector<vector<int>> qu;
    dp[0]=0;
    for (int i=1;i<100023;i++) dp[i]=-INF;
    for (int i=0;i<n;i++){
        int c,f,x;
        cin>>c>>f>>x;
        qu.pb({-f,0,c,x});
    }
    int m;
    cin>>m;
    for (int i=0;i<m;i++){
        int c,f,x;
        cin>>c>>f>>x;
        qu.pb({-f,1,c,x});
    }
    sort(qu.begin(),qu.end());
    for (auto d:qu){
        int c=d[2];
        int x=d[3];
        if (d[1]==0){
            for (int i=100022;i>=0;i--){
                if (i-c>=0) dp[i]=max(dp[i],dp[i-c]-x);
            }
        }
        else{
            for (int i=0;i<100023;i++){
                if (i+c<100023) dp[i]=max(dp[i],dp[i+c]+x);
            }
        }
    }
    //for (int i=0;i<=20;i++) cout<<i<<" "<<dp[i]<<endl;
    int ans=0;
    for (int i=0;i<100023;i++) ans=max(ans,dp[i]);
    cout<<ans<<endl;
}

int32_t main(){
    BERKAY_TUP;
    if (usaco)
    {
        freopen("palpath.in", "r", stdin);
        freopen("palpath.out", "w", stdout);
    }
    if (!interactive)
    {
#ifdef Local
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        // freopen("wormsort.out", "w", stdout);
#endif
    }
    if (t == 1)
        solve();
    else
    {
        cin >> t;
        while (t--)
        {
            testCase++;
            solve();
        }
    }

    return 0;
}

Compilation message (stderr)

clo.cpp: In function 'int32_t main()':
clo.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen("palpath.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen("palpath.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