Submission #24866289

---

Source Code Expand

#include <bits/stdc++.h>
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("tune=native")*/
using namespace std;
typedef long long ll;
typedef long double ld;

const int MAX_N = 100005;

int h, w, n;
tuple<int, int, int> c[MAX_N];
int row[MAX_N];
int col[MAX_N];

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> h >> w >> n;
	for (int i = 0; i < n; i++)
	{
		int a, b;
		cin >> a >> b;
		c[i] = { a, b, i };
	}

	sort(c, c + n, [](const auto& t1, const auto& t2)
		{
			return get<0>(t1) < get<0>(t2);
		});
	for (int i = 0; i < n; i++)
	{
		if (i == 0)
			row[get<2>(c[i])] = 1;
		else if (get<0>(c[i]) == get<0>(c[i - 1]))
			row[get<2>(c[i])] = row[get<2>(c[i - 1])];
		else
			row[get<2>(c[i])] = row[get<2>(c[i - 1])] + 1;
	}

	sort(c, c + n, [](const auto& t1, const auto& t2)
		{
			return get<1>(t1) < get<1>(t2);
		});
	for (int i = 0; i < n; i++)
	{
		if (i == 0)
			col[get<2>(c[i])] = 1;
		else if (get<1>(c[i]) == get<1>(c[i - 1]))
			col[get<2>(c[i])] = col[get<2>(c[i - 1])];
		else
			col[get<2>(c[i])] = col[get<2>(c[i - 1])] + 1;
	}

	for (int i = 0; i < n; i++)
		cout << row[i] << ' ' << col[i] << '\n';

	return 0;
}

Submission Info

Judge Result