답안 #1101788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101788	2024-10-16T19:34:20 Z	kasdo	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	19784 KB

art

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define speed cin.tie (0) -> sync_with_stdio (0);ios_base::sync_with_stdio(false);cin.tie(0);
void solve()
{
    int n;
    cin>>n;
    pair<int, int> a[n + 5];
    
    for(int i=1; i<=n; i++) cin>>a[i].first>>a[i].second;
    sort(a+1, a+n+1);
    
    int s[n + 5] = {}, mx[n + 5] = {}, p[n + 5] = {};
    for(int i=1; i<=n; i++)
    {
        p[i] = p[i - 1] + a[i].second;
    }

    int ans = 0;
    for(int i=1; i<=n; i++)
    {
        int cur = -1000000000000000000;
        for(int j=i; j<=n; j++) cur = max(cur, (p[j] - a[j].first));
        // ai = mn, aj = mx;
        ans = max(ans, cur - (p[i - 1] - a[i].first));
        // ans = max(ans, cur - (p[i - 1] - a[i].first));
    }
    cout<<ans<<endl;
}
signed main ()
{
    speed
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    
    int _ = 1;
    // cin>>_;
    
    while(_--) solve();
    
    return 0;
}

Compilation message

art.cpp: In function 'void solve()':
art.cpp:15:9: warning: unused variable 's' [-Wunused-variable]
   15 |     int s[n + 5] = {}, mx[n + 5] = {}, p[n + 5] = {};
      |         ^
art.cpp:15:24: warning: unused variable 'mx' [-Wunused-variable]
   15 |     int s[n + 5] = {}, mx[n + 5] = {}, p[n + 5] = {};
      |                        ^~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	504 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	504 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	504 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	504 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	504 KB	Output is correct
27	Correct	10 ms	592 KB	Output is correct
28	Correct	11 ms	648 KB	Output is correct
29	Correct	10 ms	592 KB	Output is correct
30	Correct	10 ms	656 KB	Output is correct
31	Correct	10 ms	532 KB	Output is correct
32	Correct	10 ms	656 KB	Output is correct
33	Correct	10 ms	652 KB	Output is correct
34	Correct	10 ms	592 KB	Output is correct
35	Correct	10 ms	648 KB	Output is correct
36	Correct	10 ms	592 KB	Output is correct
37	Correct	10 ms	592 KB	Output is correct
38	Correct	10 ms	648 KB	Output is correct
39	Correct	10 ms	592 KB	Output is correct
40	Correct	10 ms	592 KB	Output is correct
41	Correct	10 ms	660 KB	Output is correct
42	Correct	10 ms	592 KB	Output is correct
43	Correct	10 ms	592 KB	Output is correct
44	Correct	10 ms	592 KB	Output is correct
45	Correct	10 ms	592 KB	Output is correct
46	Correct	10 ms	648 KB	Output is correct
47	Correct	10 ms	592 KB	Output is correct
48	Correct	10 ms	592 KB	Output is correct
49	Correct	10 ms	648 KB	Output is correct
50	Correct	10 ms	592 KB	Output is correct
51	Correct	10 ms	592 KB	Output is correct

Subtask #4

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	504 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	504 KB	Output is correct
27	Correct	10 ms	592 KB	Output is correct
28	Correct	11 ms	648 KB	Output is correct
29	Correct	10 ms	592 KB	Output is correct
30	Correct	10 ms	656 KB	Output is correct
31	Correct	10 ms	532 KB	Output is correct
32	Correct	10 ms	656 KB	Output is correct
33	Correct	10 ms	652 KB	Output is correct
34	Correct	10 ms	592 KB	Output is correct
35	Correct	10 ms	648 KB	Output is correct
36	Correct	10 ms	592 KB	Output is correct
37	Correct	10 ms	592 KB	Output is correct
38	Correct	10 ms	648 KB	Output is correct
39	Correct	10 ms	592 KB	Output is correct
40	Correct	10 ms	592 KB	Output is correct
41	Correct	10 ms	660 KB	Output is correct
42	Correct	10 ms	592 KB	Output is correct
43	Correct	10 ms	592 KB	Output is correct
44	Correct	10 ms	592 KB	Output is correct
45	Correct	10 ms	592 KB	Output is correct
46	Correct	10 ms	648 KB	Output is correct
47	Correct	10 ms	592 KB	Output is correct
48	Correct	10 ms	592 KB	Output is correct
49	Correct	10 ms	648 KB	Output is correct
50	Correct	10 ms	592 KB	Output is correct
51	Correct	10 ms	592 KB	Output is correct
52	Execution timed out	1065 ms	19784 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-