結果
| 問題 | No.1421 国勢調査 (Hard) |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2021-03-06 04:13:06 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 233 ms / 2,000 ms |
| コード長 | 7,951 bytes |
| コンパイル時間 | 2,502 ms |
| コンパイル使用メモリ | 213,388 KB |
| 最終ジャッジ日時 | 2025-01-19 12:17:41 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};template<typename T>void debug(T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}template<typename T>void rearrange(vector<int>&ord, vector<T>&v){auto tmp = v;for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];}template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){rearrange(ord, head);rearrange(ord, tail...);}template<typename T> vector<int> ascend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});return ord;}template<typename T> vector<int> descend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});return ord;}ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};template< typename T = int >struct edge {int to;T cost;int id;edge() = default;edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}operator int() const { return to; }};template<typename T>using Graph = vector<vector<edge<T>>>;template<typename T>Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){Graph<T> ret(n);for(int es = 0; es < m; es++){int u,v,w=1;cin>>u>>v;u-=indexed,v-=indexed;if(weighted)cin>>w;ret[u].emplace_back(v,w,es);if(!directed)ret[v].emplace_back(u,w,es);}return ret;}template<typename T>Graph<T> readParent(int n,int indexed=1,bool directed=true){Graph<T>ret(n);for(int i=1;i<n;i++){int p;cin>>p;p-=indexed;ret[p].emplace_back(i);if(!directed)ret[i].emplace_back(p);}return ret;}const ll MAX_W=52;struct BitMatrix {ll h,w;vector<bitset<MAX_W>>A;BitMatrix() {};BitMatrix(ll n, ll m) :h(n),w(m){A.assign(h,bitset<MAX_W>(0));};BitMatrix(vector<vector<ll>>v):h(v.size()),w(v[0].size()){A.assign(h,bitset<MAX_W>(0));for(ll i=0;i<h;i++)for(ll j=0;j<w;j++)A[i][j]=(v[i][j]&1);}ll height() {return h;}ll width() {return w;}static BitMatrix I(size_t n) {BitMatrix mat(n,n);for(int i = 0; i < n; i++) mat[i][i] = 1;return (mat);}inline bitset<MAX_W> &operator[](ll k) {return A[k];}inline bitset<MAX_W> operator[](ll k) const{return A[k];}friend ostream &operator<<(ostream &os, BitMatrix &p) {ll n = p.height(), m = p.width();for(ll i = 0; i < n; i++) {os << "[";for(ll j = 0; j < m; j++) {os << p[i][j] << (j + 1 == m ? "]\n" : ",");}}return (os);}BitMatrix &operator*=(const BitMatrix &B){BitMatrix C(h,B.w);for(int i = 0; i < h; i++){for(int j = 0; j < w; j++){if(this->A[i][j])C[i] |= B[j];}}A.swap(C.A);return (*this);}BitMatrix operator*(BitMatrix &B) const {return (BitMatrix(*this) *= B);}BitMatrix &operator^=(long long k) {BitMatrix B = BitMatrix::I(height());while(k > 0) {if(k & 1) B *= *this;*this *= *this;k >>= 1LL;}A.swap(B.A);return (*this);}BitMatrix operator^(const long long k) const {return (BitMatrix(*this) ^= k);}};ll sweep(BitMatrix &a, bool is_extended){ll h = a.height(), w = a.width();ll rank = 0;ll limit = w - is_extended;for(ll col=0;col<limit;col++){ll pivot = -1;for(ll row=rank;row<h;row++){if(a[row][col]){pivot=row;break;}}if(pivot==-1)continue;auto tmp=a[pivot][col];swap(a[pivot],a[rank]);for(ll row=0;row<h;row++){if(row!=rank&&a[row][col]!=0){a[row]^=a[rank];}}rank++;}return rank;}vector<bool>linear_equation(BitMatrix a){ll h=a.height(),w=a.width();ll rank = sweep(a,true);vector<bool>ret;for(ll row=rank;row<h;row++)if(a[row][w-1])return ret;ret.assign(w-1,0);for(ll i=0;i<rank;i++){for(ll j=0;j<w-1;j++){if(a[i][j]){ret[j]=a[i][w-1];break;}}}return ret;}vector<vector<bool>>kernel(BitMatrix a){ll h=a.height(),w=a.width();ll rank = sweep(a,true);vector<ll>cols(w-1,0),piv;for(ll i=0;i<h;i++)for(ll j=0;j<w-1;j++){if(a[i][j]==1){cols[j]=1;piv.push_back(j);break;}}vector<vector<bool>>ret;for(ll i=0;i<w-1;i++){if(cols[i])continue;vector<bool>v(w-1);v[i]=true;for(ll j=0;j<piv.size();j++)v[piv[j]]=a[j][i];ret.push_back(v);}return ret;}int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n,m;cin>>n>>m;vector<ll>y(m);vector<vector<ll>>b(m);rep(i,0,m){ll a;cin>>a;while(a--){ll bx;cin>>bx;bx--;b[i].PB(bx);}cin>>y[i];}vector<ll>ret(n);rep(i,0,30){BitMatrix mat(m,n+1);rep(j,0,m){for(auto z:b[j])mat[j][z]=1;mat[j][n]=y[j]>>i&1;}auto tmp=linear_equation(mat);if(tmp.empty())judge=false;else rep(j,0,n)if(tmp[j])ret[j]^=1<<i;}if(judge)rep(i,0,n)cout<<ret[i]<<endl;else cout<<-1<<endl;return 0;}