Submission #577988

#	Time	Username	Problem	Language	Result	Execution time	Memory
577988		SlavicG	Holiday (IOI14_holiday)	C++17	0 / 100	5057 ms	7860 KiB

holiday

#include "bits/stdc++.h"
#include"holiday.h"
using namespace std;

#define ll long long

const int N = 2e5 + 10;
ll c[N], sum[4 * N], cnt[4 * N], lazy[4 * N], pos[N], bruh;
pair<ll, ll> rr[5 * N];

ll query(int i, int l, int r, int k) {
    if(l > r || k <= 0) return 0;
    if(cnt[i] <= k) return sum[i];
    int mid = l + r >> 1;
    if(cnt[2 * i] > k) return query(2 * i, l, mid, k);
    return sum[2 * i] + query(2 * i + 1, mid + 1, r, k - cnt[2 * i]);
}

void modif(int i, int l, int r, int pos, bool b) {
    if(l > pos || r < pos) return;
    if(l == pos && r == pos) {
        sum[i] = (b ? c[l] : 0);
        cnt[i] = b;
        return;
    }
    int mid = l + r >> 1;
    modif(2 * i, l, mid, pos, b);
    modif(2 * i + 1, mid + 1, r, pos, b);
    sum[i] = sum[2 * i] + sum[2 * i + 1];
    cnt[i] = cnt[2 * i] + cnt[2 * i + 1];
}

void rec(int dl, int dr, int l, int r, int start) {
    if(l > r || dl > dr) return;
    ll ans = 0, idx = l;
    int d = ((dl + dr) >> 1) - abs(l - start);
    for(int i = 0; i < l; ++i) modif(1, 0, N - 1, pos[i], 1);
    for(int i = l; i <= r && d >= 0; ++i) {
        modif(1, 0, N - 1, pos[i], 1);
        if(ans < query(1, 0, N - 1, d)) {
            ans = query(1, 0, N - 1, d);
            idx = i;
        }
        --d;
    }

    for(int i = 0; i <= r; ++i) modif(1, 0, N - 1, pos[i], 0);
    d = (dl + dr) >> 1;
    rr[d] = {ans, idx};
    if(dl == dr) return;
    rec(dl, d - 1, l, idx, start);
    rec(d + 1, dr, idx, r, start);

}
long long int findMaxAttraction(int n, int start, int d, int a[]) {
    bruh = n;
    vector<pair<int, int>> x;
    for(int i = 0; i < n; ++i) x.push_back({a[i], i});
    sort(x.rbegin(), x.rend());
    for(int i = 0; i < n; ++i) {
        c[i] = x[i].first;
        pos[x[i].second] = i;
    }
    rec(1, d, 0, n - 1, 0);
    return rr[d].first;
}

Compilation message (stderr)

holiday.cpp: In function 'long long int query(int, int, int, int)':
holiday.cpp:14:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   14 |     int mid = l + r >> 1;
      |               ~~^~~
holiday.cpp: In function 'void modif(int, int, int, int, bool)':
holiday.cpp:26:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |     int mid = l + r >> 1;
      |               ~~^~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53