Submission #24939130

---

Source Code Expand

#include "bits/stdc++.h"

#define int long long

using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
int N, Q;
int x[55], y[55], z[55], w[55];

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> N >> Q;
	for (int i = 0; i < Q; i++) {
		cin >> x[i] >> y[i] >> z[i] >> w[i]; x[i]--; y[i]--; z[i]--;
	}
	mint ans = 1;
	for (int i = 0; i < 60; i++) {
		mint cnt = 0;
		for (int bit = 0; bit < (1 << N); bit++) {
			vector<int>now(N);
			for (int j = 0; j < N; j++) {
				if (bit & (1LL << j)) {
					now[j] = 1;
				}
			}
			bool ok = true;
			for (int j = 0; j < Q; j++) {
				int t = now[x[j]];
				t |= now[y[j]];
				t |= now[z[j]];
				int t2 = (int)(w[j] & (1LL << i));
				if (t2)t2 = 1;
				if (t != t2)ok = false;
				
			}
			if (ok) {
				cnt += 1;
			}
		}
		ans *= cnt;
	}
	cout << ans << endl;
	return 0;


}

Submission Info

Judge Result