Submission #135212

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
135212	2019-07-23T20:14:43 Z	duality	Art Exhibition (JOI18_art)	C++11	100 / 100	274 ms	21004 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 ----------

pair<LLI,int> p[500000];
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%lld %d",&p[i].first,&p[i].second);
    sort(p,p+N);

    LLI best = 0,sum = p[0].second;
    for (i = 1; i < N; i++) {
        sum -= p[i].first-p[i-1].first,sum = max(sum,0LL);
        sum += p[i].second,best = max(best,sum);
    }
    printf("%lld\n",best);

    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
art.cpp:63:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%lld %d",&p[i].first,&p[i].second);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	404 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	404 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	5 ms	504 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	504 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	4 ms	504 KB	Output is correct
33	Correct	5 ms	504 KB	Output is correct
34	Correct	5 ms	504 KB	Output is correct
35	Correct	5 ms	504 KB	Output is correct
36	Correct	4 ms	504 KB	Output is correct
37	Correct	4 ms	504 KB	Output is correct
38	Correct	5 ms	504 KB	Output is correct
39	Correct	5 ms	504 KB	Output is correct
40	Correct	5 ms	504 KB	Output is correct
41	Correct	5 ms	504 KB	Output is correct
42	Correct	4 ms	504 KB	Output is correct
43	Correct	4 ms	504 KB	Output is correct
44	Correct	4 ms	504 KB	Output is correct
45	Correct	4 ms	504 KB	Output is correct
46	Correct	4 ms	504 KB	Output is correct
47	Correct	4 ms	504 KB	Output is correct
48	Correct	4 ms	504 KB	Output is correct
49	Correct	4 ms	504 KB	Output is correct
50	Correct	4 ms	504 KB	Output is correct
51	Correct	5 ms	504 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	404 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	5 ms	504 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	504 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	4 ms	504 KB	Output is correct
33	Correct	5 ms	504 KB	Output is correct
34	Correct	5 ms	504 KB	Output is correct
35	Correct	5 ms	504 KB	Output is correct
36	Correct	4 ms	504 KB	Output is correct
37	Correct	4 ms	504 KB	Output is correct
38	Correct	5 ms	504 KB	Output is correct
39	Correct	5 ms	504 KB	Output is correct
40	Correct	5 ms	504 KB	Output is correct
41	Correct	5 ms	504 KB	Output is correct
42	Correct	4 ms	504 KB	Output is correct
43	Correct	4 ms	504 KB	Output is correct
44	Correct	4 ms	504 KB	Output is correct
45	Correct	4 ms	504 KB	Output is correct
46	Correct	4 ms	504 KB	Output is correct
47	Correct	4 ms	504 KB	Output is correct
48	Correct	4 ms	504 KB	Output is correct
49	Correct	4 ms	504 KB	Output is correct
50	Correct	4 ms	504 KB	Output is correct
51	Correct	5 ms	504 KB	Output is correct
52	Correct	267 ms	20688 KB	Output is correct
53	Correct	267 ms	20908 KB	Output is correct
54	Correct	274 ms	20768 KB	Output is correct
55	Correct	265 ms	20856 KB	Output is correct
56	Correct	271 ms	20832 KB	Output is correct
57	Correct	267 ms	20728 KB	Output is correct
58	Correct	263 ms	20856 KB	Output is correct
59	Correct	265 ms	20852 KB	Output is correct
60	Correct	263 ms	20728 KB	Output is correct
61	Correct	267 ms	20728 KB	Output is correct
62	Correct	267 ms	20820 KB	Output is correct
63	Correct	267 ms	20728 KB	Output is correct
64	Correct	265 ms	21004 KB	Output is correct
65	Correct	265 ms	20720 KB	Output is correct
66	Correct	266 ms	20768 KB	Output is correct
67	Correct	265 ms	20984 KB	Output is correct
68	Correct	258 ms	20976 KB	Output is correct

Submission #135212

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0