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
| #include <bits/stdc++.h> using namespace std;
typedef long long i64; const int mod = 233329, b = 17, inv = 54901; const int N = 305;
int n, a[N][N], p[N], h0[mod + 5], h1[mod + 5], ba[N];
int t[N];
int lowbit(int x) { return x & -x; } void add(int x, int k) { for (int i = x; i <= n; i += lowbit(i)) t[i] += k, t[i] %= mod; } int sum(int x) { int ans = 0; for (int i = x; i; i -= lowbit(i)) ans += t[i], ans %= mod; return ans; } int qry(int l, int r) { return l <= r ? ((sum(r) - sum(l - 1)) % mod + mod ) % mod : 0; }
int f[N], g[N], h[mod + 5];
bool check() { for (int i = 1; i <= n; i++) { h[i] = (h[i - 1] + ba[n - i] * 1ll * p[i] % mod) % mod; } memset(t, 0, sizeof t); for (int i = 1; i <= n; i++) { f[i] = qry(p[i] + 1, n); add(p[i], ba[n - i]); } memset(t, 0, sizeof t); for (int i = n; i >= 1; i--) { g[i] = qry(p[i] + 1, n); add(p[i], ba[n - i]); } auto dec = [](int a, int b) { return ((a - b) % mod + mod) % mod; }; memcpy(h1, h0, sizeof h1); for (int i = 1; i <= n; i++) { static int res = 0; res = (1ll * dec(h[i - 1], f[i]) * inv % mod + dec(dec(h[n], h[i]), g[i])) % mod; if (!h1[res]) return 0; h1[res]--; } return 1; }
bool gen(int p1) { for (int i = 1; i <= n; i++) { p[1] = p1; for (int j = 1; j < n; j++) p[j + 1] = a[i][j] + (a[i][j] >= p1); if (check()) return 1; } return 0; }
void solve() { scanf("%d", &n); memset(h0, 0, sizeof h0); for (int i = 1; i <= n; i++) { for (int j = 1; j < n; j++) scanf("%d", &a[i][j]); int res = 0; for (int j = 1; j < n; j++) res = (res * 1ll * b % mod + a[i][j]) % mod; h0[res]++; } static bool pd[N]; memset(pd, 0, sizeof pd); for (int i = 1; i <= n; i++) if (!pd[a[i][1]]) { pd[a[i][1]] = 1; if (gen(a[i][1])) { for (int i = 1; i <= n; i++) printf("%d ", p[i]); return printf("\n"), void(0); } } if (gen(n)) { for (int i = 1; i <= n; i++) printf("%d ", p[i]); return printf("\n"), void(0); } }
int main() { ba[0] = 1; for (int i = 1; i < N; i++) ba[i] = ba[i - 1] * b % mod; int T; scanf("%d", &T); while (T--) solve(); return 0; }
|