oj.uz

Submission #512847

# Submission time Handle Problem Language Result Execution time Memory
512847 2022-01-16T18:54:45 Z blue Hotel (CEOI11_hot) C++17
20 / 100
 366 ms 20148 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;

using ll = long long;
#define sz(x) int(x.size())

struct obj
{
    int s;
    int v;
    int t;
};

bool operator < (obj A, obj B)
{
    if(A.s != B.s) return A.s > B.s;
    else return A.t > B.t;
}



int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m, o;
    cin >> n >> m >> o;

    vector<obj> a(m+2*n);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i].v >> a[i].s;
        a[i].t = 2; //room
    }

    for(int i = n; i < 2*n; i++)
    {
        a[i] = a[i-n];
        a[i].t = 1;
    }

    for(int j = 2*n; j < 2*n+m; j++)
    {
        cin >> a[j].v >> a[j].s;
        a[j].t = 0; //customer
    }

    sort(a.begin(), a.end());

    ll rooms_total = 0;
    // int room_count = 0;
    int spare = 0;

    // priority_queue<int> actual, fake;
    priority_queue<int> actual, fake;
    // priority_queue<int> fake;
    //
    for(obj x: a)
    {
        if(x.t == 2)
        {
            spare++;
            rooms_total += x.v;

            // cerr << "adding empty room of size " << x.s << '\n';
        }
        else if(x.t == 1)
        {
            if(spare)
            {
                fake.push(-x.v);
                spare--;
                // cerr << "inserting fake room of cost " << x.v << '\n';
            }
            else
            {
                fake.push(-x.v);

                if(actual.empty() || actual.top() < fake.top())
                    fake.pop();
                else
                    actual.pop();
            }
        }
        else
        {
            if(spare)
            {
                if(sz(actual) < o)
                    actual.push(-x.v);
                else
                {
                    actual.push(-x.v);
                    actual.pop();
                }
                spare--;
            }
            else
            {
                if(sz(actual) == o)
                {
                    actual.push(-x.v);
                    actual.pop();
                }
                else
                {
                    actual.push(-x.v);
                    if(fake.empty() || fake.top() < actual.top())
                        actual.pop();
                    else
                        fake.pop();
                }
            }
        }
    }

    ll ans = -rooms_total;
    while(!actual.empty())
    {
        ans -= actual.top();
        actual.pop();
    }
    while(!fake.empty())
    {
        ans -= fake.top();
        fake.pop();
    }

    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 292 KB Output isn't correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 312 KB Output isn't correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 716 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 1980 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 3172 KB Output is correct
2 Incorrect 45 ms 4588 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 8752 KB Output is correct
2 Incorrect 96 ms 8832 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 314 ms 16756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 366 ms 20148 KB Output isn't correct
2 Halted 0 ms 0 KB -