oj.uz

Submission #328927

# Submission time Handle Problem Language Result Execution time Memory
328927 2020-11-18T13:28:56 Z dolphingarlic Examination (JOI19_examination) C++14
2 / 100
 3000 ms 10896 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
typedef long long ll;
using namespace std;

const int N = 100000, BCKT = 750;

int n, q;
int s[N], t[N], sums[N], sum_ptr[N];
pair<int, int> by_s[N], by_t[N];
vector<tuple<int, int, int, int>> queries[N / BCKT + 1];
int bit[N + 1];
int ans[N];

void update(int pos, int val) {
    for (; pos <= n; pos += pos & -pos) bit[pos] += val;
}

int query(int l, int r) {
    int ans = 0;
    for (; r; r -= r & -r) ans += bit[r];
    for (l--; l; l -= l & -l) ans -= bit[l];
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        cin >> s[i] >> t[i];
        sums[i] = s[i] + t[i];
        by_s[i] = {s[i], i};
        by_t[i] = {t[i], i};
    }
    sort(sums, sums + n);
    for (int i = 0; i < n; i++) {
        sum_ptr[i] = lower_bound(sums, sums + n, s[i] + t[i]) - sums + 1;
    }
    sort(by_s, by_s + n);
    sort(by_t, by_t + n);
    for (int i = 0; i < q; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a = lower_bound(by_s, by_s + n, make_pair(a, 0)) - by_s;
        b = lower_bound(by_t, by_t + n, make_pair(b, 0)) - by_t;
        c = lower_bound(sums, sums + n, c) - sums + 1;
        queries[a / BCKT].push_back(tuple<int, int, int, int>(a, b, c, i));
    }

    unordered_map<int, int> good_cnt;
    for (int i = N / BCKT, sptr = n, tptr = n; ~i; i--) {
        sort(queries[i].begin(), queries[i].end(), [](tuple<int, int, int, int> A, tuple<int, int, int, int> B) {
            return get<1>(A) > get<1>(B);
        });
        for (tuple<int, int, int, int> j : queries[i]) {
            int a, b, c, idx;
            tie(a, b, c, idx) = j;

            while (sptr > a) {
                good_cnt[by_s[sptr - 1].second]++;
                if (good_cnt[by_s[sptr - 1].second] == 2) {
                    update(sum_ptr[by_s[sptr - 1].second], 1);
                }
                sptr--;
            }
            while (sptr < a) {
                good_cnt[by_s[sptr].second]--;
                if (good_cnt[by_s[sptr].second] == 1) {
                    update(sum_ptr[by_s[sptr].second], -1);
                }
                sptr++;
            }
            while (tptr > b) {
                good_cnt[by_t[tptr - 1].second]++;
                if (good_cnt[by_t[tptr - 1].second] == 2) {
                    update(sum_ptr[by_t[tptr - 1].second], 1);
                }
                tptr--;
            }
            while (tptr < b) {
                good_cnt[by_t[tptr].second]--;
                if (good_cnt[by_t[tptr].second] == 1) {
                    update(sum_ptr[by_t[tptr].second], -1);
                }
                tptr++;
            }
            ans[idx] = query(c, n);
        }
    }

    for (int i = 0; i < q; i++) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 34 ms 748 KB Output is correct
8 Correct 33 ms 748 KB Output is correct
9 Correct 33 ms 768 KB Output is correct
10 Correct 33 ms 776 KB Output is correct
11 Correct 27 ms 748 KB Output is correct
12 Correct 29 ms 748 KB Output is correct
13 Correct 33 ms 876 KB Output is correct
14 Correct 33 ms 732 KB Output is correct
15 Correct 33 ms 748 KB Output is correct
16 Correct 4 ms 748 KB Output is correct
17 Correct 28 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3064 ms 10896 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 3064 ms 10896 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 34 ms 748 KB Output is correct
8 Correct 33 ms 748 KB Output is correct
9 Correct 33 ms 768 KB Output is correct
10 Correct 33 ms 776 KB Output is correct
11 Correct 27 ms 748 KB Output is correct
12 Correct 29 ms 748 KB Output is correct
13 Correct 33 ms 876 KB Output is correct
14 Correct 33 ms 732 KB Output is correct
15 Correct 33 ms 748 KB Output is correct
16 Correct 4 ms 748 KB Output is correct
17 Correct 28 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Execution timed out 3064 ms 10896 KB Time limit exceeded
20 Halted 0 ms 0 KB -