oj.uz

Submission #512839

# Submission time Handle Problem Language Result Execution time Memory
512839 2022-01-16T18:50:28 Z blue Hotel (CEOI11_hot) C++17
0 / 100
 203 ms 17856 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(actual.empty() || actual.top() < fake.top())
    //                     fake.pop();
    //                 else
    //                     actual.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
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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