Submission #588974

#	Time	Username	Problem	Language	Result	Execution time	Memory
588974		Arnch	The Potion of Great Power (CEOI20_potion)	C++17	0 / 100	3026 ms	70092 KiB

potion

#include<bits/stdc++.h>
using namespace std;

const int N = 1e3 + 10, maxn = 1e6 + 10;

int n, d, h[maxn], a[maxn], b[maxn];
set<int> st[maxn];

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];
	}

	for(int i = 0; i < U; i++) {
		if(st[a[i]].count(b[i]) != 0) st[a[i]].erase(b[i]);
		else st[a[i]].insert(b[i]);

		if(st[b[i]].count(a[i]) != 0) st[b[i]].erase(a[i]);
		else st[b[i]].insert(a[i]);
	}
}

int question(int x, int y, int v) {
	int ans = 1e9;
	for(auto it : st[x]) {
		for(auto it2 : st[y]) {
			ans = min(ans, abs(h[it] - h[it2]));
		}
	}

	return ans;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 17
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 30