Spiraali

using namespace std;
#include <iostream>
#include <vector>
#include <map>
#define ll long long

map<pair<ll, ll>, ll> m;

int main()
{
	ll n, t;
	cin >> n >> t;
	for (ll i = 1; i <= t; i++)
	{
		ll y, x;
		cin >> y >> x;
		m.insert({ {y,x},0 });
	}
	ll y = 0, x = 1, y_y = 1, y_a = n, x_v = 1, x_o = n, d = 1;
	for (ll k = 1; k <= n * n; k++)
	{
		switch (d)
		{
			case(1):
			{
				y++;
				if (y == y_a)
				{
					x_v++; d = 2;
				}
			}
				break;
			case(2):
			{
				x++;
				if (x == x_o)
				{
					y_a--; d = 3;
				}
			}
				break;
			case(3):
			{
				y--;
				if (y == y_y)
				{
					x_o--; d = 4;
				}
			}
				break;
			case(4):
			{
				x--;
				if (x == x_v)
				{
					y_y++; d = 1;
				}
			}
				break;
		}
		if (m.count({ y,x }))
		{
			m[{y, x}] = k;
			t--;
		}
		if (!t)
			break;
	}
	for (auto i : m)cout << i.second << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED