oj.uz

Submission #1033888

# Submission time Handle Problem Language Result Execution time Memory
1033888 2024-07-25T07:34:20 Z vjudge1 Art Exhibition (JOI18_art) C++14
100 / 100
 159 ms 24780 KB 
#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
#define ll long long
#define S second
#define F first
 
int main()
{
    int n;
    scanf("%d", &n);
    vector<pair<ll, ll>> q(n);
    for(int i = 0; i < n; ++i)
    {
        scanf("%lld %lld", &q[i].F, &q[i].S);
    }
 
    sort(q.begin(), q.end());
 
    vector<ll> p(n + 1, 0);
    for(int i = 1; i <= n; ++i)
    {
        p[i] = p[i - 1] + q[i - 1].S;
    }
 
    ll mx = 0, ans = 0;
    for(int i = 1; i <= n; ++i)
    {
        mx = max(mx, -p[i - 1] + q[i - 1].F);
        ans = max(ans, p[i] - q[i - 1].F + mx);
    }
 
    printf("%lld", ans);
 
    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 436 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 444 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 644 KB Output is correct
41 Correct 2 ms 608 KB Output is correct
42 Correct 2 ms 452 KB Output is correct
43 Correct 2 ms 608 KB Output is correct
44 Correct 2 ms 628 KB Output is correct
45 Correct 2 ms 608 KB Output is correct
46 Correct 2 ms 448 KB Output is correct
47 Correct 1 ms 608 KB Output is correct
48 Correct 3 ms 616 KB Output is correct
49 Correct 2 ms 608 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 1 ms 616 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 436 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 444 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 644 KB Output is correct
41 Correct 2 ms 608 KB Output is correct
42 Correct 2 ms 452 KB Output is correct
43 Correct 2 ms 608 KB Output is correct
44 Correct 2 ms 628 KB Output is correct
45 Correct 2 ms 608 KB Output is correct
46 Correct 2 ms 448 KB Output is correct
47 Correct 1 ms 608 KB Output is correct
48 Correct 3 ms 616 KB Output is correct
49 Correct 2 ms 608 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 1 ms 616 KB Output is correct
52 Correct 144 ms 24628 KB Output is correct
53 Correct 130 ms 24624 KB Output is correct
54 Correct 126 ms 24644 KB Output is correct
55 Correct 138 ms 24780 KB Output is correct
56 Correct 159 ms 24672 KB Output is correct
57 Correct 131 ms 24624 KB Output is correct
58 Correct 135 ms 24660 KB Output is correct
59 Correct 122 ms 24612 KB Output is correct
60 Correct 121 ms 24636 KB Output is correct
61 Correct 123 ms 24660 KB Output is correct
62 Correct 127 ms 24636 KB Output is correct
63 Correct 126 ms 24656 KB Output is correct
64 Correct 137 ms 24656 KB Output is correct
65 Correct 121 ms 24656 KB Output is correct
66 Correct 143 ms 24748 KB Output is correct
67 Correct 127 ms 24736 KB Output is correct
68 Correct 119 ms 24656 KB Output is correct