Submission #46496

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46496	2018-04-21T04:45:02 Z	luciocf	Art Exhibition (JOI18_art)	C++14	50 / 100	120 ms	3836 KB

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 100010;
const ll INF = 1e16+10;

pair<ll, ll> num[MAXN];
ll soma[MAXN];

int main(void)
{
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> num[i].first >> num[i].second;
    sort(num+1, num+n+1);

    for (int i = 1; i <= n; i++)
        soma[i] = soma[i-1]+num[i].second;

    ll ans = -INF;

    /*for (int i = 1; i <= n; i++)
    {
        ans = max(ans, num[i].second);
        for (int j = i-1; j >= 1; j--)
            ans = max(ans, soma[i]-soma[j-1]-num[i].first+num[j].first);
    }*/

    int pos = 0;
    for (int i = 1; i <= n; i++)
    {
        if (num[i].second > soma[i]-soma[pos-1]-num[i].first+num[pos].first)
            ans = max(ans, num[i].second), pos = i;
        else
            ans = max(ans, soma[i]-soma[pos-1]-num[i].first+num[pos].first);
    }
    cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	428 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	744 KB	Output is correct
10	Correct	2 ms	744 KB	Output is correct
11	Correct	2 ms	756 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	428 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	744 KB	Output is correct
10	Correct	2 ms	744 KB	Output is correct
11	Correct	2 ms	756 KB	Output is correct
12	Correct	3 ms	756 KB	Output is correct
13	Correct	3 ms	756 KB	Output is correct
14	Correct	2 ms	756 KB	Output is correct
15	Correct	2 ms	756 KB	Output is correct
16	Correct	2 ms	756 KB	Output is correct
17	Correct	2 ms	756 KB	Output is correct
18	Correct	2 ms	756 KB	Output is correct
19	Correct	2 ms	756 KB	Output is correct
20	Correct	2 ms	756 KB	Output is correct
21	Correct	2 ms	756 KB	Output is correct
22	Correct	2 ms	756 KB	Output is correct
23	Correct	2 ms	756 KB	Output is correct
24	Correct	2 ms	756 KB	Output is correct
25	Correct	3 ms	756 KB	Output is correct
26	Correct	3 ms	756 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	428 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	744 KB	Output is correct
10	Correct	2 ms	744 KB	Output is correct
11	Correct	2 ms	756 KB	Output is correct
12	Correct	3 ms	756 KB	Output is correct
13	Correct	3 ms	756 KB	Output is correct
14	Correct	2 ms	756 KB	Output is correct
15	Correct	2 ms	756 KB	Output is correct
16	Correct	2 ms	756 KB	Output is correct
17	Correct	2 ms	756 KB	Output is correct
18	Correct	2 ms	756 KB	Output is correct
19	Correct	2 ms	756 KB	Output is correct
20	Correct	2 ms	756 KB	Output is correct
21	Correct	2 ms	756 KB	Output is correct
22	Correct	2 ms	756 KB	Output is correct
23	Correct	2 ms	756 KB	Output is correct
24	Correct	2 ms	756 KB	Output is correct
25	Correct	3 ms	756 KB	Output is correct
26	Correct	3 ms	756 KB	Output is correct
27	Correct	8 ms	756 KB	Output is correct
28	Correct	9 ms	756 KB	Output is correct
29	Correct	8 ms	756 KB	Output is correct
30	Correct	9 ms	756 KB	Output is correct
31	Correct	8 ms	756 KB	Output is correct
32	Correct	14 ms	756 KB	Output is correct
33	Correct	8 ms	756 KB	Output is correct
34	Correct	10 ms	756 KB	Output is correct
35	Correct	13 ms	756 KB	Output is correct
36	Correct	8 ms	756 KB	Output is correct
37	Correct	8 ms	756 KB	Output is correct
38	Correct	8 ms	756 KB	Output is correct
39	Correct	8 ms	756 KB	Output is correct
40	Correct	11 ms	756 KB	Output is correct
41	Correct	8 ms	756 KB	Output is correct
42	Correct	8 ms	756 KB	Output is correct
43	Correct	9 ms	756 KB	Output is correct
44	Correct	8 ms	756 KB	Output is correct
45	Correct	9 ms	756 KB	Output is correct
46	Correct	13 ms	756 KB	Output is correct
47	Correct	13 ms	756 KB	Output is correct
48	Correct	9 ms	756 KB	Output is correct
49	Correct	8 ms	756 KB	Output is correct
50	Correct	8 ms	756 KB	Output is correct
51	Correct	8 ms	756 KB	Output is correct
52	Runtime error	120 ms	3836 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

Submission #46496

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