Submission #1169826

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169826		crackhead	Circle Passing (EGOI24_circlepassing)	C++20	0 / 100	3 ms	580 KiB

Main

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

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, q;
	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);
	}
	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=min(b-a, 2*n+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, abs(tele+n-b)+abs(tele-a));
		
		auto aft=upper_bound(arr.begin(), arr.end(), a+2*n);
		aft--;
		tele=*aft;
		int opp=(tele+n)%(2*n);
		ans=min(ans, abs(a+2*n-tele)+abs(b-opp));
		std::cout << ans << "\n";
	}
}

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