Submission #73327635

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
struct rect{
    int h, w, i;
    bool v;
};
bool rect_sort(rect r1, rect r2){
    int v1 = max(r1.h,r1.w);
    int v2 = max(r2.h,r2.w);
    return v1 > v2;
}
int main(){
    int h, w, n; cin >> h >> w >> n;
    vector<rect> v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i].h >> v[i].w;
        v[i].i = i;
        v[i].v = false;
    }
    sort(v.begin(),v.end(), rect_sort);
    vector<pair<int,int>> res(n);
    pair<int,int> curr = {1,1};
    int bound = n-1;
    for(int _ = 0; _ < n; _++){
        for(int i = bound; i >= 0; i--){
            if(v[i].v) continue;
            if(v[i].w == w){
                res[v[i].i] = curr;
                curr.first += v[i].h;
                h -= v[i].h;
            } else if(v[i].h == h){
                res[v[i].i] = curr;
                curr.second += v[i].w;
                w -= v[i].w;
            } else continue;
            v[i].v = true;
            if(i == bound){
                bound--;
                while(v[bound].v) bound--;
            }
        }
    } 
    for(auto p: res){
        cout << p.first << ' ' << p.second << '\n';
    }
}

Submission Info

Judge Result