#include <bits/stdc++.h>
using namespace std;
const int nx=1e3+5;
int n, m, cnt[nx][nx];
vector<int> h;
vector<pair<int, int>> edg;
void init(int N, int D, int H[]) {
n=N;
for (int i=0; i<n; i++) h.push_back(H[i]);
}
void curseChanges(int U, int A[], int B[]) {
m=U;
for (int i=0; i<m; i++) edg.push_back({A[i], B[i]});
}
int question(int x, int y, int v) {
int res=1e9;
for (int i=0; i<=v; i++) cnt[edg[i].first][edg[i].second]^=1, cnt[edg[i].second][edg[i].first]^=1;
for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (cnt[x][i]&&cnt[y][j]) res=min(res, abs(h[i]-h[j]));
for (int i=0; i<=v; i++) cnt[edg[i].first][edg[i].second]^=1, cnt[edg[i].second][edg[i].first]^=1;
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |