oj.uz

Submission #612208

# Submission time Handle Problem Language Result Execution time Memory
612208 2022-07-29T11:35:32 Z 1bin The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 3000 ms 69740 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
const int NMAX = 1e5 + 5;
const int sqt = 40;
int n, d, u, q, h[NMAX], a, b, A[2 * NMAX], B[2 * NMAX];
vector<int> ix[NMAX];
auto cmp = [](int a, int b){return h[a] < h[b];};
vector<set<int, decltype(cmp)>> v[NMAX];
set<int, decltype(cmp)> l(cmp), r(cmp);

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

void curseChanges(int U, int A_[], int B_[]){
    u = U;
    for(int i = 0; i < u; i++) A[i] = A_[i], B[i] = B_[i];
    for(int i = 0; i < u; i++){
        a = A[i]; b = B[i];
        ix[a].emplace_back(i);
        ix[b].emplace_back(i);
    }
    for(int i = 0; i < n; i++){
        set<int, decltype(cmp)> s(cmp);
        for(int j = 0; j < ix[i].size(); j++){
            int t = A[ix[i][j]] == i ? B[ix[i][j]] : A[ix[i][j]];
            if(s.find(t) == s.end()) s.emplace(t);
            else s.erase(t);
            
            if(j % sqt == sqt - 1) v[i].emplace_back(s);
        }
    }
    return;
}

int question(int x, int y, int V){
    int ans = 1e9, xb, yb;
    int xsz = lower_bound(all(ix[x]), V) - ix[x].begin();
    int ysz = lower_bound(all(ix[y]), V) - ix[y].begin();
    xb = (xsz - 1) / sqt; yb = (ysz - 1) / sqt;
    if(xb >= 1) for(auto& t : v[x][xb - 1]) l.emplace(t);
    if(yb >= 1) for(auto& t : v[y][yb - 1]) r.emplace(t);
    for(int i = xb * sqt; i < xsz; i++) {
        int t = (A[ix[x][i]] == x) ? B[ix[x][i]] : A[ix[x][i]];
        if(l.find(t) == l.end()) l.emplace(t);
        else l.erase(t);
    }
    for(int i = yb * sqt; i < ysz; i++) {
        int t = (A[ix[y][i]] == y) ? B[ix[y][i]] : A[ix[y][i]];
        if(r.find(t) == r.end()) r.emplace(t);
        else r.erase(t);
    }
    auto xi = l.begin();
    auto yi = r.begin();
    while(xi != l.end() && yi != r.end()){
        ans = min(ans, abs(h[*xi] - h[*yi]));
        h[*xi] < h[*yi] ? xi++ : yi++;
    }
   l.clear(); r.clear();
    return ans;
}

Compilation message

potion.cpp: In function 'void curseChanges(int, int*, int*)':
potion.cpp:30:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int j = 0; j < ix[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5072 KB Output is correct
2 Correct 6 ms 5072 KB Output is correct
3 Correct 5 ms 5072 KB Output is correct
4 Correct 15 ms 5764 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 13000 KB Output is correct
2 Correct 259 ms 13132 KB Output is correct
3 Correct 503 ms 15544 KB Output is correct
4 Execution timed out 3079 ms 69740 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 162 ms 13132 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 5504 KB Output is correct
2 Correct 282 ms 5512 KB Output is correct
3 Correct 451 ms 5512 KB Output is correct
4 Correct 2352 ms 7120 KB Output is correct
5 Correct 2233 ms 6724 KB Output is correct
6 Correct 228 ms 5328 KB Output is correct
7 Correct 1996 ms 6768 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 5 ms 5072 KB Output is correct
3 Correct 6 ms 5072 KB Output is correct
4 Correct 5 ms 5072 KB Output is correct
5 Correct 15 ms 5764 KB Output is correct
6 Correct 226 ms 13000 KB Output is correct
7 Correct 259 ms 13132 KB Output is correct
8 Correct 503 ms 15544 KB Output is correct
9 Execution timed out 3079 ms 69740 KB Time limit exceeded
10 Halted 0 ms 0 KB -