# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119845 | Hduong | Art Exhibition (JOI18_art) | C++17 | 5 ms | 2556 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |