oj.uz

Submission #797399

# Submission time Handle Problem Language Result Execution time Memory
797399 2023-07-29T10:24:38 Z hariaakas646 Art Exhibition (JOI18_art) C++17
100 / 100
 216 ms 28616 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

int main()
{
    int n;
    scd(n);
    vector<pair<lli, int>> vec(n);

    frange(i, n)
    {
        sclld(vec[i].f);
        sclld(vec[i].s);
    }

    sort(all(vec));
    vll pref(n);
    pref[0] = vec[0].s;

    forr(i, 1, n)
    {
        pref[i] = pref[i - 1] + vec[i].s;
    }
    vll sufm(n);
    sufm[n - 1] = pref[n - 1] - vec[n - 1].f;
    for (int i = n - 2; i >= 0; i--)
    {
        sufm[i] = max(sufm[i + 1], pref[i] - vec[i].f);
    }
    lli ma = max(0LL, sufm[0] + vec[0].f);
    forr(i, 1, n)
    {
        ma = max(ma, sufm[i] - pref[i - 1] + vec[i].f);
    }
    printf("%lld", ma);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:6:24: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
    6 | #define sclld(t) scanf("%lld", &t)
      |                        ^~~~~~
art.cpp:36:9: note: in expansion of macro 'sclld'
   36 |         sclld(vec[i].s);
      |         ^~~~~
art.cpp:6:28: note: format string is defined here
    6 | #define sclld(t) scanf("%lld", &t)
      |                         ~~~^
      |                            |
      |                            long long int*
      |                         %d
art.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
art.cpp:30:5: note: in expansion of macro 'scd'
   30 |     scd(n);
      |     ^~~
art.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
art.cpp:35:9: note: in expansion of macro 'sclld'
   35 |         sclld(vec[i].f);
      |         ^~~~~
art.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
art.cpp:36:9: note: in expansion of macro 'sclld'
   36 |         sclld(vec[i].s);
      |         ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 304 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 568 KB Output is correct
29 Correct 2 ms 488 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 572 KB Output is correct
34 Correct 2 ms 568 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 568 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 564 KB Output is correct
40 Correct 2 ms 572 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 488 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 2 ms 564 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 3 ms 568 KB Output is correct
49 Correct 3 ms 564 KB Output is correct
50 Correct 2 ms 492 KB Output is correct
51 Correct 2 ms 468 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 304 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 568 KB Output is correct
29 Correct 2 ms 488 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 572 KB Output is correct
34 Correct 2 ms 568 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 568 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 564 KB Output is correct
40 Correct 2 ms 572 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 488 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 2 ms 564 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 3 ms 568 KB Output is correct
49 Correct 3 ms 564 KB Output is correct
50 Correct 2 ms 492 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 135 ms 28472 KB Output is correct
53 Correct 138 ms 28584 KB Output is correct
54 Correct 135 ms 28572 KB Output is correct
55 Correct 206 ms 28572 KB Output is correct
56 Correct 141 ms 28596 KB Output is correct
57 Correct 138 ms 28588 KB Output is correct
58 Correct 216 ms 28588 KB Output is correct
59 Correct 204 ms 28616 KB Output is correct
60 Correct 159 ms 28600 KB Output is correct
61 Correct 138 ms 28412 KB Output is correct
62 Correct 139 ms 28604 KB Output is correct
63 Correct 142 ms 28600 KB Output is correct
64 Correct 156 ms 28596 KB Output is correct
65 Correct 142 ms 28600 KB Output is correct
66 Correct 147 ms 28604 KB Output is correct
67 Correct 139 ms 28600 KB Output is correct
68 Correct 136 ms 28588 KB Output is correct