Submission #1209356

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209356		irmuun	The Potion of Great Power (CEOI20_potion)	C++20	17 / 100	3098 ms	25384 KiB

potion

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

const int maxn=2e5+5;

namespace {
	int N,D,H[maxn];
	int U,A[maxn],B[maxn];
	map<pair<int,int>,bool>mp;
	vector<int>g[maxn];
	int cnt[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[]) {
	::U=U;
	for(int i=0;i<U;i++){
		if(A[i]>B[i]) swap(A[i],B[i]);
		::A[i]=A[i];
		::B[i]=B[i];
	}
}

int question(int x, int y, int v) {
	mp.clear();
	for(int i=0;i<N;i++){
		g[i].clear();
	}
	for(int i=0;i<v;i++){
		if(mp[{A[i],B[i]}]==false){
			mp[{A[i],B[i]}]=true;
		}
		else{
			mp[{A[i],B[i]}]=false;
		}
	}
	for(auto [a,t]:mp){
		if(t==true){
			g[a.ff].pb(a.ss);
			g[a.ss].pb(a.ff);
		}
	}
	int ans=1e9;
	for(auto x1:g[x]){
		for(auto y1:g[y]){
			ans=min(ans,abs(H[x1]-H[y1]));
		}
	}
	return ans;
}

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