Submission #73317978

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, s, e) for (ll i = (ll)(s); i < (ll)(e); ++i)
#define rrep(i, s ,e) for (ll i = (ll)(s); i > (ll)(e); --i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 998244353;
//const ll MOD = 1000000007;

ll H,W,N;
int main(){
    cin.tie(0);cout.tie(0);
    ios_base::sync_with_stdio(false);

    cin >> H >> W >> N;
    int n = N;
    vector<pair<int,int>> v(N);
    rep(i,0,N){
        ll h,w;cin >> h >> w;
        v[i] = {h,w};
    }
    map<int,vector<int>> hm,wm;
    rep(i,0,n){
        hm[v[i].first].emplace_back(i);
        wm[v[i].second].emplace_back(i);
    }
    vector<int> X(N),Y(N);
    int a = 1,b = W,c = 1,d = H;
    ll cnt = 0;
    ll p = 0;
    while(cnt != N){
        p++;
        int w = b-a+1,h = d-c+1;
        for(auto x:hm[h]){
            X[x] = c,Y[x] = a;
            a += v[x].second;
            cnt++;
            if(cnt == N)break;
            w = b-a+1,h = d-c+1;
          
        }
        if(cnt == N)break;
        for(auto x:wm[w]){
            X[x] = c,Y[x] = a;
            c += v[x].first;
            cnt++;
            w = b-a+1,h = d-c+1;
        if(cnt == N)break;
        }
       // if(p == 5)break;
        
    }
    rep(i,0,N){
        cout << X[i] << " " << Y[i] << endl;
    }
}

Submission Info

Judge Result