spj 提供

#include <bits/stdc++.h>
#include "testlib.h"
using namespace std;
const int N = 1009;
#define double long double
struct node {
    double x, y;
} a[N];
inline double dist(int x, int y) {
    double dx = a[x].x - a[y].x, dy = a[x].y - a[y].y;
    return sqrtl(dx * dx + dy * dy);
}
int n, out[N], ans_out[N];
bool vis_out[N], vis_ans[N];
double dis_out, dis_ans;
int main(int argc, char **argv) {
    registerTestlibCmd(argc, argv);
    n = inf.readInt();
    for (int i = 1; i <= n; i++) {
        a[i].x = inf.readReal();
        a[i].y = inf.readReal();
    }
    for (int i = 1; i <= n; i++) {
        out[i] = ouf.readInt();
        if (out[i] < 1 || out[i] > n) {
            quitf(_wa, "Point %d violates the range[1, %d]", out[i], n);
            return 0;
        }
    }
    for (int i = 1; i <= n; i++) {
        ans_out[i] = ans.readInt();
    }
    if (ans_out[1] != out[1]) {
        quitf(_wa, "The first point of your answer is wrong: expected = %d, found = %d", ans_out[1], out[1]);
        return 0;
    }
    vis_out[out[1]] = vis_ans[ans_out[1]] = 1;
    for (int i = 2; i <= n; i++) {
        if (vis_out[out[i]]) {
            quitf(_wa, "A point appears twice in your answer.");
            return 0;
        } else if (vis_ans[ans_out[i]]) {
            assert(0);
        }
        dis_out += dist(out[i - 1], out[i]);
        dis_ans += dist(ans_out[i - 1], ans_out[i]);
        vis_out[out[i]] = vis_ans[ans_out[i]] = 1;
    }
    if (fabsl(dis_out - dis_ans) <= 1e-10 || fabsl(dis_out - dis_ans) / dis_ans <= 1e-10) {
        quitf(_ok, "Your answer is correct.");
    } else {
        quitf(_wa, "Your answer is wrong: expected = %Lf, found = %Lf", dis_ans, dis_out);
    }
    return 0;
}