| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 643260 | Vladth11 | The Potion of Great Power (CEOI20_potion) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 = 20;
const int bits = 17;
const int NMAX = 100000;
const int VMAX = NMAX * 89;
int a[NMAX], n;
int u;
int f[NMAX];
int changer = 0;
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;
changer++;
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 && f[x] != changer) {
nou.v.push_back(x);
f[x] = changer;
}
}
vecini = nou.v; // asta e confirmed?
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;
}
int main() {
int N, D, U, Q;
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::cin >> N >> D >> U >> Q;
int *F = new int[N];
for (int i=0; i<N; i++)
std::cin >> F[i];
init(N, D, F);
int *A = new int[U], *B = new int[U];
for (int i=0; i<U; i++) {
std::cin >> A[i] >> B[i];
}
curseChanges(U, A, B);
bool correct = true;
for (int i=0; i<Q; i++) {
int X,Y,V,CorrectAnswer;
std::cin >> X >> Y >> V;
cout << question(X,Y,V) << endl;
}
return 0;
}