제출 #1147208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147208		Dan4Life	The Potion of Great Power (CEOI20_potion)	C++20	17 / 100	3081 ms	27724 KiB

potion

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)1e5+10;
using ar2 = array<int,2>;
int n, m;
int a[mxN];
set<ar2> S[mxN];
vector<ar2> v;
void init(int N, int D, int H[]) {
	n = N;
	for(int i = 0; i < n; i++) a[i]=H[i];
}

void toggle(int x, int y){
	if(S[x].count({a[y],y})) S[x].erase({a[y],y});
	else S[x].insert({a[y],y});
}

void curseChanges(int U, int A[], int B[]) {
	m = U;
	for(int i = 0; i < m; i++){
		int x = A[i], y = B[i];
		v.pb({x,y});
	}
}

int question(int x, int y, int t) {
	int ans = (int)1e9;
	for(int i = 0; i < t; i++) 
		toggle(v[i][0],v[i][1]),toggle(v[i][1],v[i][0]);
	if(!sz(S[x]) or !sz(S[y])){
		for(int i = 0; i < t; i++) 
		toggle(v[i][0],v[i][1]),toggle(v[i][1],v[i][0]);
		return ans;
	}
	auto itr = begin(S[y]);
	for(auto [u,v] : S[x]){
		while(itr!=end(S[y]) and (*itr)[0] < u) itr++;
		if(itr!=begin(S[y])) ans=min(ans, abs(u-(*prev(itr))[0]));
		if(itr!=end(S[y])) ans=min(ans, abs(u-(*itr)[0]));
	}
	for(int i = 0; i < t; i++) 
		toggle(v[i][0],v[i][1]),toggle(v[i][1],v[i][0]);
    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