记录编号	569052	评测结果	AAAAAAAAAA
题目名称	[NOIP 2008]排座椅	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-02-14 16:37:33	内存使用	0.00 MiB

#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define ABS(_x) ((_x)<0?(-(_x)):(_x))
#define MAX(_a, _b) ((_a)<(_b)?(_b):(_a))
#define MIN(_a, _b) ((_a)>(_b)?(_b):(_a))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

namespace IO{
    template<typename T>
    inline T read() {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        return ret*sig;
    }
    template<typename T>
    inline void read(T &x) {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        x = ret*sig;
    }
    template<typename T>
    inline void write(T x) {
        if(x<0) putchar('-'), x=-x;
        T stk[100], tt=0;
        do stk[tt++]=x%10, x/=10; while(x);
        while(tt) putchar(stk[--tt]+'0');
    }
};

const int N = 1010;
int m, n, k, l, d;
PII line[N], col[N];

int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(seats);
    IO::read(m), IO::read(n), IO::read(k), IO::read(l), IO::read(d);
    for(register int i = 1; i<=d; ++i) {
        int x1, y1, x2, y2;
        IO::read(x1), IO::read(y1), IO::read(x2), IO::read(y2);
        if(x1 == x2) {
            int coll = MIN(y1, y2);
            col[coll].se++, col[coll].fi = coll;
        } else {
            int linee = MIN(x1, x2);
            line[linee].se++, line[linee].fi = linee;
        }
    }
    sort(col, col+N, [](PII a, PII b){return a.se>b.se;});
    sort(col, col+l, [](PII a, PII b){return a.fi<b.fi;});
    sort(line, line+N, [](PII a, PII b){return a.se>b.se;});
    sort(line, line+k, [](PII a, PII b){return a.fi<b.fi;});
    for(register int i = 0; i<k; ++i) {
        IO::write(line[i].fi);
        putchar(' ');
    }
    puts("");
    for(register int i = 0; i<l; ++i) {
        IO::write(col[i].fi);
        putchar(' ');
    }
    return 0;
}