oj.uz

Submission #217703

# Submission time Handle Problem Language Result Execution time Memory
217703 2020-03-30T13:22:18 Z Vimmer New Home (APIO18_new_home) C++14
0 / 100
 5000 ms 28588 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define M ll(998244353)

using namespace std;

typedef long double ld;
typedef long long ll;
typedef short int si;


vector <pair <pair <int, int>, int> > sost;

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k, q;

    cin >> n >> k >> q;

    multiset <int> se[k + 1];

    for (int i = 0; i <= k; i++) se[i].clear();

    int j = -1;

    for (int i = 0; i < n; i++)
    {
        int x, t, l, r;

        cin >> x >> t >> l >> r;

        sost.pb({{l, x}, t});

        sost.pb({{r, x}, -t});
    }

    vector <pair <pair <int, int>, int>  > gr; gr.resize(q);

    for (int i = 0; i < q; i++) {cin >> gr[i].F.S >> gr[i].F.F; gr[i].S = i;}

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

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

    int ans[q];

    for (int i = 0; i < q; i++)
    {
        int nm = gr[i].S, x = gr[i].F.S, time = gr[i].F.F;

        while (j + 1 < sz(sost) && sost[j + 1].F.F <= time)
        {
            j++;

            if (sost[j].S > 0) se[sost[j].S].insert(sost[j].F.S);
               else se[abs(sost[j].S)].erase(se[abs(sost[j].S)].find(sost[j].F.S));
        }

        bool f = 1;

        int mx = 0;

        for (int u = 1; u <= k; u++)
        {
            if (sz(se[u]) == 0) {f = 0; break;}

            auto it = upper_bound(se[u].begin(), se[u].end(), x);

            int mn = 1e9;

            if (it != se[u].end()) mn = min(mn, abs(*it - x));

            if (it != se[u].begin()) {it--; mn = min(mn, abs(*it - x)); }

            mx = max(mx, mn);
        }

        if (!f) ans[nm] = -1; else ans[nm] = mx;
    }

    for (int i = 0; i < q; i++) cout << ans[i] << endl;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5069 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5069 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5075 ms 28588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5072 ms 26016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5069 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5069 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -