제출 #1151464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151464		MuhammadSaram	Circle Passing (EGOI24_circlepassing)	C++20	100 / 100	166 ms	4328 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
#define dis(x,y) min(abs(x-y),2*n-abs(x-y))

int main()
{
	int n,m,q,x;
	cin>>n>>m>>q;
	vector<int> v(2*m);
	for (int i=0;i<m;i++)
		cin>>v[i];
	for (int i=m;i<2*m;i++)
		v[i]=v[i-m]+n;
	while (q--)
	{
		int x,y;
		cin>>x>>y;
		int ans=dis(x,y);
		int nx=lower_bound(all(v),x)-begin(v),pr=nx;
		if (nx==v.size())
			nx=0;
		nx=v[nx];
		if (!pr)
			pr=v.size();
		pr=v[pr-1];
		ans=min(ans,dis(x,nx)+dis((nx+n)%(2*n),y)+1);
		ans=min(ans,dis(x,pr)+dis((pr+n)%(2*n),y)+1);
		cout<<ans<<endl;
	}
	
	return 0;
}

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