Submission #1168178

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168178		pyrros	Circle Passing (EGOI24_circlepassing)	C++20	14 / 100	24 ms	584 KiB

Main

#include <bits/stdc++.h>

using namespace std;
#define int long long

signed main()
{
	int n, m, q;
	cin>>n>>m>>q;
	vector<int> bff;
	int pivot = 0;
	for(int i = 0; i < m; i++)
	{
		int a; cin>>a;
		bff.push_back(a);
		pivot = a;
	}
	//st1
	//int diff = pivot;
	int new_target = 0;
	while(q--)
	{
		int x, y; cin>>x>>y;
		if(y > x){
		new_target = y-pivot;
	}else if(y < x)
	{
		new_target = 2*n-(x-y);
	}
	//cout<<"new_target: "<<new_target<<endl;
	int answer = 1e9;
	//approach from centre
	int center = abs(n-new_target);
	int start;
	if(new_target > n)
	{
		start = 2*n-new_target;
	}
	else if(new_target < n)
	{
		start = new_target;
	}
	else if(new_target == n)
	{ cout<<1<<'\n'; continue;
	}
	answer = min(start, center+1);
	cout<<answer<<'\n';
	
	}
}

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