oj.uz

답안 #709389

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709389 2023-03-13T13:55:04 Z Johann Examination (JOI19_examination) C++14
2 / 100
 3000 ms 9920 KB 
// TODO: Still to solve...
#include "bits/stdc++.h"
using namespace std;

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);
            sort(all(stuff));
            newStuff.clear();
            buckets.push_back(vpii(sq));
            minele.push_back(0);

            for (int i = 0; i < sz(stuff); ++i)
                buckets[i / sq][i % sq] = stuff[i];

            for (int i = 0; i < sz(buckets); ++i)
            {
                minele[i] = buckets[i].front().first;
                sort(all(buckets[i]), [&](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(buckets) - 1;
        while (idx >= 0 && minele[idx] >= q.a)
        {
            ans += buckets[idx].end() - lower_bound(all(buckets[idx]), make_pair(0LL, q.b), [&](const pii a, const pii b)
                                                    { return a.second < b.second; });
            idx--;
        }
        if (idx != -1)
            for (pii r : buckets[idx])
                if (r.first >= q.a && r.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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 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 324 KB Output is correct
7 Correct 11 ms 752 KB Output is correct
8 Correct 10 ms 740 KB Output is correct
9 Correct 12 ms 732 KB Output is correct
10 Correct 9 ms 724 KB Output is correct
11 Correct 9 ms 724 KB Output is correct
12 Correct 8 ms 636 KB Output is correct
13 Correct 12 ms 724 KB Output is correct
14 Correct 11 ms 724 KB Output is correct
15 Correct 11 ms 724 KB Output is correct
16 Correct 8 ms 592 KB Output is correct
17 Correct 7 ms 700 KB Output is correct
18 Correct 3 ms 588 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2642 ms 9752 KB Output is correct
2 Correct 2597 ms 9744 KB Output is correct
3 Correct 2550 ms 9920 KB Output is correct
4 Correct 2397 ms 9736 KB Output is correct
5 Correct 1670 ms 9748 KB Output is correct
6 Correct 1575 ms 9744 KB Output is correct
7 Execution timed out 3028 ms 9168 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2642 ms 9752 KB Output is correct
2 Correct 2597 ms 9744 KB Output is correct
3 Correct 2550 ms 9920 KB Output is correct
4 Correct 2397 ms 9736 KB Output is correct
5 Correct 1670 ms 9748 KB Output is correct
6 Correct 1575 ms 9744 KB Output is correct
7 Execution timed out 3028 ms 9168 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 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 324 KB Output is correct
7 Correct 11 ms 752 KB Output is correct
8 Correct 10 ms 740 KB Output is correct
9 Correct 12 ms 732 KB Output is correct
10 Correct 9 ms 724 KB Output is correct
11 Correct 9 ms 724 KB Output is correct
12 Correct 8 ms 636 KB Output is correct
13 Correct 12 ms 724 KB Output is correct
14 Correct 11 ms 724 KB Output is correct
15 Correct 11 ms 724 KB Output is correct
16 Correct 8 ms 592 KB Output is correct
17 Correct 7 ms 700 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2642 ms 9752 KB Output is correct
20 Correct 2597 ms 9744 KB Output is correct
21 Correct 2550 ms 9920 KB Output is correct
22 Correct 2397 ms 9736 KB Output is correct
23 Correct 1670 ms 9748 KB Output is correct
24 Correct 1575 ms 9744 KB Output is correct
25 Execution timed out 3028 ms 9168 KB Time limit exceeded
26 Halted 0 ms 0 KB -