Submission #649759

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
649759	2022-10-11T10:31:09 Z	boris_mihov	Santa Claus (RMI19_santa)	C++17	30 / 100	1000 ms	262144 KB

santa

#include <algorithm>
#include <iostream>
#include <tgmath.h>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <set>

typedef long long llong; 
const int MAXN = 100000 + 10;
const int MOD  = 1e9 + 7;
const int INF  = 1e9;

struct House
{
    int x, h, v;
    inline friend bool operator < (const House &a, const House &b)
    {
        return a.x < b.x || (a.x == b.x && a.h < b.h) || (a.x == b.x && a.h == b.h && a.v < b.v);
    }
} houses[MAXN];

int n, t;
int x[MAXN];
int h[MAXN];
int v[MAXN];
bool gotPresent[MAXN];

std::multiset <int> s;
std::multiset <int> toGive[MAXN];
std::vector <std::pair <int,bool>> left;
bool check(int idx, int allowed)
{
    left.clear();
    for (const int &i : toGive[allowed-1]) 
    {
        left.emplace_back(i, 0);
    }

    for (int i = allowed ; i <= idx ; ++i)
    {
        left.emplace_back(v[i], h[i]);
    }

    std::sort(left.begin(), left.end(), [&](auto x, auto y)
    {
        return x.first > y.first || (x.first == y.first && x.second < y.second);
    });

    int cnt = 0;
    for (int i = 0 ; i < left.size() ; ++i)
    {
        if (left[i].second == 0) cnt++;
        else if (cnt >= 1) cnt--;
    }
    
    return cnt == 0;
}

int maxElvePos = 0;
void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        toGive[i] = toGive[i - 1];
        if (h[i] == 0) toGive[i].insert(v[i]);
        else
        {
            auto it = toGive[i].lower_bound(v[i]);
            if (it != toGive[i].end()) toGive[i].erase(it);
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (x[i] < maxElvePos)
        {
            std::cout << -1 << ' ';
            continue;
        }

        int l = 0, r = i + 1, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;
            if (check(i, mid)) l = mid;
            else r = mid;
        }

        if (l == 0) std::cout << -1 << ' ';
        else std::cout << 2*x[i] - x[l] << ' ';
    }

    std::cout << '\n';
}

void read()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].x;
    for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].h;
    for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].v;
    std::sort(houses + 1, houses + 1 + n);
    for (int i = 1 ; i <= n ; ++i)
    {
        x[i] = houses[i].x;
        h[i] = houses[i].h;
        v[i] = houses[i].v;
        if (h[i] == 0) maxElvePos = x[i];
    }
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIO();
    std::cin >> t;
    while (t--)
    {
        read();
        solve();
    }

    return 0;
}

Compilation message

santa.cpp: In function 'bool check(int, int)':
santa.cpp:53:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for (int i = 0 ; i < left.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~

Subtask #1

30.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	5076 KB	Output is correct
2	Correct	8 ms	5172 KB	Output is correct
3	Correct	648 ms	9288 KB	Output is correct
4	Execution timed out	1077 ms	15104 KB	Time limit exceeded
5	Execution timed out	1094 ms	29692 KB	Time limit exceeded
6	Execution timed out	1094 ms	90672 KB	Time limit exceeded
7	Runtime error	237 ms	262144 KB	Execution killed with signal 9
8	Runtime error	236 ms	262144 KB	Execution killed with signal 9
9	Runtime error	249 ms	262144 KB	Execution killed with signal 9
10	Runtime error	270 ms	262144 KB	Execution killed with signal 9