#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>
//#define debug(x) cerr << #x << " " << x << "\n"
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int bSize = 100;
const int bits = 17;
const int NMAX = 100000;
const int VMAX = NMAX * 89;
int a[NMAX], n;
int u;
int par[NMAX];
struct BLOCK {
int time;
vector <int> v;
};
class DS {
public:
vector <BLOCK> blocks;
vector <pii> changes;
vector <int> vecini;
void baga(int x, int cand) {
vecini.push_back(x);
changes.push_back({x, cand});
if(changes.size() % bSize == 0) {
BLOCK nou;
nou.v.clear();
nou.time = cand;
for(auto x : vecini){
par[x] = 0;
}
for(auto x : vecini){
par[x]++;
}
for(auto x : vecini){
if(par[x] % 2 == 1) nou.v.push_back(x);
}
blocks.push_back(nou);
}
}
} ds[NMAX];
void init(int N, int D, int H[]) {
n = N;
for(int i = 0; i < N; i++) {
a[i] = H[i];
}
}
void curseChanges(int U, int A[], int B[]) {
u = U;
for(int i = 0; i < U; i++) {
int timp = i + 1;
ds[A[i]].baga(B[i], timp);
ds[B[i]].baga(A[i], timp);
}
}
bool cmp(int A, int B) {
if(a[A] != a[B])
return a[A] < a[B];
return A < B;
}
int impX[NMAX];
int impY[NMAX];
int intrebare;
int question(int x, int y, int v) {
int r = -1;
intrebare++;
int timpX = 0, timpY = 0;
int pas = (1 << bits);
while(pas) {
if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
r += pas;
pas /= 2;
}
vector <int> parcurgere[2];
unordered_set <int> stX;
if(r != -1) {
timpX = ds[x].blocks[r].time + 1;
parcurgere[0] = ds[x].blocks[r].v;
}
r = -1;
pas = (1 << bits);
while(pas) {
if(r + pas < ds[y].blocks.size() && ds[y].blocks[r + pas].time <= v)
r += pas;
pas /= 2;
}
if(r != -1) {
timpY = ds[y].blocks[r].time + 1;
parcurgere[1] = ds[y].blocks[r].v;
}
r = -1, pas = (1 << bits);
while(pas) {
if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
r += pas;
pas /= 2;
}
r++;
for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
pii change = ds[x].changes[r];
parcurgere[0].push_back(change.first);
}
r = -1, pas = (1 << bits);
while(pas) {
if(r + pas < ds[y].changes.size() && ds[y].changes[r + pas].second < timpY)
r += pas;
pas /= 2;
}
r++;
for(; r < ds[y].changes.size() && ds[y].changes[r].second <= v; r++) {
pii change = ds[y].changes[r];
parcurgere[1].push_back(change.first);
}
if(!parcurgere[0].size() || !parcurgere[1].size()) return 1e9;
sort(parcurgere[0].begin(), parcurgere[0].end(), cmp);
sort(parcurgere[1].begin(), parcurgere[1].end(), cmp);
int cnt = 0, i;
for(i = 0; i < parcurgere[0].size(); i++) {
if(i != 0 && parcurgere[0][i - 1] != parcurgere[0][i]) {
if(cnt % 2 == 0) {
impX[parcurgere[0][i - 1]] = intrebare;
}
cnt = 0;
}
cnt++;
}
if(cnt % 2 == 0) {
impX[parcurgere[0][i - 1]] = intrebare;
}
cnt = 0;
for(i = 0; i < parcurgere[1].size(); i++) {
if(i != 0 && parcurgere[1][i - 1] != parcurgere[1][i]) {
if(cnt % 2 == 0) {
impY[parcurgere[1][i - 1]] = intrebare;
}
cnt = 0;
}
cnt++;
}
if(cnt % 2 == 0) {
impY[parcurgere[1][i - 1]] = intrebare;
}
cnt = 0;
int minim = 1e9;
i = 0;
int j = 0;
while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
if(impX[parcurgere[0][i]] == intrebare) {
i++;
continue;
}
if(impY[parcurgere[1][j]] == intrebare) {
j++;
continue;
}
minim = min(minim, abs(a[parcurgere[0][i]] - a[parcurgere[1][j]]));
if(a[parcurgere[0][i]] < a[parcurgere[1][j]])
i++;
else
j++;
}
return minim;
}
Compilation message
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:88:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
88 | if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:101:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if(r + pas < ds[y].blocks.size() && ds[y].blocks[r + pas].time <= v)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:111:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
111 | if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:116:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
116 | for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:122:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
122 | if(r + pas < ds[y].changes.size() && ds[y].changes[r + pas].second < timpY)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:127:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
127 | for(; r < ds[y].changes.size() && ds[y].changes[r].second <= v; r++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:135:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
135 | for(i = 0; i < parcurgere[0].size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:148:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
148 | for(i = 0; i < parcurgere[1].size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:164:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
164 | while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:164:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
164 | while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
| ~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
7376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
7396 KB |
Output is correct |
| 2 |
Correct |
5 ms |
7376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
7376 KB |
Output is correct |
| 4 |
Correct |
23 ms |
8268 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
254 ms |
20056 KB |
Output is correct |
| 2 |
Correct |
221 ms |
20028 KB |
Output is correct |
| 3 |
Execution timed out |
3078 ms |
32124 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
221 ms |
20016 KB |
Output is correct |
| 2 |
Execution timed out |
3035 ms |
25684 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
8144 KB |
Output is correct |
| 2 |
Correct |
178 ms |
8016 KB |
Output is correct |
| 3 |
Correct |
1067 ms |
8100 KB |
Output is correct |
| 4 |
Correct |
1117 ms |
8308 KB |
Output is correct |
| 5 |
Correct |
932 ms |
8336 KB |
Output is correct |
| 6 |
Correct |
100 ms |
7908 KB |
Output is correct |
| 7 |
Execution timed out |
3005 ms |
8272 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
7376 KB |
Output is correct |
| 2 |
Correct |
6 ms |
7396 KB |
Output is correct |
| 3 |
Correct |
5 ms |
7376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
7376 KB |
Output is correct |
| 5 |
Correct |
23 ms |
8268 KB |
Output is correct |
| 6 |
Correct |
254 ms |
20056 KB |
Output is correct |
| 7 |
Correct |
221 ms |
20028 KB |
Output is correct |
| 8 |
Execution timed out |
3078 ms |
32124 KB |
Time limit exceeded |
| 9 |
Halted |
0 ms |
0 KB |
- |
