Submission #1482395


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> P;

const int maxn = 309;
const int MOD = 1000000007;
int f[maxn][maxn][maxn];
vector<P> q[maxn];
int n, m, l, r, x, p, ans;

bool check(int r, int R, int G, int B){
	int l, x, cnt;
	for (int i=q[r].size()-1; i>=0; i--){
		l = q[r][i].first; x = q[r][i].second;
		cnt = (l <= R);
		cnt += (l <= G);
		cnt += (l <= B);
		if (cnt != x) return false;
	}
	return true;
}

int main(){
	scanf("%d%d", &n, &m);
	for (int i=1; i<=m; i++){
		scanf("%d%d%d", &l, &r, &x);
		q[r].push_back(make_pair(l, x));
	}
	f[0][0][0] = 1;
	for (int i=0; i<=n; i++)
		for (int j=0; j<=n; j++)
			for (int k=0; k<=n; k++){
				p = max(i, max(j, k));
				if (!check(p, i, j, k)) continue;
				if (p == n) ans = (ans + f[i][j][k]) % MOD;
				f[p+1][j][k] = (f[p+1][j][k] + f[i][j][k]) % MOD;
				f[i][p+1][k] = (f[i][p+1][k] + f[i][j][k]) % MOD;
				f[i][j][p+1] = (f[i][j][p+1] + f[i][j][k]) % MOD;
			}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task E - RGB Sequence
User Cyanic
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1072 Byte
Status AC
Exec Time 395 ms
Memory 114944 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:29:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &l, &r, &x);
                              ^

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 2432 KB
1_00.txt AC 281 ms 112640 KB
1_01.txt AC 226 ms 112768 KB
1_02.txt AC 273 ms 114944 KB
1_03.txt AC 276 ms 112768 KB
1_04.txt AC 296 ms 114816 KB
1_05.txt AC 227 ms 112768 KB
1_06.txt AC 271 ms 114944 KB
1_07.txt AC 235 ms 112768 KB
1_08.txt AC 291 ms 112768 KB
1_09.txt AC 254 ms 112896 KB
1_10.txt AC 256 ms 112768 KB
1_11.txt AC 242 ms 112768 KB
1_12.txt AC 222 ms 108672 KB
1_13.txt AC 260 ms 114944 KB
1_14.txt AC 266 ms 112896 KB
1_15.txt AC 315 ms 112768 KB
1_16.txt AC 291 ms 112768 KB
1_17.txt AC 235 ms 114944 KB
1_18.txt AC 318 ms 112768 KB
1_19.txt AC 304 ms 112896 KB
1_20.txt AC 282 ms 112768 KB
1_21.txt AC 275 ms 114944 KB
1_22.txt AC 340 ms 112896 KB
1_23.txt AC 300 ms 112768 KB
1_24.txt AC 249 ms 112896 KB
1_25.txt AC 290 ms 114944 KB
1_26.txt AC 329 ms 110720 KB
1_27.txt AC 340 ms 112896 KB
1_28.txt AC 321 ms 112768 KB
1_29.txt AC 333 ms 112896 KB
1_30.txt AC 361 ms 112768 KB
1_31.txt AC 298 ms 110720 KB
1_32.txt AC 231 ms 112768 KB
1_33.txt AC 333 ms 114944 KB
1_34.txt AC 365 ms 110720 KB
1_35.txt AC 365 ms 112896 KB
1_36.txt AC 201 ms 108800 KB
1_37.txt AC 336 ms 112768 KB
1_38.txt AC 386 ms 114944 KB
1_39.txt AC 344 ms 114944 KB
1_40.txt AC 395 ms 114944 KB
1_41.txt AC 154 ms 114944 KB
1_42.txt AC 141 ms 112896 KB