oj.uz

답안 #642473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
642473 2022-09-19T14:19:03 Z Vladth11 The Potion of Great Power (CEOI20_potion) C++14
38 / 100
 3000 ms 123000 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;

const int NMAX = 100001;
const int VMAX = 101;
const int INF = 2e9;
const int MOD = 1000000007;
const int BLOCK = 447;
const int base = 117;
const int nr_of_bits = 24;
const int inv2 = 500000004;

set <pii> events[NMAX];
vector <int> parcurgere;
int a[NMAX];
int n;

struct Node{
   int l, r, cnt;
};

vector <Node> nodes;

void adauga(int newNode, int node, int l, int r, int val){
    if(l == r){
        if(node != -1 && nodes[node].cnt > 0){
            nodes[newNode].cnt = 0;
        }else{
            nodes[newNode].cnt = 1;
        }
        return;
    }
    int mid = (l + r) / 2;
    int subL = -1, subR = -1;
    if(node != -1)
    {
        subL = nodes[node].l;
        subR = nodes[node].r;
    }
    if(val <= mid){
        nodes[newNode].r = subR;
        nodes.push_back({-1, -1, 0});
        nodes[newNode].l = nodes.size() - 1;
        adauga(nodes[newNode].l, subL, l, mid, val);
    }else{
        nodes[newNode].l = subL;
        nodes.push_back({-1, -1, 0});
        nodes[newNode].r = nodes.size() - 1;
        adauga(nodes[newNode].r, subR, mid + 1, r, val);
    }
    nodes[newNode].cnt = 0;
    if(nodes[newNode].l != -1)
        nodes[newNode].cnt += nodes[nodes[newNode].l].cnt;
    if(nodes[newNode].r != -1)
        nodes[newNode].cnt += nodes[nodes[newNode].r].cnt;
    if(nodes[newNode].r == -1 || nodes[nodes[newNode].r].cnt == 0)
        nodes[newNode].r = -1;
    if(nodes[newNode].l == -1 || nodes[nodes[newNode].l].cnt == 0)
        nodes[newNode].l = -1;
}

void baga(int node, int l, int r){
    if(l == r){
        if(nodes[node].cnt == 1){
            parcurgere.push_back(l);
        }
        return;
    }
    int mid = (l + r) / 2;
    if(nodes[node].l != -1)
        baga(nodes[node].l, l, mid);
    if(nodes[node].r != -1)
        baga(nodes[node].r, mid + 1, r);
}

void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < N; i++){
        a[i] = H[i];
        events[i].insert({0, nodes.size()});
        nodes.push_back({-1, -1, 0});
    }
}

void curseChanges(int U, int A[], int B[]) {
    for(int i = 0; i < U; i++){
        int lastA = (*events[A[i]].rbegin()).second;
        int lastB = (*events[B[i]].rbegin()).second;
        events[A[i]].insert({i + 1, nodes.size()});
        nodes.push_back({-1, -1, 0});
        int index = nodes.size() - 1;
        adauga(nodes.size() - 1, lastA, 0, n - 1, B[i]);
        events[B[i]].insert({i + 1, nodes.size()});
        nodes.push_back({-1, -1, 0});
        adauga(nodes.size() - 1, lastB, 0, n - 1, A[i]);
    }
}

int question(int x, int y, int v) {
    vector <int> stX, stY;
    parcurgere.clear();
    int lastX = (*prev(events[x].upper_bound({v + 1, 0}))).second;
    int lastY = (*prev(events[y].upper_bound({v + 1, 0}))).second;
    baga(lastX, 0, n - 1);
    stX = parcurgere;
    parcurgere.clear();
    baga(lastY, 0, n - 1);
    stY = parcurgere;
    int minim = 1e9;
    if(stX.size() == 0 || stY.size() == 0)
        return minim;
    set <int> nou;
    for(auto p : stX){
        nou.insert(a[p]);
    }
    for(auto p : stY){
        int val = a[p];
        auto it = nou.lower_bound(val);
        if(it != nou.end()){
            minim = min(minim, abs((*it) - val));
        }
        it = nou.upper_bound(val);
        if(it != nou.begin()){
            it = prev(it);
            minim = min(minim, abs((*it) - val));
        }
    }
    return minim;

}

Compilation message

potion.cpp: In function 'void curseChanges(int, int*, int*)':
potion.cpp:96:13: warning: unused variable 'index' [-Wunused-variable]
   96 |         int index = nodes.size() - 1;
      |             ^~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5564 KB Output is correct
2 Correct 6 ms 5564 KB Output is correct
3 Correct 4 ms 5564 KB Output is correct
4 Correct 22 ms 13624 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 631 ms 121364 KB Output is correct
2 Correct 583 ms 121408 KB Output is correct
3 Correct 668 ms 121364 KB Output is correct
4 Execution timed out 3021 ms 123000 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 542 ms 121388 KB Output is correct
2 Execution timed out 3052 ms 121404 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 12544 KB Output is correct
2 Correct 179 ms 12556 KB Output is correct
3 Correct 323 ms 12648 KB Output is correct
4 Correct 2174 ms 12628 KB Output is correct
5 Correct 2093 ms 12588 KB Output is correct
6 Correct 282 ms 8708 KB Output is correct
7 Correct 1717 ms 12520 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 5 ms 5564 KB Output is correct
3 Correct 6 ms 5564 KB Output is correct
4 Correct 4 ms 5564 KB Output is correct
5 Correct 22 ms 13624 KB Output is correct
6 Correct 631 ms 121364 KB Output is correct
7 Correct 583 ms 121408 KB Output is correct
8 Correct 668 ms 121364 KB Output is correct
9 Execution timed out 3021 ms 123000 KB Time limit exceeded
10 Halted 0 ms 0 KB -