Submission #3769401

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

int main(void){
    int n, inf = 1000, ans = 0;
    cin >> n;
    int a[1105], b[1105], c[1105], d[1105], e[1205], f[1205], g[1205], h[1205];
    for (int i = 0; i < 2 * n; i++) {
        e[i] = f[i] = g[i] = h[i] = -1;
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        e[a[i]] = f[b[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> c[i] >> d[i];
        g[c[i]] = h[d[i]] = i;
    }
    
    for (int i = 2 * n - 1; i >= 0; i--) {
        if (g[i] >= 0 && h[i] >= 0) { 
            if (c[g[i]] > d[h[i]]) {
                bool x = false;
                for (int j = i - 1; j >= 0; j--) {
                    if (e[j] >= 0 && b[f[j]] < d[h[i]]) {
                        ans++;
                        a[e[j]] = b[f[j]] = inf;
                        x = true;
                        break;
                    }
                }
                if (!x) {
                for (int j = i - 1; j >= 0; j--) {
                    if (f[j] >= 0 && a[e[j]] < c[g[i]]) {
                        ans++;
                        c[g[j]] = d[h[j]] = inf;
                        break;
                    }
                }
                }
            }
            else if (c[g[i]] < d[h[i]]) {
                for (int j = i - 1; j >= 0; j--) {
                    if (f[j] >= 0 && a[e[j]] < c[g[i]]) {
                        ans++;
                        c[g[j]] = d[h[j]] = inf;
                        break;
                    }
                }
                for (int j = i - 1; j >= 0; j--) {
                    if (e[j] >= 0 && b[f[j]] < d[h[i]]) {
                        ans++;
                        a[e[j]] = b[f[j]] = inf;
                        break;
                    }
                }
            }
            else {
                for (int j = i - 1; j >= 0; j--) {
                    if (f[j] >= 0 && a[e[j]] < c[g[i]]) {
                        ans++;
                        c[g[j]] = d[h[j]] = inf;
                        break;
                    }
                }
            }
        } 
        else if (g[i] >= 0) {
            for (int j = i - 1; j >= 0; j--) {
                if (e[j] >= 0 && b[f[j]] < d[h[i]]) {
                    ans++;
                    a[e[j]] = b[e[j]] = inf;
                    break;
                }
            }
        }
        else if (h[i] >= 0) {
            for (int j = i - 1; j >= 0; j--) {
                if (f[j] >= 0 && a[e[j]] < c[g[i]]) {
                    ans++;
                    c[f[j]] = d[f[j]] = inf;
                    break;
                }
            }
        }
    }
    
    cout << ans << endl;
    
    for (int i = 0; i < n; i++) cout << a[i] << " " << b[i] << " " << c[i] << " " << d[i] << endl;
    for (int i = 0; i < 2*n; i++) cout << e[i] << " " << f[i] << " " << g[i] << " " << h[i] << endl;
}

Submission Info

Judge Result