#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;
};
int cc = 0;
Node nodes[NMAX * 100];
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[cc++] = {-1, -1, 0};
nodes[newNode].l = cc - 1;
adauga(nodes[newNode].l, subL, l, mid, val);
} else {
nodes[newNode].l = subL;
nodes[cc++] = {-1, -1, 0};
nodes[newNode].r = cc - 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, cc});
nodes[cc++] = {-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, cc});
nodes[cc++] = {-1, -1, 0};
int index = cc - 1;
adauga(cc - 1, lastA, 0, n - 1, B[i]);
events[B[i]].insert({i + 1, cc});
nodes[cc++] = {-1, -1, 0};
adauga(cc - 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;
if(stX.size() > stY.size())
swap(stX, stY);
set <int> nou;
for(auto p : stX) {
nou.insert(a[p]);
}
assert(stX.size() <= 500);
assert(stY.size() <= 500);
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 = cc - 1;
| ^~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:115:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
115 | if(stX.size() == 0 || stY.size() == 0)
| ^~
potion.cpp:117:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
117 | if(stX.size() > stY.size())
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
5328 KB |
Output is correct |
2 |
Correct |
4 ms |
5328 KB |
Output is correct |
3 |
Correct |
5 ms |
5456 KB |
Output is correct |
4 |
Correct |
21 ms |
12156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
518 ms |
115056 KB |
Output is correct |
2 |
Correct |
562 ms |
115060 KB |
Output is correct |
3 |
Correct |
546 ms |
115388 KB |
Output is correct |
4 |
Execution timed out |
3058 ms |
77036 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
546 ms |
115052 KB |
Output is correct |
2 |
Execution timed out |
3080 ms |
115312 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
75 ms |
10064 KB |
Output is correct |
2 |
Correct |
167 ms |
9972 KB |
Output is correct |
3 |
Correct |
328 ms |
10188 KB |
Output is correct |
4 |
Correct |
2105 ms |
10072 KB |
Output is correct |
5 |
Correct |
1962 ms |
10160 KB |
Output is correct |
6 |
Correct |
266 ms |
8664 KB |
Output is correct |
7 |
Correct |
1745 ms |
10172 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4944 KB |
Output is correct |
2 |
Correct |
5 ms |
5328 KB |
Output is correct |
3 |
Correct |
4 ms |
5328 KB |
Output is correct |
4 |
Correct |
5 ms |
5456 KB |
Output is correct |
5 |
Correct |
21 ms |
12156 KB |
Output is correct |
6 |
Correct |
518 ms |
115056 KB |
Output is correct |
7 |
Correct |
562 ms |
115060 KB |
Output is correct |
8 |
Correct |
546 ms |
115388 KB |
Output is correct |
9 |
Execution timed out |
3058 ms |
77036 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |