oj.uz

Submission #1020235

# Submission time Handle Problem Language Result Execution time Memory
1020235 2024-07-11T17:55:51 Z codefox Examination (JOI19_examination) C++14
0 / 100
 1968 ms 466544 KB 
#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>
#define pipii pair<int, pii>
#define pipi pair<pii, pii>

int N = 1<<19;
vector<vector<int>> bin(2*N, vector<int>(1, 0));
vector<vector<int>> bleft(2*N, vector<int>(1, -1));
vector<vector<int>> bright(2*N, vector<int>(1, -1));

void update(int a, int b)
{
    a += N;
    while (a)
    {
        int curr = 0;
        for (int i = 18; i >= 0; i--)
        {
            bin[a][curr]++;
            if (b&(1<<i))
            {
                if (bright[a][curr]==-1)
                {
                    bright[a][curr] = bin[a].size();
                    curr = bin[a].size();
                    bin[a].push_back(0);
                    bleft[a].push_back(-1);
                    bright[a].push_back(-1);
                }
                else
                {
                    curr = bright[a][curr];
                }
            }
            else
            {
                if (bleft[a][curr]==-1)
                {
                    bleft[a][curr] = bin[a].size();
                    curr = bin[a].size();
                    bin[a].push_back(0);
                    bleft[a].push_back(-1);
                    bright[a].push_back(-1);
                }
                else
                {
                    curr = bleft[a][curr];
                }
            }
        }
        a/=2;
    }
}

int query(int a, int b)
{
    int sol = 0;
    int curr = 1;
    a++; b++;
    for (int i = 18; i >= 0; i--)
    {
        curr*=2;
        if (a&(1<<i))
        {
            int curr2 = 0;
            for (int j = 18; j >= 0; j--)
            {
                if (b&(1<<j))
                {
                    if (bleft[curr][curr2]!=-1) sol += bin[curr][bleft[curr][curr2]];
                    if (bright[curr][curr2]==-1) break;
                    curr2 = bright[curr][curr2];
                }
                else
                {
                    if (bleft[curr][curr2]==-1) break;
                    curr2 = bleft[curr][curr2];
                }
            }
            curr++;
        }
    }
    return sol;
}

int main()
{
    int n, q;
    cin >> n >> q;
    vector<pipii> scores(n);
    map<int, int> comp;
    set<int> coord;
    for (int i = 0; i < n; i++)
    {
        int a, b;
        cin >> a >> b;
        scores[i] = {a+b, {a, b}};
        coord.insert(a);
        coord.insert(b);
    }
    sort(scores.begin(), scores.end(), greater<pipii>());
    vector<pipi> queries(q);
    for (int i = 0; i < q; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        queries[i] = {{c, i}, {a, b}};
        coord.insert(a);
        coord.insert(b);
    }
    sort(queries.begin(), queries.end(), greater<pipi>());
    int d = coord.size();
    for (int ele:coord)
    {
        comp[ele] = d--;
    }
    vector<int> sol(q);
    int curr = 0;
    for (auto ele:queries)
    {
        while (curr < scores.size() && scores[curr].first>= ele.first.first)
        {
            update(comp[scores[curr].second.first], comp[scores[curr].second.second]);
            //cout << comp[scores[curr].second.first] << " " << comp[scores[curr].second.second] << endl;
            curr++;
        }
        //cout << 1 << " " << comp[ele.second.first] << " " << comp[ele.second.second] << endl;
        sol[ele.first.second] = query(comp[ele.second.first], comp[ele.second.second]);
    }
    for (int ele:sol) cout << ele << "\n";
    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:124:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |         while (curr < scores.size() && scores[curr].first>= ele.first.first)
      |                ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 172876 KB Output is correct
2 Correct 142 ms 172748 KB Output is correct
3 Correct 142 ms 172628 KB Output is correct
4 Correct 142 ms 172780 KB Output is correct
5 Correct 147 ms 172836 KB Output is correct
6 Correct 148 ms 172628 KB Output is correct
7 Correct 201 ms 183376 KB Output is correct
8 Correct 203 ms 183380 KB Output is correct
9 Correct 205 ms 183380 KB Output is correct
10 Incorrect 189 ms 176584 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 172876 KB Output is correct
2 Correct 142 ms 172748 KB Output is correct
3 Correct 142 ms 172628 KB Output is correct
4 Correct 142 ms 172780 KB Output is correct
5 Correct 147 ms 172836 KB Output is correct
6 Correct 148 ms 172628 KB Output is correct
7 Correct 201 ms 183376 KB Output is correct
8 Correct 203 ms 183380 KB Output is correct
9 Correct 205 ms 183380 KB Output is correct
10 Incorrect 189 ms 176584 KB Output isn't correct
11 Halted 0 ms 0 KB -