oj.uz

Submission #709433

# Submission time Handle Problem Language Result Execution time Memory
709433 2023-03-13T14:45:16 Z Johann Examination (JOI19_examination) C++14
2 / 100
 3000 ms 10472 KB 
// TODO: Still to solve...
#include "bits/stdc++.h"
using namespace std;

#pragma GCC optimize("O3")

typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

struct Req
{
    ll a, b, c;
    int idx;
};

struct SqrtDecom
{
    vpii newStuff;
    vpii stuff;
    vvpii buckets;
    vi minele;
    int sq;
    void init(int N)
    {
        sq = ceil(sqrt(N));
    }
    void insert(pii &item)
    {
        newStuff.push_back(item);
        if (sz(newStuff) == sq)
        {
            for (pii tmp : newStuff)
                stuff.push_back(tmp);
            newStuff.clear();
            sort(all(stuff));
            buckets.push_back(vpii(sq));
            minele.push_back(0);

            for (int i = 0; i < sz(buckets); ++i)
            {
                minele[i] = stuff[i * sq].first;
                sort(stuff.begin() + i * sq, stuff.begin() + (i + 1) * sq, [&](pii &a, pii &b)
                     { return a.second < b.second; });
            }
        }
    }

    int answer(Req &q)
    {
        int ans = 0;
        for (pii r : newStuff)
            if (r.first >= q.a && r.second >= q.b)
                ++ans;
        int idx = sz(stuff) / sq - 1;
        while (idx >= 0 && minele[idx] >= q.a)
        {
            ans += (stuff.begin() + (idx + 1) * sq) - lower_bound(stuff.begin() + idx * sq, stuff.begin() + (idx + 1) * sq, make_pair(0LL, q.b), [&](const pii a, const pii b)
                                                                  { return a.second < b.second; });
            --idx;
        }
        if (idx != -1)
            for (int i = idx * sq; i < (idx + 1) * sq; ++i)
                if (stuff[i].first >= q.a && stuff[i].second >= q.b)
                    ++ans;
        return ans;
    }
};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, Q;
    cin >> N >> Q;

    vpii ST(N); // A <= S[i] , B <= T[i], C <= S[i] + T[i]
    for (int i = 0; i < N; ++i)
        cin >> ST[i].first >> ST[i].second;

    vector<Req> Queries(Q);
    for (int i = 0, a, b, c; i < Q; ++i)
    {
        cin >> a >> b >> c;
        Queries[i] = {a, b, c, i};
    }
    vi ans(Q);

    sort(all(Queries), [&](Req &a, Req &b)
         { return a.c > b.c; });
    sort(all(ST), [&](pii &a, pii &b)
         { return a.first + a.second > b.first + b.second; });

    SqrtDecom sqd;
    sqd.init(N);

    int idx = 0;
    for (int i = 0; i < sz(Queries); ++i)
    {
        while (idx < sz(ST) && ST[idx].first + ST[idx].second >= Queries[i].c)
        {
            sqd.insert(ST[idx]);
            ++idx;
        }
        ans[Queries[i].idx] = sqd.answer(Queries[i]);
    }

    for (int x : ans)
        cout << x << "\n";

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 13 ms 752 KB Output is correct
8 Correct 13 ms 740 KB Output is correct
9 Correct 13 ms 724 KB Output is correct
10 Correct 14 ms 700 KB Output is correct
11 Correct 11 ms 596 KB Output is correct
12 Correct 12 ms 576 KB Output is correct
13 Correct 24 ms 728 KB Output is correct
14 Correct 21 ms 728 KB Output is correct
15 Correct 15 ms 692 KB Output is correct
16 Correct 10 ms 632 KB Output is correct
17 Correct 9 ms 712 KB Output is correct
18 Correct 4 ms 620 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 13 ms 752 KB Output is correct
8 Correct 13 ms 740 KB Output is correct
9 Correct 13 ms 724 KB Output is correct
10 Correct 14 ms 700 KB Output is correct
11 Correct 11 ms 596 KB Output is correct
12 Correct 12 ms 576 KB Output is correct
13 Correct 24 ms 728 KB Output is correct
14 Correct 21 ms 728 KB Output is correct
15 Correct 15 ms 692 KB Output is correct
16 Correct 10 ms 632 KB Output is correct
17 Correct 9 ms 712 KB Output is correct
18 Correct 4 ms 620 KB Output is correct
19 Execution timed out 3025 ms 10472 KB Time limit exceeded
20 Halted 0 ms 0 KB -