File size: 6,392 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 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 |
#include "testlib.h"
#include <bits/stdc++.h>
using namespace std;
struct UnionFind {
int n;
vector<int> p; // negative size for root, parent otherwise
UnionFind(int n = 0): n(n), p(n, -1) {}
int find(int x) {
if (p[x] < 0) return x;
return p[x] = find(p[x]);
}
bool unite(int a, int b) {
a = find(a); b = find(b);
if (a == b) return false;
if (-p[a] < -p[b]) swap(a, b);
p[a] += p[b];
p[b] = a;
return true;
}
bool same(int a, int b) { return find(a) == find(b); }
int size(int x) { return -p[find(x)]; }
};
// Function now takes testlib streams
static long long compute_score(InStream& inf, InStream& ouf) {
// Read input using inf
long long N = inf.readLong();
long long T = inf.readLong();
vector<string> rows(N);
for (long long i = 0; i < N; i++) {
rows[i] = inf.readToken();
if ((long long)rows[i].size() != N) quitf(_fail, "row length mismatch at row %lld", i);
}
// No fin.close() needed
// Parse tiles
auto hexval = [](char c) -> int {
if ('0' <= c && c <= '9') return c - '0';
if ('a' <= c && c <= 'f') return 10 + (c - 'a');
if ('A' <= c && c <= 'F') return 10 + (c - 'A');
return -1;
};
vector<vector<int>> tiles(N, vector<int>(N, 0));
long long bi = -1, bj = -1;
for (long long i = 0; i < N; i++) {
for (long long j = 0; j < N; j++) {
int v = hexval(rows[i][j]);
if (v < 0) quitf(_fail, "invalid hex at (%lld,%lld)", i, j);
tiles[i][j] = v;
if (v == 0) { bi = i; bj = j; }
}
}
if (bi == -1) quitf(_fail, "no empty tile found");
// Read output (moves) using ouf
string moves;
try {
moves = ouf.readToken(); // Reads the single block of moves, trimming whitespace.
} catch (...) {
// Handle empty output (which is valid)
moves = "";
}
ouf.seekEof(); // Ensure no extra output
// No fou.close() needed or whitespace removal loop
// from mapping: for position (i,j), store original (i0,j0)
vector<vector<pair<long long,long long>>> from(N, vector<pair<long long,long long>>(N));
for (long long i = 0; i < N; i++) for (long long j = 0; j < N; j++) from[i][j] = {i, j};
auto apply_move = [&](char c, long long turn, long long &ci, long long &cj) {
long long di = 0, dj = 0;
if (c == 'L') { di = 0; dj = -1; }
else if (c == 'U') { di = -1; dj = 0; }
else if (c == 'R') { di = 0; dj = 1; }
else if (c == 'D') { di = 1; dj = 0; }
else {
quitf(_wa, "illegal move: %c (turn %lld)", c, turn);
}
long long ni = ci + di, nj = cj + dj;
if (ni < 0 || ni >= N || nj < 0 || nj >= N) {
quitf(_wa, "illegal move: %c (turn %lld)", c, turn);
}
auto f1 = from[ci][cj];
auto f2 = from[ni][nj];
from[ni][nj] = f1;
from[ci][cj] = f2;
ci = ni; cj = nj;
};
long long turn = 0;
long long ci = bi, cj = bj;
for (char c : moves) {
apply_move(c, turn, ci, cj);
turn++;
}
if (turn > T) {
quitf(_wa, "too many moves");
}
// Reconstruct current tiles with mapping
vector<vector<int>> cur(N, vector<int>(N, 0));
for (long long i = 0; i < N; i++) {
for (long long j = 0; j < N; j++) {
auto pr = from[i][j];
cur[i][j] = tiles[pr.first][pr.second];
}
}
// Build graph via UnionFind
UnionFind uf((int)(N * N));
vector<char> tree(N * N, 1); // true initially
auto id = [N](long long i, long long j) { return (int)(i * N + j); };
for (long long i = 0; i < N; i++) {
for (long long j = 0; j < N; j++) {
if (i + 1 < N) {
if ((cur[i][j] & 8) != 0 && (cur[i + 1][j] & 2) != 0) {
int a = uf.find(id(i, j));
int b = uf.find(id(i + 1, j));
if (a == b) {
tree[a] = 0;
} else {
char t = tree[a] && tree[b];
uf.unite(a, b);
int r = uf.find(a);
tree[r] = t;
}
}
}
if (j + 1 < N) {
if ((cur[i][j] & 4) != 0 && (cur[i][j + 1] & 1) != 0) {
int a = uf.find(id(i, j));
int b = uf.find(id(i, j + 1));
if (a == b) {
tree[a] = 0;
} else {
char t = tree[a] && tree[b];
uf.unite(a, b);
int r = uf.find(a);
tree[r] = t;
}
}
}
}
}
int max_tree = -1;
int max_size = -1;
for (long long i = 0; i < N; i++) {
for (long long j = 0; j < N; j++) {
if (cur[i][j] != 0) {
int r = uf.find(id(i, j));
if (tree[r]) {
int sz = uf.size(id(i, j));
if (sz > max_size) {
max_size = sz;
max_tree = id(i, j);
}
}
}
}
}
long long sizeLargest = (max_tree == -1) ? 0LL : (long long)uf.size(max_tree);
long long totalTiles = N * N - 1;
long long score;
if (sizeLargest == totalTiles) {
double val = 500000.0 * (1.0 + (double)(T - turn) / (double)T);
score = llround(val);
} else {
double val = 500000.0 * (double)sizeLargest / (double)totalTiles;
score = llround(val);
}
return score;
}
int main(int argc, char* argv[]) {
registerTestlibCmd(argc, argv);
// No longer read argv[1] or argv[2]
long long score = compute_score(inf, ouf); // Pass testlib streams
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);
} |