提出 #73305563

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define A array <int, 3>

const int N = 200010;

int h, w, n;
int l[N], r[N];
int X[N], Y[N];
set <A> s, t;

int main() {
	cin >> h >> w >> n;
	for (int i = 1 ; i <= n ; i++)
		cin >> l[i] >> r[i], s.insert({l[i], r[i], i}), t.insert({r[i], l[i], i});
	for (int i = 1 ; i <= n ; i++) {
		auto it = s.lower_bound((A){h, -1, -1});
		if (it != s.end() && (*it)[0] == h) {
			int x = (*it)[2];
			X[x] = 1, Y[x] = w - r[x] + 1;
			w -= r[x];
			s.erase({l[x], r[x], x});
			t.erase({r[x], l[x], x});
		} else {
			it = t.lower_bound((A){w, -1, -1});
			assert(it != t.end() && (*it)[0] == w);
			int x = (*it)[2];
			X[x] = h - l[x] + 1, Y[x] = 1;
			h -= l[x];
			s.erase({l[x], r[x], x});
			t.erase({r[x], l[x], x});
		}
	}
	for (int i = 1 ; i <= n ; i++) cout << X[i] << " " << Y[i] << endl;
	return 0;
}

提出情報

ジャッジ結果