제출 #1225007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225007		crazy0215	Hacker (BOI15_hac)	C++20	40 / 100	1095 ms	5652 KiB

hac

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define show(x) cout << #x << " " << x << "\n";
#define showds(x) cout << #x << " "; for(auto y : x) cout << y << " "; cout << "\n";
typedef pair<int, int> ii;

bool cmp(pair<int, ii> a, pair<int, ii> b) {
	//if (a.fi==b.fi) return a.se<b.se;
	return a.fi>b.fi;
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int a[n+n/2-1], ans=0, m=0;
    pair<int, ii> b[n];
    for (int i=0; i<n; i++) {
		cin >> a[i];
		ans+=a[i];
		if (i<n/2) m+=a[i];
	}
	b[0].fi=m, b[0].se.fi=0, b[0].se.se=n/2-1;
	for (int i=n; i<n+n/2-1; i++) a[i]=a[i%n];
    //showds(a)
	for (int i=n/2, j=0; j<n-1; i++, j++) {
        m+=-a[j]+a[i], b[j+1].fi=m, b[j+1].se.fi=j+1, b[j+1].se.se=i%n;
        //show(j+1)
    }
	//for (auto i:b) cout << i.fi << ' ';
    sort(b, b+n, cmp);
    ////<<3;
	set<int> c;
	if (b[0].se.fi<=b[0].se.se) for (int i=b[0].se.fi; i<=b[0].se.se; i++) c.insert(i);
    else {
        for (int i=0; i<=b[0].se.se; i++) c.insert(i);
        for (int i=b[0].se.fi; i<n; i++) c.insert(i);
    }
    //showds(c)
	for (int i=1; i<n; i++) {
        set<int> d;
		for (int x:c) {
            /*if (i==1) {
                show(x) show(b[i].se.fi) show(b[i].se.se)
            }*/
            if ((b[i].se.se>=b[i].se.fi&&(x<b[i].se.fi||x>b[i].se.se))||(b[i].se.se<=b[i].se.fi&&(x>b[i].se.se&&x<b[i].se.fi))) {
                //if (i==1){show(1)show(x)}
                d.insert(x);
            }
        }
        for (int x:d) c.erase(x);
		if (c.empty()) {
            //show (b[i].fi)
			cout << ans-b[i].fi;
			break;
		}
	}
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 40