oj.uz

Submission #972508

# Submission time Handle Problem Language Result Execution time Memory
972508 2024-04-30T14:06:12 Z RaresFelix The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 3000 ms 24464 KB 
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
const int MN = 100000;
int n;
int H0[MN];

vector<pair<int, int> > Op[MN];
vi SnapId[MN];
vector<vi> Mare; 

void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < n; ++i)
        H0[i] = H[i];
}

int rad = 50;

void curseChanges(int U, int A[], int B[]) {
    for(int i = 0; i < U; ++i) {
        Op[A[i]].push_back({i + 1, B[i]});
        Op[B[i]].push_back({i + 1, A[i]});
    }

    for(int i = 0; i < n; ++i) {
        set<int> S;
        SnapId[i].push_back(Mare.size());
        Mare.emplace_back();
        for(int j = 0; j < Op[i].size(); ++j) {
            if(j % rad == 0 && j) {
                SnapId[i].push_back(Mare.size());
                Mare.emplace_back();
                Mare.back().reserve(S.size());
                for(auto it : S) Mare.back().push_back(it);
            }
            auto [t, v] = Op[i][j];
            if(S.count(v)) S.erase(v);
            else S.insert(v);
        }
    }
}
const int INF = 1e9;

set<int> get(int x, int v) {
    int st = 0, dr = int(Op[x].size()) - 1, mij;
    if(Op[x].empty() || Op[x][0].first > v) return set<int>();
    while(st < dr) {
        mij = (st + dr + 1) / 2;
        if(Op[x][mij].first > v) dr = mij - 1; // e ok asa?
        else st = mij;
    }
    set<int> S;
    for(auto it : Mare[SnapId[x][st / rad]])
        S.insert(it);
    for(int i = st / rad * rad; i <= st; ++i) {
        auto [t, v] = Op[x][i];
        if(S.count(v)) S.erase(v);
        else S.insert(v);
    }
    return S;
}

int question(int x, int y, int v) {
    auto VecX = get(x, v), VecY = get(y, v);
    vi VA, VB;
    for(auto it : VecX) VA.push_back(H0[it]);
    for(auto it : VecY) VB.push_back(H0[it]);
    sort(VA.begin(), VA.end());
    sort(VB.begin(), VB.end());
    int pa = 0, pb = 0;
    int re = INF;
    while(pa < VA.size() && pb < VB.size()) {
        re = min(re, abs(VA[pa] - VB[pb]));
        if(VA[pa] < VB[pb]) ++pa;
        else ++pb;
    }
    return re;
}

Compilation message

potion.cpp: In function 'void curseChanges(int, int*, int*)':
potion.cpp:32:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int j = 0; j < Op[i].size(); ++j) {
      |                        ~~^~~~~~~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:75:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while(pa < VA.size() && pb < VB.size()) {
      |           ~~~^~~~~~~~~~~
potion.cpp:75:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while(pa < VA.size() && pb < VB.size()) {
      |                             ~~~^~~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 2 ms 5208 KB Output is correct
4 Correct 16 ms 11564 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 18856 KB Output is correct
2 Correct 167 ms 18932 KB Output is correct
3 Correct 326 ms 17620 KB Output is correct
4 Correct 2341 ms 15264 KB Output is correct
5 Correct 585 ms 12988 KB Output is correct
6 Execution timed out 3085 ms 24368 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 18836 KB Output is correct
2 Correct 2808 ms 23704 KB Output is correct
3 Correct 1456 ms 21556 KB Output is correct
4 Correct 2821 ms 24464 KB Output is correct
5 Correct 341 ms 18996 KB Output is correct
6 Execution timed out 3020 ms 24128 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6232 KB Output is correct
2 Correct 170 ms 6084 KB Output is correct
3 Correct 298 ms 6380 KB Output is correct
4 Correct 1323 ms 6488 KB Output is correct
5 Correct 1364 ms 6336 KB Output is correct
6 Correct 159 ms 5464 KB Output is correct
7 Correct 1124 ms 6284 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 5208 KB Output is correct
3 Correct 3 ms 5208 KB Output is correct
4 Correct 2 ms 5208 KB Output is correct
5 Correct 16 ms 11564 KB Output is correct
6 Correct 159 ms 18856 KB Output is correct
7 Correct 167 ms 18932 KB Output is correct
8 Correct 326 ms 17620 KB Output is correct
9 Correct 2341 ms 15264 KB Output is correct
10 Correct 585 ms 12988 KB Output is correct
11 Execution timed out 3085 ms 24368 KB Time limit exceeded
12 Halted 0 ms 0 KB -