Submission #588928

#TimeUsernameProblemLanguageResultExecution timeMemory
588928ArnchThe Potion of Great Power (CEOI20_potion)C++17
0 / 100
30 ms1232 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e3 + 10; int n, d, h[N], a[N], b[N]; bool mark[N][N]; void init(int N, int D, int H[]) { n = N, d = D; for(int i = 0; i < n; i++) h[i] = H[i]; } void curseChanges(int U, int A[], int B[]) { for(int i = 0; i < U; i++) a[i] = A[i], b[i] = B[i]; } int question(int x, int y, int v) { memset(mark, 0, sizeof(mark)); for(int i = 0; i < v; i++) { mark[a[i]][b[i]] = 1 - mark[a[i]][b[i]]; mark[b[i]][a[i]] = 1 - mark[b[i]][a[i]]; } int ans = 1e9; for(int i = 0; i < n; i++) { if(!mark[x][i]) continue; for(int j = 0; j < n; j++) { if(!mark[y][j]) continue; ans = min(ans, abs(h[i] - h[j])); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...