oj.uz

Submission #836821

# Submission time Handle Problem Language Result Execution time Memory
836821 2023-08-24T16:06:44 Z borisAngelov Examination (JOI19_examination) C++17
0 / 100
 3000 ms 51112 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 2000005;
const int max_number = 1000000;

int n, q;

struct element
{
    int x;
    int y;
    int z;

    bool is_query;
    int query_idx;

    element()
    {
        x = 0;
        y = 0;
        z = 0;
        is_query = false;
        query_idx = 0;
    }

    element(int _x, int _y, int _z, bool _is_query, int _query_idx)
    {
        x = _x;
        y = _y;
        z = _z;
        is_query = _is_query;
        query_idx = _query_idx;
    }
};

element a[maxn];

void compress()
{
    vector<int> to_sort;
    unordered_map<int, int> compressed;
    int curr_value = 0;

    for (int i = 1; i <= n + q; ++i)
    {
        to_sort.push_back(a[i].x);
        to_sort.push_back(a[i].y);
        to_sort.push_back(a[i].z);
    }

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

    for (int i = 0; i < to_sort.size(); ++i)
    {
        if (i == 0 || to_sort[i] != to_sort[i - 1])
        {
            compressed[to_sort[i]] = ++curr_value;
        }
    }

    for (int i = 1; i <= n + q; ++i)
    {
        a[i].x = compressed[a[i].x];
        a[i].y = compressed[a[i].y];
        a[i].z = compressed[a[i].z];
    }
}

int answers[maxn];

struct fenwick_tree
{
    int tree[max_number + 5];

    void update(int pos, int delta)
    {
        for (int i = pos; i <= max_number; i += (i & (-i)))
        {
            tree[i] += delta;
        }
    }

    int query(int pos)
    {
        int result = 0;

        for (int i = pos; i >= 1; i -= (i & (-i)))
        {
            result += tree[i];
        }

        return result;
    }
};

fenwick_tree bit;

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> q;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i].x >> a[i].y;
        a[i].z = a[i].x + a[i].y;
    }

    for (int i = 1; i <= q; ++i)
    {
        cin >> a[i + n].x >> a[i + n].y >> a[i + n].z;
        a[i + n].is_query = true;
        a[i + n].query_idx = i;
    }

    sort(a + 1, a + n + q + 1, [&](element fr, element sc)
    {
        return (fr.x > sc.x || (fr.x == sc.x && fr.is_query == false));
    });

    compress();

    for (int i = 1; i <= n + q; ++i)
    {
        if (a[i].is_query == false)
        {
            bit.update(a[i].y, +1);
        }
        else
        {
            answers[a[i].query_idx] = (bit.query(max_number) - bit.query(a[i].y - 1));
        }
    }

    for (int i = 1; i <= q; ++i)
    {
        cout << answers[i] << "\n";
    }

    return 0;
}

/*
5 4
35 100
70 70
45 15
80 40
20 95
20 50 0
10 10 0
60 60 0
0 100 0
*/

Compilation message

examination.cpp: In function 'void compress()':
examination.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i = 0; i < to_sort.size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 39508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 47320 KB Output is correct
2 Correct 119 ms 47364 KB Output is correct
3 Correct 117 ms 47364 KB Output is correct
4 Correct 105 ms 46400 KB Output is correct
5 Execution timed out 3059 ms 51112 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 47320 KB Output is correct
2 Correct 119 ms 47364 KB Output is correct
3 Correct 117 ms 47364 KB Output is correct
4 Correct 105 ms 46400 KB Output is correct
5 Execution timed out 3059 ms 51112 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 39508 KB Output isn't correct
2 Halted 0 ms 0 KB -