#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
namespace {
using namespace std;
}
typedef pair<int,int> pii;
struct SEG {
struct Node {
vector<int> lz;
int lft,rt;
Node():lft(0),rt(0) {}
};
int n;
vector<Node> tree;
SEG(int _n):n(_n) {
tree.push_back(Node());
}
int add() {
tree.push_back(Node());
return tree.size()-1;
}
void update(int L,int R,int val,int l,int r,int id) {
if (L<=l and r<=R) {
tree[id].lz.push_back(val);
return;
}
int mid=l+r>>1;
if (L<=mid) {
if (!tree[id].lft) tree[id].lft = add();
update(L,R,val,l,mid,tree[id].lft);
}
if (mid<R) {
if (!tree[id].rt) tree[id].rt = add();
update(L,R,val,mid+1,r,tree[id].rt);
}
}
void query(int t,vector<int> &h,int l,int r,int id) {
for (int i:tree[id].lz) h.push_back(i);
int mid=l+r>>1;
if (t<=mid) {
if (tree[id].lft) query(t,h,l,mid,tree[id].lft);
} else {
if (tree[id].rt) query(t,h,mid+1,r,tree[id].rt);
}
}
};
namespace {
vector<SEG> seg;
vector<vector<pii>> lst;
int n,d,u;
vector<int> h;
}
void init(int N, int D, int H[]) {
n=N;d=D;
h.resize(n);
lst.resize(n);
for (int i=0;i<n;i++) h[i]=H[i];
}
void curseChanges(int U, int A[], int B[]) {
u=U;
seg.resize(n,SEG(u));
map<pii,int> tm;
for (int i=0;i<u;i++) {
if (A[i]>B[i]) swap(A[i],B[i]);
if (tm[pair(A[i],B[i])]==0) tm[pair(A[i],B[i])]=i+1;
else {
seg[A[i]].update(tm[pair(A[i],B[i])],i,h[B[i]],1,u,0);
seg[B[i]].update(tm[pair(A[i],B[i])],i,h[A[i]],1,u,0);
tm[pair(A[i],B[i])]=0;
}
}
for (auto [p,t]:tm) {
if (t==0) continue;
lst[p.F].push_back({t,h[p.S]});
lst[p.S].push_back({t,h[p.F]});
}
for (int i=0;i<n;i++) {
sort(all(lst[i]));
// cout<<i<<" :\n";
// for (auto [a,b]:lst[i]) cout<<a<<" "<<b<<"\n";
}
}
int question(int x, int y, int v) {
vector<int> a,b;
seg[x].query(v,a,1,u,0);
seg[y].query(v,b,1,u,0);
// for (int i:a) cout<<i<<" ";
// cout<<"a\n";
// for (int i:b) cout<<i<<" ";
// cout<<"b\n"<<flush;
auto it = lower_bound(all(lst[x]),pair(v,0));
for (auto i=lst[x].begin();i!=it;i++) a.push_back(i->S);
it = lower_bound(all(lst[y]),pair(v,0));
for (auto i=lst[y].begin();i!=it;i++) b.push_back(i->S);
sort(all(a));
sort(all(b));
// for (int i:a) cout<<i<<" ";
// cout<<"a\n";
// for (int i:b) cout<<i<<" ";
// cout<<"b\n"<<flush;
int ans=1e9;
for (int i:a) {
auto ptr = lower_bound(all(b),i);
if (ptr!=b.end()) ans=min(ans,abs(*ptr-i));
if (ptr!=b.begin()) ans=min(ans,abs(*prev(ptr)-i));
}
return ans;
}
/*
6 5 11 4
2 42 1000 54 68 234
0 1
2 0
3 4
3 5
3 5
1 3
5 3
0 5
3 0
1 3
3 5
0 3 4 26
3 0 8 0
0 5 5 1000000000
3 0 11 14
*/
Compilation message
potion.cpp: In member function 'void SEG::update(int, int, int, int, int, int)':
potion.cpp:30:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
30 | int mid=l+r>>1;
| ~^~
potion.cpp: In member function 'void SEG::query(int, std::vector<int>&, int, int, int)':
potion.cpp:42:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
42 | int mid=l+r>>1;
| ~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
592 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
287 ms |
31660 KB |
Output is correct |
| 2 |
Correct |
265 ms |
31860 KB |
Output is correct |
| 3 |
Incorrect |
442 ms |
155648 KB |
Incorrect |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
211 ms |
31560 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
13 ms |
2640 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
592 KB |
Incorrect |
| 3 |
Halted |
0 ms |
0 KB |
- |
