oj.uz

Submission #809086

# Submission time Handle Problem Language Result Execution time Memory
809086 2023-08-05T16:35:03 Z htphong0909 Holiday (IOI14_holiday) C++17
100 / 100
 1106 ms 6640 KB 
#include <bits/stdc++.h>
#include "holiday.h"
using namespace std;
 
void File() {
 
#define file "test"
    freopen(file".in", "r", stdin);
    freopen(file".out", "w", stdout);
}
 
set<pair<int, int>> chosen;
set<pair<int, int>, greater<>> have;
long long curSum = 0;
int lt = 1;
int rt = 0;
int n, d, start;
int du;
int arr[100001];
long long ans = -1e18;
 
void giveToHave()
{
    du++;
    have.insert(*chosen.begin());
    curSum -= chosen.begin()->first;
    chosen.erase(chosen.begin());
}
 
void giveToChosen()
{
    du--;
    chosen.insert(*have.begin());
    curSum += have.begin()->first;
    have.erase(have.begin());
}
 
void trade()
{
    pair<int, int> temp1 = *have.begin();
    pair<int, int> temp2 = *(--chosen.end());
    curSum = curSum - temp2.first + temp1.first;
    have.erase(have.begin());
    chosen.erase(--chosen.end());
    have.insert(temp2);
    chosen.insert(temp1);
}
 
void Add(int x)
{
    if (du > 0)
    {
        du--;
        curSum += arr[x];
        chosen.insert(make_pair(arr[x], x));
    }
    else if (!chosen.empty() && arr[x] > chosen.begin()->first)
    {
        curSum -= chosen.begin()->first;
        have.insert(*chosen.begin());
        chosen.erase(chosen.begin());
        chosen.insert(make_pair(arr[x], x));
        curSum += arr[x];
    }
    else have.insert(make_pair(arr[x], x));
}
 
/*void Add(int x)
{
    have.insert(make_pair(arr[x], x));
}*/
 
void Del(int x)
{
    if (chosen.find(make_pair(arr[x], x)) != chosen.end())
    {
        chosen.erase(make_pair(arr[x], x));
        curSum -= arr[x];
        du++;
        if (!have.empty() && du > 0) giveToChosen();
    }
    else have.erase(make_pair(arr[x], x));
}
 
int calcDis(int l, int r)
{
    if (l > r) return 0;
    if (start <= l) return(l - start + (r - l));
    if (start >= r) return(start - r + (r - l));
    return (min(start - l, r - start) + (r - l));
}
 
long long cost(int l, int r)
{
    while (lt != l || rt != r)
    {
        while (rt < r)
        {
            du += calcDis(lt, rt) - calcDis(lt, rt + 1);
            rt++;
            Add(rt);
            //while (!have.empty() && !chosen.empty() && have.begin()->first > (--chosen.end())->first) trade();
            while (du < 0 && !chosen.empty()) giveToHave();
            while (du > 0 && !have.empty()) giveToChosen();
        }
        while (rt > lt && rt > r)
        {
            du += calcDis(lt, rt) - calcDis(lt, rt - 1);
            Del(rt);
            rt--;
            //while (!have.empty() && !chosen.empty() && have.begin()->first > (--chosen.end())->first) trade();
            while (du < 0 && !chosen.empty()) giveToHave();
            while (du > 0 && !have.empty()) giveToChosen();
        }
        while (lt < rt && lt < l)
        {
            du += calcDis(lt, rt) - calcDis(lt + 1, rt);
            Del(lt);
            lt++;
            //while (!have.empty() && !chosen.empty() && have.begin()->first > (--chosen.end())->first) trade();
            while (du < 0 && !chosen.empty()) giveToHave();
            while (du > 0 && !have.empty()) giveToChosen();
        }
        while (lt > l)
        {
            du += calcDis(lt, rt) - calcDis(lt - 1, rt);
            lt--;
            Add(lt);
            //while (!have.empty() && !chosen.empty() && have.begin()->first > (--chosen.end())->first) trade();
            while (du < 0 && !chosen.empty()) giveToHave();
            while (du > 0 && !have.empty()) giveToChosen();
        }
    }
    return curSum;
}
 
void divide(int l, int r, int gL, int gR)
{
    if (l > r) return;
    int mid = (l + r) / 2;
    long long bestCost = -1e18;
    int bestPos = gL;
    for (int i = gL; i <= min(mid, gR); i++)
    {
        if (cost(i, mid) > bestCost)
        {
            bestCost = cost(i, mid);
            bestPos = i;
        }
    }
    ans = max(ans, bestCost);
    divide(l, mid - 1, gL, bestPos);
    divide(mid + 1, r, bestPos, gR);
}
 
long long findMaxAttraction(int _n, int _start, int _d, int *attraction)
{
    n = _n;
    d = _d;
    start = _start + 1;
    for (int i = 1; i <= n; i++) arr[i] = attraction[i - 1];
    du = d;
    divide(1, n, 1, n);
    return ans;
}
 
/*
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    File();
    cin >> n >> start >> d;
    for (int i = 1; i <= n; i++) cin >> arr[i];
    du = d;
    for (int i = 1; i <= n; i++)
    {
        for (int j = i; j <= n; j++)
        {
            if (cost(i, j) >= 4400) cerr << i << " " << j << " " << cost(i, j) << " " << du << " " << chosen.size() << endl;
            ans = max(ans, cost(i, j));
        }
    }
    divide(1, n, 1, n);
    cout << findMaxAttraction(n, start, d, arr);
    return 0;
}*/
/*
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠿⠿⢿⣿⣿⠿⠛⠿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠟⠉⠄⣀⡤⢤⣤⣈⠁⣠⡔⠶⣾⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⡿⠛⠋⠁⠄⠄⠄⣼⣿⠁⡀⢹⣿⣷⢹⡇⠄⠎⣿⣿⣿
⣿⣿⣿⠿⠛⠉⠁⠄⠄⠄⠄⠄⠄⠄⠹⣇⣀⣡⣾⣿⡿⠉⠛⠒⠒⠋⠉⢸
⡿⠋⠁⠄⠄⢀⣤⣤⡀⠄⠄⠄⠄⠄⠄⠈⠙⠛⠛⠉⠄⠄⠄⠄⠄⠄⠄⠈
⠄⠄⠄⠄⠄⢹⣧⡈⠿⣷⣄⣀⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⢀⣠⢄⣾
⠄⠄⠄⠄⠄⠈⠻⢿⣶⣌⣙⡛⠛⠿⠶⠶⠶⠶⠶⠖⣒⣒⣚⣋⡩⢱⣾⣿
⠄⠄⠄⠄⠄⠄⠄⠄⠈⠉⠛⠛⠛⠻⠿⠿⠟⠛⠛⠛⠉⢉⣥⣶⣾⣿⣿⣿
⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠒⠶⣿⣿⣿⣿⣿⣿⣿⣿
⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠈⠻⣿⣿⣿⣿⣿⣿
⣿⡿⠛⠛⠛⢻⣿⠿⠛⠛⠛⢿⣿⣿⡿⠛⠛⠛⢻⡟⠛⣿⡿⠛⣻⣿⣿⣿
⡟⠄⣼⣿⣿⣿⡇⠄⣾⣿⣧⠄⢻⡏⠄⣼⣿⣿⣿⡇⠄⡟⢀⣴⣿⣿⣿⣿
⡇⠄⣿⣿⣿⣿⡄⠄⣿⣿⣿⠄⢸⡇⠄⣿⣿⣿⣿⡇⠄⣀⠈⢻⣿⣿⣿⣿
⣿⣄⠈⠙⠛⢻⣧⡄⠙⠛⠉⣠⣿⣷⣄⠈⠙⠛⢹⡇⠄⣿⣧⠄⠻⣿⣿⣿
 
 ___  ___  _________        ________  ___  ___  ________  ________   ________          ________  ________  ________  ________
|\  \|\  \|\___   ___\     |\   __  \|\  \|\  \|\   __  \|\   ___  \|\   ____\        |\   __  \|\   ____\|\   __  \|\   __  \
\ \  \\\  \|___ \  \_|     \ \  \|\  \ \  \\\  \ \  \|\  \ \  \\ \  \ \  \___|        \ \  \|\  \ \  \___|\ \  \|\ /\ \  \|\  \
 \ \   __  \   \ \  \       \ \   ____\ \   __  \ \  \\\  \ \  \\ \  \ \  \  ___       \ \  \\\  \ \  \    \ \   __  \ \  \\\  \
  \ \  \ \  \   \ \  \       \ \  \___|\ \  \ \  \ \  \\\  \ \  \\ \  \ \  \|\  \       \ \  \\\  \ \  \____\ \  \|\  \ \  \\\  \
   \ \__\ \__\   \ \__\       \ \__\    \ \__\ \__\ \_______\ \__\\ \__\ \_______\       \ \_______\ \_______\ \_______\ \_______\
    \|__|\|__|    \|__|        \|__|     \|__|\|__|\|_______|\|__| \|__|\|_______|        \|_______|\|_______|\|_______|\|_______|
*/

Compilation message

holiday.cpp: In function 'void File()':
holiday.cpp:8:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     freopen(file".in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
holiday.cpp:9:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 692 KB Output is correct
5 Correct 1 ms 696 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 696 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 5948 KB Output is correct
2 Correct 343 ms 5952 KB Output is correct
3 Correct 369 ms 6036 KB Output is correct
4 Correct 358 ms 5836 KB Output is correct
5 Correct 890 ms 5700 KB Output is correct
6 Correct 158 ms 2116 KB Output is correct
7 Correct 405 ms 3520 KB Output is correct
8 Correct 539 ms 3944 KB Output is correct
9 Correct 109 ms 1652 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 808 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 16 ms 724 KB Output is correct
5 Correct 13 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 5 ms 696 KB Output is correct
9 Correct 5 ms 724 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 6640 KB Output is correct
2 Correct 316 ms 6636 KB Output is correct
3 Correct 283 ms 2288 KB Output is correct
4 Correct 13 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 1100 ms 4708 KB Output is correct
9 Correct 1106 ms 4712 KB Output is correct