結果
問題 | No.1421 国勢調査 (Hard) |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:58:41 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 219 ms / 2,000 ms |
コード長 | 3,533 bytes |
コンパイル時間 | 7,236 ms |
コンパイル使用メモリ | 182,496 KB |
最終ジャッジ日時 | 2025-01-19 11:51:26 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#pragma GCC optimize("Ofast")#pragma GCC target("ssse3")#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cmath>#include <vector>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <queue>#include <ctime>#include <cassert>#include <complex>#include <string>#include <cstring>#include <chrono>#include <random>#include <bitset>#include <fstream>using namespace std;#define ii pair <int, int>#define app push_back#define all(a) a.begin(), a.end()#define bp __builtin_popcountll#define ll long long#define mp make_pair#define x first#define y second#define Time (double)clock()/CLOCKS_PER_SEC#define debug(x) std::cerr << #x << ": " << x << '\n';#define FOR(i, n) for (int i = 0; i < n; ++i)#define pb push_back#define trav(a, x) for (auto& a : x)using vi = vector<int>;template <typename T>std::ostream& operator <<(std::ostream& output, const pair <T, T> & data){output << "(" << data.x << "," << data.y << ")";return output;}template <typename T>std::ostream& operator <<(std::ostream& output, const std::vector<T>& data){for (const T& x : data)output << x << " ";return output;}ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded upll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded downll math_mod(ll a, ll b) { return a - b * div_down(a, b); }#define tcT template<class T#define tcTU tcT, class UtcT> using V = vector<T>;tcT> void re(V<T>& x) {trav(a, x)cin >> a;}tcT> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;} // set a = min(a,b)tcT> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}ll gcd(ll a, ll b) {while (b) {tie(a, b) = mp(b, a % b);}return a;}const int N = 57;int gauss (vector < bitset<N> > a, int n, int m, bitset<N> & ans) {vector<int> where (m, -1);for (int col=0, row=0; col<m && row<n; ++col) {for (int i=row; i<n; ++i)if (a[i][col]) {swap (a[i], a[row]);break;}if (! a[row][col])continue;where[col] = row;for (int i=0; i<n; ++i)if (i != row && a[i][col])a[i] ^= a[row];++row;}for (int i=0; i<m; ++i)if (where[i] != -1)ans[i] = a[where[i]][m];for (int i=0; i<n; ++i) {int sum = 0;for (int j=0; j<m; ++j)sum ^= ans[j] * a[i][j];if (sum != a[i][m]) {cout << -1 << endl;exit(0);}}for (int i=0; i<m; ++i)if (where[i] == -1)return 2;return 1;}V <bitset <N> > a;vi who[10001];int sum[10001];signed main() {#ifdef ONLINE_JUDGE#define endl '\n'ios_base::sync_with_stdio(0); cin.tie(0);#endifint n, m;cin >> n >> m;FOR (i, m) {int k;cin >> k;who[i].resize(k);re(who[i]);trav (e, who[i])e--;cin >> sum[i];bitset <N> add;trav (e, who[i]) {add[e] = 1;}a.app(add);}vi ans(n);FOR (bit, 30) {FOR (i, m) {a[i][n] = (sum[i] >> bit)&1;}bitset <N> b;gauss(a, a.size(), n, b);FOR (i, n)if (b[i])ans[i] += 1 << bit;}trav (e, ans)cout << e << endl;}