oj.uz

Submission #1119845

# Submission time Handle Problem Language Result Execution time Memory
1119845 2024-11-27T13:52:37 Z Hduong Art Exhibition (JOI18_art) C++17
10 / 100
 5 ms 2556 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;

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 ;
//  cout << sum << " " << ma << " " << mi << "\n";
//  for (int i = 1; i <= n; i++) cout << x[i] << " ";
//  cout << "\n";
  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];
  if (n <= 20) {
    duyet(1);
    cout << res;
  }
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2384 KB Output is correct
2 Correct 5 ms 2516 KB Output is correct
3 Correct 4 ms 2384 KB Output is correct
4 Correct 5 ms 2552 KB Output is correct
5 Correct 3 ms 2384 KB Output is correct
6 Correct 4 ms 2384 KB Output is correct
7 Correct 4 ms 2384 KB Output is correct
8 Correct 3 ms 2384 KB Output is correct
9 Correct 4 ms 2516 KB Output is correct
10 Correct 4 ms 2384 KB Output is correct
11 Correct 4 ms 2384 KB Output is correct
12 Incorrect 2 ms 2556 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2384 KB Output is correct
2 Correct 5 ms 2516 KB Output is correct
3 Correct 4 ms 2384 KB Output is correct
4 Correct 5 ms 2552 KB Output is correct
5 Correct 3 ms 2384 KB Output is correct
6 Correct 4 ms 2384 KB Output is correct
7 Correct 4 ms 2384 KB Output is correct
8 Correct 3 ms 2384 KB Output is correct
9 Correct 4 ms 2516 KB Output is correct
10 Correct 4 ms 2384 KB Output is correct
11 Correct 4 ms 2384 KB Output is correct
12 Incorrect 2 ms 2556 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2384 KB Output is correct
2 Correct 5 ms 2516 KB Output is correct
3 Correct 4 ms 2384 KB Output is correct
4 Correct 5 ms 2552 KB Output is correct
5 Correct 3 ms 2384 KB Output is correct
6 Correct 4 ms 2384 KB Output is correct
7 Correct 4 ms 2384 KB Output is correct
8 Correct 3 ms 2384 KB Output is correct
9 Correct 4 ms 2516 KB Output is correct
10 Correct 4 ms 2384 KB Output is correct
11 Correct 4 ms 2384 KB Output is correct
12 Incorrect 2 ms 2556 KB Output isn't correct
13 Halted 0 ms 0 KB -