File size: 3,523 Bytes
5fed0fc |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 |
#include "testlib.h"
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
registerTestlibCmd(argc, argv);
// Read input
long long N = inf.readLong();
int K = inf.readInt();
vector<long long> a(10);
for (int i = 0; i < 10; i++) a[i] = inf.readLong();
vector<long long> xs(N), ys(N);
for (long long i = 0; i < N; i++) {
xs[i] = inf.readLong();
ys[i] = inf.readLong();
}
// Parse outputs: multiple solutions allowed, only the last one is used
struct Line { long long px, py, qx, qy; };
vector<vector<Line>> solutions;
while (!ouf.seekEof()) {
int k = ouf.readInt(0, K, "k");
vector<Line> lines;
lines.reserve(k);
for (int i = 0; i < k; i++) {
long long px = ouf.readLong(-1000000000LL, 1000000000LL, "px");
long long py = ouf.readLong(-1000000000LL, 1000000000LL, "py");
long long qx = ouf.readLong(-1000000000LL, 1000000000LL, "qx");
long long qy = ouf.readLong(-1000000000LL, 1000000000LL, "qy");
ensuref(!(px == qx && py == qy), "line endpoints must be different (got identical points at cut %d)", i + 1);
lines.push_back({px, py, qx, qy});
}
solutions.push_back(lines);
}
ensuref(!solutions.empty(), "no solution provided");
// Use the last solution
const vector<Line>& lines = solutions.back();
// Compute pieces
vector<vector<int>> pieces(1);
pieces[0].resize(N);
iota(pieces[0].begin(), pieces[0].end(), 0);
for (const auto& ln : lines) {
vector<vector<int>> new_pieces;
new_pieces.reserve(pieces.size() * 2);
long long px = ln.px, py = ln.py, qx = ln.qx, qy = ln.qy;
long long vx = qx - px, vy = qy - py;
for (auto& piece : pieces) {
vector<int> left, right;
left.reserve(piece.size());
right.reserve(piece.size());
for (int idx : piece) {
long long x = xs[idx], y = ys[idx];
long long sx = x - px, sy = y - py;
__int128 cross = (__int128)vx * (__int128)sy - (__int128)vy * (__int128)sx;
if (cross > 0) {
left.push_back(idx);
} else if (cross < 0) {
right.push_back(idx);
} else {
// on the line -> discarded
}
}
if (!left.empty()) new_pieces.push_back(move(left));
if (!right.empty()) new_pieces.push_back(move(right));
}
pieces.swap(new_pieces);
}
// Count b_d
vector<long long> b(10, 0);
for (const auto& piece : pieces) {
size_t sz = piece.size();
if (sz >= 1 && sz <= 10) b[sz - 1]++;
}
// Compute score
long long num = 0;
long long den = 0;
for (int d = 0; d < 10; d++) {
num += min<long long>(a[d], b[d]);
den += a[d];
}
ensuref(den > 0, "invalid input: sum of a_d is zero");
long long score = llround(1e6 * (double)num / (double)den);
long long baseline_value = ans.readLong();
long long best_value = ans.readLong();
double score_ratio = max(0.0, min(1.0, (double)(score - baseline_value) / (best_value - baseline_value)));
double unbounded_ratio = max(0.0, (double)(score - baseline_value) / (best_value - baseline_value));
quitp(score_ratio, "Value: %lld. Ratio: %.4f, RatioUnbounded: %.4f", score, score_ratio, unbounded_ratio);
} |