Submission #2094300

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

const ll MOD = 1000000007;
const int MN = 310;

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

ll dp[MN][MN][MN];
vector<pii> cond[MN];

bool ok(int r, int i, int j, int k)
{
	bool ok = 1;

	for (pii c : cond[r]) {
		int cnt = 0;
		if (i-1 >= c.fi) {
			++cnt;
		}
		if (j-1 >= c.fi) {
			++cnt;
		}
		if (k-1 >= c.fi) {
			++cnt;
		}
		if (cnt != c.se) {
			return false;
		}
	}
	return true;
}

int main() {
	int N, M;
	cin >> N >> M;

	rep(i, M) {
		int l, r, x;
		cin >> l >> r >> x;
		--l; --r;
		cond[r].eb(l, x);
	}

	dp[0][0][0] = 1;
	ll ret = 0;

	rep(i, N+1) {
		rep(j, N+1) {
			rep(k, N+1) {
				int nx = max({i, j, k});
				if (nx == N) {
					add(ret, dp[i][j][k]);
					continue;
				}

				if (ok(nx, nx+1, j, k)) {
					add(dp[nx+1][j][k], dp[i][j][k]);
				}

				if (ok(nx, i, nx+1, k)) {
					add(dp[i][nx+1][k], dp[i][j][k]);
				}

				if (ok(nx, i, j, nx+1)) {
					add(dp[i][j][nx+1], dp[i][j][k]);
				}				
			}
		}
	}

	cout << ret << endl;

	return 0;
}

Submission Info

Judge Result