結果
問題 |
No.3047 Verification of Sorting Network
|
ユーザー |
👑 |
提出日時 | 2025-05-14 18:35:33 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 698 ms / 2,000 ms |
コード長 | 5,243 bytes |
コンパイル時間 | 5,505 ms |
コンパイル使用メモリ | 293,392 KB |
実行使用メモリ | 6,272 KB |
最終ジャッジ日時 | 2025-05-14 18:36:12 |
合計ジャッジ時間 | 31,881 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
// origin: https://yukicoder.me/submissions/1041028 // O(M*2^n) + 1024bit並列高速化解 - CPU命令最適化 (x86-64-v3 -> x86-64-v2) #include <bits/stdc++.h> // all #pragma GCC optimize ("O3") #pragma GCC target ("arch=x86-64-v2,tune=native") using namespace std; #define MAX_T 1000 #define MAX_N 27 #define MAX_COST 1e8 using node_index = uint8_t; expected<vector<bool>, vector<bool>> is_sorting_network(const size_t n, const vector<pair<node_index, node_index>> cmps) { assert(2 <= n && n <= MAX_N && MAX_N <= UINT64_WIDTH && 10 <= MAX_N); assert(1 <= cmps.size()); for (auto [a, b] : cmps) { // 0-indexed assert(0 <= a && a < b && b < n); } size_t m = cmps.size(); vector<bool> unused(m, true), unsorted(n - 1, false); array<array<uint64_t, 16>, MAX_N> states; const uint64_t z = UINT64_MAX; const array<uint64_t, 6> lows = {0xaaaaaaaaaaaaaaaa, 0xcccccccccccccccc, 0xf0f0f0f0f0f0f0f0, 0xff00ff00ff00ff00, 0xffff0000ffff0000, 0xffffffff00000000}; uint64_t limit = 1ULL << (max(n, 10uz) - 10); for (uint64_t i = 0; i < limit; ++i) { for (size_t j = 0; auto x : lows) { states[j++].fill(x); } states[6] = { 0, z, 0, z, 0, z, 0, z, 0, z, 0, z, 0, z, 0, z }; states[7] = { 0, 0, z, z, 0, 0, z, z, 0, 0, z, z, 0, 0, z, z }; states[8] = { 0, 0, 0, 0, z, z, z, z, 0, 0, 0, 0, z, z, z, z }; states[9] = { 0, 0, 0, 0, 0, 0, 0, 0, z, z, z, z, z, z, z, z }; for (size_t j = 10; j < n; ++j) { states[j].fill(-((i >> (j - 10)) & 1)); } for (size_t j = 0; auto [a, b] : cmps) { array<uint64_t, 16> &va = states[a], &vb = states[b]; array<uint64_t, 16> &&na = { va[0] & vb[0], va[1] & vb[1], va[2] & vb[2], va[3] & vb[3], va[4] & vb[4], va[5] & vb[5], va[6] & vb[6], va[7] & vb[7], va[8] & vb[8], va[9] & vb[9], va[10] & vb[10], va[11] & vb[11], va[12] & vb[12], va[13] & vb[13], va[14] & vb[14], va[15] & vb[15] }; array<uint64_t, 16> &&nb = { va[0] | vb[0], va[1] | vb[1], va[2] | vb[2], va[3] | vb[3], va[4] | vb[4], va[5] | vb[5], va[6] | vb[6], va[7] | vb[7], va[8] | vb[8], va[9] | vb[9], va[10] | vb[10], va[11] | vb[11], va[12] | vb[12], va[13] | vb[13], va[14] | vb[14], va[15] | vb[15] }; if (va != na) { states[a] = na; states[b] = nb; unused[j] = false; } ++j; } for (size_t j = 1; j < n; ++j) { for (size_t k = 0; k < 16; ++k) { if ((states[j - 1][k] & ~states[j][k]) != 0) { unsorted[j - 1] = true; break; } } } } if (any_of(unsorted.begin(), unsorted.end(), [](bool x) { return x; })) { return unexpected(unsorted); } return unused; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); assert(MAX_N <= numeric_limits<node_index>::max()); size_t t; cin >> t; assert(1 <= t && t <= MAX_T); // phi = (1 + sqrt(5)) / 2 : golden ratio double phi = sqrt(1.25) + 0.5; // testcases cost <= 1e8 double cost = 0.0; for (size_t i = 0; i < t; ++i) { size_t n, m; cin >> n >> m; vector<pair<node_index, node_index>> cmps; vector<int> vec_a, vec_b; assert(2 <= n && n <= MAX_N && 1 <= m && m <= n * (n - 1) / 2); cost += m * pow(phi, n); assert(cost <= MAX_COST); for (size_t j = 0; j < m; ++j) { int a; cin >> a; vec_a.push_back(a); } for (size_t j = 0; j < m; ++j) { int b; cin >> b; vec_b.push_back(b); } for (size_t j = 0; j < m; ++j) { int a = vec_a[j], b = vec_b[j]; assert(1 <= a && a < b && b <= n); // 1-indexed to 0-indexed cmps.emplace_back(a - 1, b - 1); } auto is_sorting = is_sorting_network(n, cmps); if (is_sorting.has_value()) { auto unused = is_sorting.value(); assert(unused.size() == m); cout << "Yes\n"; cout << count(unused.begin(), unused.end(), true) << '\n'; bool first = true; // 1-indexed for (int j = 1; const auto x : unused) { if (x) { if (!first) { cout << ' '; } cout << j; first = false; } ++j; } cout << '\n'; } else { auto unsorted = is_sorting.error(); assert(unsorted.size() == n - 1); cout << "No\n"; cout << count(unsorted.begin(), unsorted.end(), true) << '\n'; bool first = true; // 1-indexed for (int j = 1; const auto x : unsorted) { if (x) { if (!first) { cout << ' '; } cout << j; first = false; } ++j; } cout << '\n'; } } return 0; }