Submission #1866789


Source Code Expand

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

const int N = 305;
const int md = 1e9 + 7;

int n, m;
vector < pair<int,int> > seg[N];
int dp[N][N][N];

void add(int &x, int y) { x += y; while(x >= md) x -= md; if (x < 0) x += md; }

bool check(int i, int j, int k) {
	for (auto segment : seg[i]) {
		int lef = segment.first; // left point
		int dif = segment.second; // different colors
		int cnt = (i >= lef) + (j >= lef) + (k >= lef);
		if (cnt != dif) return false;
	}
	return true;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		int l, r, x; cin >> l >> r >> x;
		seg[r].push_back(make_pair(l, x));
	}
	dp[0][0][0] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < i; ++j) {
			for (int k = 0; k <= j; ++k) {
				if (!dp[i-1][j][k]) continue;
				int nj, nk;
				// i-1
				if (check(i, j, k)) add(dp[i][j][k], dp[i-1][j][k]);
				// j
				if (check(i, i-1, k)) add(dp[i][i-1][k], dp[i-1][j][k]);
				// k
				if (check(i, i-1, j)) add(dp[i][i-1][j], dp[i-1][j][k]);
			}
		}
	}	

	int ans = 0;
	for (int j = 0; j < n; ++j) {
		for (int k = 0; k <= j; ++k) {
			add(ans, dp[n][j][k]);
		}
	}
	printf("%lld\n", ans);
}

Submission Info

Submission Time
Task E - RGB Sequence
User cheater2k
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1248 Byte
Status AC
Exec Time 112 ms
Memory 108928 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:22: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘int’ [-Wformat=]
  printf("%lld\n", ans);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 47
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 2 ms 2304 KB
1_00.txt AC 39 ms 106880 KB
1_01.txt AC 39 ms 108928 KB
1_02.txt AC 39 ms 108800 KB
1_03.txt AC 29 ms 72064 KB
1_04.txt AC 41 ms 108928 KB
1_05.txt AC 38 ms 106880 KB
1_06.txt AC 39 ms 108800 KB
1_07.txt AC 14 ms 24960 KB
1_08.txt AC 39 ms 106880 KB
1_09.txt AC 39 ms 108928 KB
1_10.txt AC 39 ms 106880 KB
1_11.txt AC 11 ms 16768 KB
1_12.txt AC 38 ms 104832 KB
1_13.txt AC 39 ms 108928 KB
1_14.txt AC 39 ms 106880 KB
1_15.txt AC 35 ms 92544 KB
1_16.txt AC 41 ms 108928 KB
1_17.txt AC 39 ms 108928 KB
1_18.txt AC 38 ms 106880 KB
1_19.txt AC 27 ms 67968 KB
1_20.txt AC 39 ms 106880 KB
1_21.txt AC 39 ms 108928 KB
1_22.txt AC 40 ms 108928 KB
1_23.txt AC 38 ms 104832 KB
1_24.txt AC 39 ms 108928 KB
1_25.txt AC 39 ms 108928 KB
1_26.txt AC 38 ms 104704 KB
1_27.txt AC 16 ms 33024 KB
1_28.txt AC 39 ms 108928 KB
1_29.txt AC 39 ms 108928 KB
1_30.txt AC 38 ms 106752 KB
1_31.txt AC 37 ms 102784 KB
1_32.txt AC 39 ms 108928 KB
1_33.txt AC 39 ms 108928 KB
1_34.txt AC 38 ms 106880 KB
1_35.txt AC 38 ms 104704 KB
1_36.txt AC 37 ms 104832 KB
1_37.txt AC 38 ms 106880 KB
1_38.txt AC 39 ms 108928 KB
1_39.txt AC 28 ms 72064 KB
1_40.txt AC 112 ms 108928 KB
1_41.txt AC 39 ms 108800 KB
1_42.txt AC 39 ms 108800 KB