Submission #629290

#	Time	Username	Problem	Language	Result	Execution time	Memory
629290		peti1234	Radio Towers (IOI22_towers)	C++17	0 / 100	4075 ms	7904 KiB

towers

#include <bits/stdc++.h>

using namespace std;
const int c=100005;
int n, t[c];
set<pair<int, int> > s;
vector<pair<int, pair<int, int> > > sz;
void init(int N, vector<int> sz) {
    n=N;
    for (int i=0; i<n; i++) {
        t[i+1]=sz[i];
    }
}


int max_towers(int l, int r, int d) {
    l++, r++;
    for (int i=l-1; i<=r+1; i++) {
        s.insert({i, 1});
    }

    for (int i=l; i<=r; i++) {
        sz.push_back({t[i], {1, i}}), sz.push_back({t[i]+d, {0, i}});
    }
    sort(sz.begin(), sz.end());

    int maxi=0, ert=0;
    for (auto x:sz) {
        int id=x.second.first, pos=x.second.second;
        auto it=s.upper_bound({pos, -1});
        int cnt=0;
        it++;
        cnt+=(*it).second;
        it--, it--;
        cnt+=(*it).second;

        if (id==0) {
            if (cnt==2) {
                ert++;
            }
            s.insert({pos, id});
        }
        if (id==1) {
            if (!cnt) {
                ert--;
            }
            s.erase({pos, id});
        }
        maxi=max(maxi, ert);
    }
    s.clear(), sz.clear();

    return maxi;
}
/*
int main()
{
    return 0;
}
*/

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23