oj.uz

Submission #1119908

# Submission time Handle Problem Language Result Execution time Memory
1119908 2024-11-27T15:06:56 Z Hduong Art Exhibition (JOI18_art) C++17
100 / 100
 175 ms 32636 KB 
#include <bits/stdc++.h>
#define INF 1e18
#define task "task"

using namespace std;
const int N = 5e5 + 5,
          M = 20;
long long a[N], b[N], n, x[M], res = 0, sum[N];
pair <long long, long long> pi[N];

void check() {
  long long sum = 0, mi = INF, ma = -INF, ok = 0;
  for (int i = 1; i <= n; i++) {
    if (x[i] == 0) continue ;
    sum += b[i];
    mi = min(mi, a[i]);
    ma = max(ma, a[i]);
    ++ok;
  }
  if (ok < 1) return ;
  res = max(res, sum - ma + mi);
}

void duyet(long long i) {
  if (i > n) check();
  else {
    for (int j = 0; j < 2; j++) {
      x[i] = j;
      duyet(i + 1);
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  if (fopen (task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i] >> b[i];
    pi[i].first = a[i];
    pi[i].second = b[i];
  }
  if (n <= 20) {
    duyet(1);
    cout << res;
  }
  else if (n <= 5000) {
    long long res = 0;
    sort(pi + 1, pi + n + 1);
    for(int i = 1; i <= n; i++) sum[i] = sum[i - 1] + pi[i].second;
    for (int l = 1; l < n; l++) {
      for (int r = l + 1; r <= n; r++) {
        res = max(res, sum[r] - sum[l - 1] - pi[r].first + pi[l].first);
      }
    }
    cout << res << "\n";
  }
  else {
    sort(pi + 1, pi + n + 1);
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + pi[i].second;
//    for (int i = 1; i <= n; i++) cout << pi[i].first << " " << pi[i].second << " " << sum[i] << "\n";
//    cout << "\n";
    long long res = 0, ma = pi[1].first;
    for (int i = 2; i <= n; i++) {
//      cout << ma << " " << res << " " << sum[i] - pi[i].first + ma << " " << sum[i] << " " << pi[i].first << "\n";
      res = max(res, sum[i] - pi[i].first + ma);
      ma = max(ma, -sum[i - 1] + pi[i].first);
    }
    cout << res;
  }

  /// sum[r]  - a[max] - (sum[l - 1] - a[min])
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:39:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     freopen (task".inp", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:40:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     freopen (task".out", "w", stdout);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 4 ms 484 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 1 ms 336 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 468 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 504 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 336 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 4 ms 484 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 1 ms 336 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 468 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 504 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 14 ms 592 KB Output is correct
28 Correct 16 ms 812 KB Output is correct
29 Correct 14 ms 592 KB Output is correct
30 Correct 14 ms 592 KB Output is correct
31 Correct 14 ms 592 KB Output is correct
32 Correct 14 ms 592 KB Output is correct
33 Correct 15 ms 592 KB Output is correct
34 Correct 15 ms 764 KB Output is correct
35 Correct 14 ms 592 KB Output is correct
36 Correct 16 ms 808 KB Output is correct
37 Correct 17 ms 812 KB Output is correct
38 Correct 14 ms 592 KB Output is correct
39 Correct 14 ms 808 KB Output is correct
40 Correct 14 ms 592 KB Output is correct
41 Correct 15 ms 808 KB Output is correct
42 Correct 17 ms 808 KB Output is correct
43 Correct 14 ms 592 KB Output is correct
44 Correct 16 ms 592 KB Output is correct
45 Correct 15 ms 592 KB Output is correct
46 Correct 14 ms 812 KB Output is correct
47 Correct 14 ms 816 KB Output is correct
48 Correct 16 ms 592 KB Output is correct
49 Correct 16 ms 592 KB Output is correct
50 Correct 14 ms 592 KB Output is correct
51 Correct 14 ms 592 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 4 ms 484 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 5 ms 336 KB Output is correct
12 Correct 1 ms 336 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 468 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 504 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 14 ms 592 KB Output is correct
28 Correct 16 ms 812 KB Output is correct
29 Correct 14 ms 592 KB Output is correct
30 Correct 14 ms 592 KB Output is correct
31 Correct 14 ms 592 KB Output is correct
32 Correct 14 ms 592 KB Output is correct
33 Correct 15 ms 592 KB Output is correct
34 Correct 15 ms 764 KB Output is correct
35 Correct 14 ms 592 KB Output is correct
36 Correct 16 ms 808 KB Output is correct
37 Correct 17 ms 812 KB Output is correct
38 Correct 14 ms 592 KB Output is correct
39 Correct 14 ms 808 KB Output is correct
40 Correct 14 ms 592 KB Output is correct
41 Correct 15 ms 808 KB Output is correct
42 Correct 17 ms 808 KB Output is correct
43 Correct 14 ms 592 KB Output is correct
44 Correct 16 ms 592 KB Output is correct
45 Correct 15 ms 592 KB Output is correct
46 Correct 14 ms 812 KB Output is correct
47 Correct 14 ms 816 KB Output is correct
48 Correct 16 ms 592 KB Output is correct
49 Correct 16 ms 592 KB Output is correct
50 Correct 14 ms 592 KB Output is correct
51 Correct 14 ms 592 KB Output is correct
52 Correct 169 ms 32544 KB Output is correct
53 Correct 154 ms 32460 KB Output is correct
54 Correct 149 ms 32588 KB Output is correct
55 Correct 160 ms 32584 KB Output is correct
56 Correct 145 ms 32636 KB Output is correct
57 Correct 146 ms 32584 KB Output is correct
58 Correct 173 ms 32456 KB Output is correct
59 Correct 149 ms 32588 KB Output is correct
60 Correct 156 ms 32628 KB Output is correct
61 Correct 170 ms 32480 KB Output is correct
62 Correct 142 ms 32428 KB Output is correct
63 Correct 140 ms 32504 KB Output is correct
64 Correct 150 ms 32460 KB Output is correct
65 Correct 175 ms 32448 KB Output is correct
66 Correct 165 ms 32584 KB Output is correct
67 Correct 144 ms 32596 KB Output is correct
68 Correct 153 ms 32592 KB Output is correct