Submission #77103

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
77103	2018-09-21T11:38:02 Z	MohamedAhmed0	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	8928 KB

#include <bits/stdc++.h>

using namespace std;

long long n ;
vector< pair<long long , long long> >vp ;

int main()
{
    scanf("%lld" , &n);
    for(long long i = 0 ; i < n ; ++i)
    {
        long long x , y ;
        scanf("%lld %lld" , &x , &y);
        vp.push_back({x , y});
    }
    sort(vp.begin() , vp.end());
    long long ans = 0 ;
    for(long long i = 0 ; i < n ; ++i)
    {
        long long MAX = 0 , MIN = 1e18 , sum = 0 ;
        for(long long j = i ; j < n ; ++j)
        {
            MAX = max(MAX , vp[j].first);
            MIN = min(MIN , vp[j].first);
            sum += vp[j].second ;
            ans = max(ans , sum - (MAX - MIN)) ;
        }
    }
    return printf("%lld" , ans) , 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld" , &n);
     ~~~~~^~~~~~~~~~~~~
art.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld" , &x , &y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	2 ms	500 KB	Output is correct
3	Correct	2 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	2 ms	596 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	2 ms	596 KB	Output is correct
8	Correct	2 ms	596 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	2 ms	608 KB	Output is correct
13	Correct	2 ms	608 KB	Output is correct
14	Correct	2 ms	608 KB	Output is correct
15	Correct	2 ms	608 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	608 KB	Output is correct
18	Correct	2 ms	608 KB	Output is correct
19	Correct	2 ms	608 KB	Output is correct
20	Correct	2 ms	608 KB	Output is correct
21	Correct	2 ms	608 KB	Output is correct
22	Correct	2 ms	608 KB	Output is correct
23	Correct	2 ms	736 KB	Output is correct
24	Correct	2 ms	736 KB	Output is correct
25	Correct	2 ms	736 KB	Output is correct
26	Correct	2 ms	736 KB	Output is correct
27	Correct	27 ms	736 KB	Output is correct
28	Correct	26 ms	736 KB	Output is correct
29	Correct	27 ms	864 KB	Output is correct
30	Correct	27 ms	876 KB	Output is correct
31	Correct	28 ms	876 KB	Output is correct
32	Correct	27 ms	876 KB	Output is correct
33	Correct	28 ms	876 KB	Output is correct
34	Correct	27 ms	876 KB	Output is correct
35	Correct	27 ms	876 KB	Output is correct
36	Correct	28 ms	876 KB	Output is correct
37	Correct	27 ms	876 KB	Output is correct
38	Correct	28 ms	876 KB	Output is correct
39	Correct	27 ms	876 KB	Output is correct
40	Correct	30 ms	876 KB	Output is correct
41	Correct	28 ms	876 KB	Output is correct
42	Correct	43 ms	876 KB	Output is correct
43	Correct	27 ms	876 KB	Output is correct
44	Correct	27 ms	876 KB	Output is correct
45	Correct	28 ms	876 KB	Output is correct
46	Correct	27 ms	876 KB	Output is correct
47	Correct	27 ms	876 KB	Output is correct
48	Correct	28 ms	876 KB	Output is correct
49	Correct	26 ms	876 KB	Output is correct
50	Correct	31 ms	876 KB	Output is correct
51	Correct	27 ms	876 KB	Output is correct
52	Execution timed out	1078 ms	8928 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #77103

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0