Submission #77370

#	Time	Username	Problem	Language	Result	Execution time	Memory
77370		duality	Cloud Computing (CEOI18_clo)	C++11	100 / 100	800 ms	3444 KiB

clo

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

struct event { int c,f,v,t; };
bool comp(event a,event b) {
    if (a.f == b.f) return a.t > b.t;
    else return a.f > b.f;
}
vector<event> events;
LLI dp[2][100001];
int main() {
    int i;
    int n,m,c,f,v;
    scanf("%d",&n);
    for (i = 0; i < n; i++) {
        scanf("%d %d %d",&c,&f,&v);
        events.pb((event){c,f,v,1});
    }
    scanf("%d",&m);
    for (i = 0; i < m; i++) {
        scanf("%d %d %d",&c,&f,&v);
        events.pb((event){c,f,v,-1});
    }
    sort(events.begin(),events.end(),comp);

    int j;
    for (i = 1; i <= 100000; i++) dp[1][i] = -MAX_VAL_2;
    for (i = 0; i < events.size(); i++) {
        int p = i & 1;
        if (events[i].t == 1) {
            for (j = 0; j <= 100000; j++) {
                dp[p][j] = dp[!p][j];
                if (j >= events[i].c) dp[p][j] = max(dp[p][j],dp[!p][j-events[i].c]-events[i].v);
            }
        }
        else {
            for (j = 0; j <= 100000; j++) {
                dp[p][j] = dp[!p][j];
                if (j <= 100000-events[i].c) dp[p][j] = max(dp[p][j],dp[!p][j+events[i].c]+events[i].v);
            }
        }
    }
    LLI ans = 0;
    for (i = 0; i <= 100000; i++) ans = max(ans,dp[(events.size()-1) & 1][i]);
    printf("%lld\n",ans);

    return 0;
}

Compilation message (stderr)

clo.cpp: In function 'int main()':
clo.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < events.size(); i++) {
                 ~~^~~~~~~~~~~~~~~
clo.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
clo.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&c,&f,&v);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~
clo.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&m);
     ~~~~~^~~~~~~~~
clo.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&c,&f,&v);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

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