Submission #1313065

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313065		Agageldi	Art Exhibition (JOI18_art)	C++20	0 / 100	1 ms	336 KiB

art

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define N 500005
#define f first
#define s second

int tc = 1, n, ans;
pair <int,int> a[N];
void solve(int x,int mx,int mn,int sum) {
    if(x == n + 1) {
        if(!sum) return;
        // cout << sum << " " << mn << " " << mx << '\n';
        ans = max(ans,sum-(mx-mn));
        return;
    }
    solve(x + 1, max(mx,a[x].f),min(mn,a[x].f),sum + a[x].s);
    solve(x + 1,mx,mn,sum);
}

int32_t main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].f >> a[i].s;
    }
    solve(1, 0, INT_MAX, 0);
    cout << ans << '\n';
    return 0;
}

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