Submission #3043717

---

Source Code Expand

/************************************************
 * Au: Hany01
 * Date: Aug 19th, 2018
 * Prob: AGC017F Zigzag
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
	static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 21, maxs = 1 << 20, maxk = maxn * maxn, MOD = 1e9 + 7;

struct Limits { int a, b, c; }lmt[maxk];
inline bool operator < (Limits A, Limits B) { return A.a < B.a; }

int n, m, k, f[2][maxn][maxs], all, cur, Ans, t, nex[maxn][maxs];

inline void ad(int& x, int y) { if ((x += y) >= MOD) x -= MOD; }

int main()
{
#ifdef hany01
	freopen("agc017f.in", "r", stdin);
	freopen("agc017f.out", "w", stdout);
#endif

	n = read() - 1, m = read(), k = read();
	For(i, 1, k) lmt[i].a = read(), lmt[i].b = read(), lmt[i].c = read();
	sort(lmt + 1, lmt + 1 + k);

	f[0][n][0] = 1, all = 1 << n, cur = 1, t = 0;

	Set(nex, -1);
	rep(j, n) rep(S, all)
		For(k, j, n - 1) if (S >> k & 1) { nex[j][S] = k; break; }

	For(i, 1, m) {
		t ^= 1, Set(f[t], 0);
		rep(j, all) f[t][0][j] = f[t ^ 1][n][j];
		For(j, 1, n) rep(S, all) {
			ad(f[t][j][S], f[t][j - 1][S]);
			if (!(S >> (j - 1) & 1)) {
				int nS = S | (1 << (j - 1));
				if (nex[j][S] >= 0) nS ^= (1 << nex[j][S]);
				ad(f[t][j][nS], f[t][j - 1][S]);
			}
		}
		while (cur <= k && lmt[cur].a == i) {
			rep(S, all) if ((S ^ ((lmt[cur].c) << (lmt[cur].b - 1))) & (1 << (lmt[cur].b - 1))) f[t][n][S] = 0;
			++ cur;
		}
	}

	rep(S, all) ad(Ans, f[t][n][S]);
	printf("%d\n", Ans);

	return 0;
}

Submission Info

Judge Result