Submission #41975092

---

Source Code Expand

import std;

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}

void read_array(T)(string S, ref T[] arg) {
    arg = S.split.to!(T[]);
}

struct pair {
    int p;
    int q;
}

void main () {
    int W, H; read(readln, W, H);
    int N; read(readln, N);
    pair[] cod = new pair[](N);
    foreach (i; 0..N) {
        read(readln, cod[i].p, cod[i].q);
    }

    int A; readln.read(A);
    int[] a = new int[](A);
    read_array(readln, a);
    int B; readln.read(B);
    int[] b = new int[](B);
    read_array(readln, b);

    solve(W, H, N, cod, a, b);
}

void solve (int W, int H, int N, pair[] cod, int[] a, int[] b) {
    int[pair] map;
    a = 0 ~ a;
    b = 0 ~ b;

    //stderr.writeln(a);
    //stderr.writeln(b);

    foreach (x; cod) {
        int X, Y;
        {
            int left = 0, right = cast(int)a.length;
            while (right - left != 1) {
                int center = (left + right) / 2;
                if (a[center] < x.p) {
                    left = center;
                } else {
                    right = center;
                }
            }
            X = left;
        }
        {
            int left = 0, right = cast(int)b.length;
            while (right - left != 1) {
                int center = (left + right) / 2;
                if (b[center] < x.q) {
                    left = center;
                } else {
                    right = center;
                }
            }
            Y = left;
        }
        if (pair(X, Y) in map) {
            map[pair(X, Y)]++;
        } else {
            map[pair(X, Y)] = 1;
        }
    }

    //stderr.writeln(map);

    int m = int.max, M = 0;
    foreach (x; map) {
        M = max(M, x);
        m = min(m, x);
    }
    if (map.length < a.length * b.length) {
        m = 0;
    }

    writeln(m, " ", M);
}

Submission Info

Judge Result