oj.uz

Submission #77370

# Submission time Handle Problem Language Result Execution time Memory
77370 2018-09-26T23:17:10 Z duality Cloud Computing (CEOI18_clo) C++11
100 / 100
 800 ms 3444 KB 
#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

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.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 4 ms 1996 KB Output is correct
3 Correct 22 ms 1996 KB Output is correct
4 Correct 37 ms 1996 KB Output is correct
5 Correct 339 ms 2096 KB Output is correct
6 Correct 312 ms 2176 KB Output is correct
7 Correct 336 ms 2288 KB Output is correct
8 Correct 337 ms 2336 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2336 KB Output is correct
2 Correct 5 ms 2336 KB Output is correct
3 Correct 24 ms 2336 KB Output is correct
4 Correct 23 ms 2336 KB Output is correct
5 Correct 169 ms 2336 KB Output is correct
6 Correct 167 ms 2460 KB Output is correct
7 Correct 380 ms 2460 KB Output is correct
8 Correct 376 ms 2528 KB Output is correct
9 Correct 467 ms 2568 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2568 KB Output is correct
2 Correct 8 ms 2568 KB Output is correct
3 Correct 42 ms 2568 KB Output is correct
4 Correct 34 ms 2568 KB Output is correct
5 Correct 68 ms 2568 KB Output is correct
6 Correct 76 ms 2568 KB Output is correct
7 Correct 97 ms 2568 KB Output is correct
8 Correct 91 ms 2568 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2568 KB Output is correct
2 Correct 6 ms 2568 KB Output is correct
3 Correct 291 ms 2648 KB Output is correct
4 Correct 301 ms 2684 KB Output is correct
5 Correct 665 ms 2860 KB Output is correct
6 Correct 800 ms 2860 KB Output is correct
7 Correct 700 ms 2960 KB Output is correct
8 Correct 686 ms 3008 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3008 KB Output is correct
2 Correct 30 ms 3008 KB Output is correct
3 Correct 154 ms 3008 KB Output is correct
4 Correct 347 ms 3008 KB Output is correct
5 Correct 685 ms 3032 KB Output is correct
6 Correct 698 ms 3060 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 4 ms 1996 KB Output is correct
3 Correct 22 ms 1996 KB Output is correct
4 Correct 37 ms 1996 KB Output is correct
5 Correct 339 ms 2096 KB Output is correct
6 Correct 312 ms 2176 KB Output is correct
7 Correct 336 ms 2288 KB Output is correct
8 Correct 337 ms 2336 KB Output is correct
9 Correct 4 ms 2336 KB Output is correct
10 Correct 5 ms 2336 KB Output is correct
11 Correct 24 ms 2336 KB Output is correct
12 Correct 23 ms 2336 KB Output is correct
13 Correct 169 ms 2336 KB Output is correct
14 Correct 167 ms 2460 KB Output is correct
15 Correct 380 ms 2460 KB Output is correct
16 Correct 376 ms 2528 KB Output is correct
17 Correct 467 ms 2568 KB Output is correct
18 Correct 8 ms 2568 KB Output is correct
19 Correct 8 ms 2568 KB Output is correct
20 Correct 42 ms 2568 KB Output is correct
21 Correct 34 ms 2568 KB Output is correct
22 Correct 68 ms 2568 KB Output is correct
23 Correct 76 ms 2568 KB Output is correct
24 Correct 97 ms 2568 KB Output is correct
25 Correct 91 ms 2568 KB Output is correct
26 Correct 6 ms 2568 KB Output is correct
27 Correct 6 ms 2568 KB Output is correct
28 Correct 291 ms 2648 KB Output is correct
29 Correct 301 ms 2684 KB Output is correct
30 Correct 665 ms 2860 KB Output is correct
31 Correct 800 ms 2860 KB Output is correct
32 Correct 700 ms 2960 KB Output is correct
33 Correct 686 ms 3008 KB Output is correct
34 Correct 4 ms 3008 KB Output is correct
35 Correct 30 ms 3008 KB Output is correct
36 Correct 154 ms 3008 KB Output is correct
37 Correct 347 ms 3008 KB Output is correct
38 Correct 685 ms 3032 KB Output is correct
39 Correct 698 ms 3060 KB Output is correct
40 Correct 188 ms 3060 KB Output is correct
41 Correct 341 ms 3060 KB Output is correct
42 Correct 530 ms 3128 KB Output is correct
43 Correct 729 ms 3192 KB Output is correct
44 Correct 725 ms 3256 KB Output is correct
45 Correct 700 ms 3340 KB Output is correct
46 Correct 557 ms 3340 KB Output is correct
47 Correct 516 ms 3400 KB Output is correct
48 Correct 527 ms 3444 KB Output is correct