Submission #1169860

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169860		monkey133	Circle Passing (EGOI24_circlepassing)	C++20	100 / 100	144 ms	16800 KiB

Main

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

int n, m, q;

int sp(int a, int b)
{
  return min(abs(b-a), 2*n - abs(b-a));
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	std::cin >> n >> m >> q;
	std::vector <int> arr;
	for(int i=0; i<m; i++){
		int x;
		std::cin >> x;
		arr.push_back(x);
		arr.push_back(x+n);
		arr.push_back(x+2*n);
		arr.push_back(x+3*n);
	}
	sort(arr.begin(), arr.end());
	
	for(int i=0; i<q; i++){
		int a, b;
		std::cin >> a >> b;
		if (a > b) swap(a, b);
		int ans= sp(a, b);
		
		//else if theres like smth between both of these that can +n then try it ig
		auto mid=lower_bound(arr.begin(), arr.end(), a);//check if <b ltr
		int tele=*mid;
		
		ans=min(ans, sp(tele, a) + sp(tele + n, b) + 1);
		auto aft=upper_bound(arr.begin(), arr.end(), a+2*n);
		aft--;
		tele=*aft;
		ans=min(ans, sp(a, tele) + sp(b, (tele + n)%(2*n)) + 1);
		std::cout << ans << "\n";
	}
}

• Subtask 1: 14 / 14
• Subtask 2: 20 / 20
• Subtask 3: 22 / 22
• Subtask 4: 17 / 17
• Subtask 5: 27 / 27