#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <iostream>
#include <vector>
#include "testlib.h"

using namespace std;
set<vector<int> > st, a, b, c;

int main (int argc, char ** argv) {
    registerTestlibCmd(argc, argv);
    int n = ouf.readInt(-1, 1e6, "n");
    if (n == -1) {
        int an = ans.readInt();
        if (n != an)
            quitf(_wa, "Answer error");
        quitf(_ok, "");
        return 0;
    }
    for (int i = 1; i <= n; i ++) {
        int x = ouf.readInt(-1e2, 1e2, "x[%d]", i);
        int y = ouf.readInt(-1e2, 1e2, "y[%d]", i);
        int z = ouf.readInt(-1e2, 1e2, "z[%d]", i);
        st.insert(vector<int>{x, y, z});
        a.insert(vector<int>{x, y});
        b.insert(vector<int>{x, z});
        c.insert(vector<int>{y, z});
    }
    if (st.size() != n) 
        quitf(_wa, "Duplicate locations found");
    int r = 0;
    if (a.size() != (r = inf.readInt()))
        quitf(_wa, "a error: expected %d, found %d", r, a.size());
    if (b.size() != (r = inf.readInt()))
        quitf(_wa, "b error: expected %d, found %d", r, b.size());
    if (c.size() != (r = inf.readInt()))
        quitf(_wa, "c error: expected %d, found %d", r, c.size());
    quitf(_ok, "");
    return 0;
}

看别人的博客学的SPJ，就自己写了一个啦啦啦

机房电脑怎么也没法运行这个程序，所以没办法测试代码是不是对的