oj.uz

Submission #968563

# Submission time Handle Problem Language Result Execution time Memory
968563 2024-04-23T15:44:33 Z tset Art Exhibition (JOI18_art) C++14
100 / 100
 170 ms 28848 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

const int INF = 1e18 +42;

signed main()
{
    int N;
    scanf("%lld", &N);
    vector<pair<int, int>> tab;
    for(int iTab = 0; iTab < N; iTab++)
    {
        int A, B;
        scanf("%lld%lld", &A, &B);
        tab.push_back({A, B});
    }
    sort(tab.begin(), tab.end());

    vector<int> cumulS(N+1, 0);
    for(int i= 1; i<=N; i++)
    {
        cumulS[i] = cumulS[i-1] + tab[i-1].second;
    }
    
    vector<int> bonus(N+1);
    for(int i=1; i<=N; i++)
    {
        bonus[i] = max(tab[i-1].first - cumulS[i-1], bonus[i-1]);
    }
    int ans = -INF;

    for(int iMax=1; iMax<= N; iMax++)
    {
        ans = max(ans, cumulS[iMax] + bonus[iMax] - tab[iMax-1].first);
    }
    printf("%lld\n", ans);

}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 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 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 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 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 708 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 856 KB Output is correct
34 Correct 2 ms 1116 KB Output is correct
35 Correct 2 ms 572 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 608 KB Output is correct
42 Correct 2 ms 608 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 568 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 768 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 2 ms 604 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 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 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 708 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 856 KB Output is correct
34 Correct 2 ms 1116 KB Output is correct
35 Correct 2 ms 572 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 608 KB Output is correct
42 Correct 2 ms 608 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 568 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 768 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 141 ms 28592 KB Output is correct
53 Correct 141 ms 28592 KB Output is correct
54 Correct 144 ms 28848 KB Output is correct
55 Correct 140 ms 28592 KB Output is correct
56 Correct 145 ms 28588 KB Output is correct
57 Correct 141 ms 28652 KB Output is correct
58 Correct 141 ms 28704 KB Output is correct
59 Correct 152 ms 28480 KB Output is correct
60 Correct 159 ms 28700 KB Output is correct
61 Correct 151 ms 28572 KB Output is correct
62 Correct 139 ms 28848 KB Output is correct
63 Correct 170 ms 28620 KB Output is correct
64 Correct 145 ms 28844 KB Output is correct
65 Correct 165 ms 28588 KB Output is correct
66 Correct 140 ms 28588 KB Output is correct
67 Correct 151 ms 28848 KB Output is correct
68 Correct 143 ms 28728 KB Output is correct