Submission #1144279

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144279		arafatenok	Art Exhibition (JOI18_art)	C++17	10 / 100	4 ms	328 KiB

art

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
using namespace std;

const int mod = 1e9 + 7;
const int N = 1e6 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }


void solve() {
    int n;
    cin >> n;
    int a[n], b[n];
    for(int i = 0; i < n; i++){
        cin >> a[i] >> b[i];
    }
    int mx = -inf;
    for(int msk = 1; msk < (1 << n); msk++){
        int sum = 0;
        int mxa = 0;
        int mna = inf;
        for(int i = 0; i < n; i++){
            if(msk & (1 << i)){
                sum += b[i];
                mxa = max(mxa, a[i]);
                mna = min(mna, a[i]);
            }
        }
        mx = max(mx, sum - mxa + mna);
    }
    cout << mx;
}



signed main() {
    gold;
    //freopen("pails.in", "r", stdin);
    //freopen("pails.out", "w", stdout);
    int t = 1;
    int ti = 1;
    //cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50