Submission #1867820
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> const int MOD = 1000000007; int N, M, f[301][301][301]; std::vector < std::pair < int, int > > V[301]; inline void add(int &x, int y) { x = x + y < MOD ? x + y : x + y - MOD; } int main() { scanf("%d%d", &N, &M); while (M--) { int l, r, t; scanf("%d%d%d", &l, &r, &t); V[r].push_back({ l, t }); } f[0][0][0] = 1; for (int i = 0; i < N; i++) for (int j = 0; j <= i; j++) for (int k = j; k <= i; k++) { bool check = true; for (auto &e : V[i]) if (1 + (j >= e.first) + (k >= e.first) != e.second) check = false; if (check) { add(f[i + 1][j][k], f[i][j][k]); add(f[i + 1][j][i], f[i][j][k]); add(f[i + 1][k][i], f[i][j][k]); } } int O = 0; for (int i = 0; i <= N; i++) for (int j = 0; j <= N; j++) { bool check = true; for (auto &e : V[N]) if (1 + (i >= e.first) + (j >= e.first) != e.second) check = false; if (check) add(O, f[N][i][j]); } printf("%d\n", O); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - RGB Sequence |
User | NiroBC |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1076 Byte |
Status | AC |
Exec Time | 53 ms |
Memory | 104832 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13: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:17:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d", &l, &r, &t); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
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 | 49 ms | 104704 KB |
1_01.txt | AC | 43 ms | 104704 KB |
1_02.txt | AC | 45 ms | 104832 KB |
1_03.txt | AC | 50 ms | 104704 KB |
1_04.txt | AC | 50 ms | 104832 KB |
1_05.txt | AC | 43 ms | 104704 KB |
1_06.txt | AC | 45 ms | 104832 KB |
1_07.txt | AC | 44 ms | 104704 KB |
1_08.txt | AC | 50 ms | 104704 KB |
1_09.txt | AC | 45 ms | 104704 KB |
1_10.txt | AC | 44 ms | 104704 KB |
1_11.txt | AC | 44 ms | 104704 KB |
1_12.txt | AC | 46 ms | 102656 KB |
1_13.txt | AC | 46 ms | 104832 KB |
1_14.txt | AC | 46 ms | 104704 KB |
1_15.txt | AC | 52 ms | 104704 KB |
1_16.txt | AC | 51 ms | 104704 KB |
1_17.txt | AC | 44 ms | 104704 KB |
1_18.txt | AC | 48 ms | 104704 KB |
1_19.txt | AC | 47 ms | 104704 KB |
1_20.txt | AC | 49 ms | 104704 KB |
1_21.txt | AC | 46 ms | 104704 KB |
1_22.txt | AC | 50 ms | 104704 KB |
1_23.txt | AC | 51 ms | 104704 KB |
1_24.txt | AC | 50 ms | 104704 KB |
1_25.txt | AC | 47 ms | 104704 KB |
1_26.txt | AC | 49 ms | 102656 KB |
1_27.txt | AC | 49 ms | 104704 KB |
1_28.txt | AC | 52 ms | 104704 KB |
1_29.txt | AC | 49 ms | 104704 KB |
1_30.txt | AC | 51 ms | 104704 KB |
1_31.txt | AC | 50 ms | 102656 KB |
1_32.txt | AC | 49 ms | 104704 KB |
1_33.txt | AC | 49 ms | 104832 KB |
1_34.txt | AC | 51 ms | 102656 KB |
1_35.txt | AC | 51 ms | 104704 KB |
1_36.txt | AC | 45 ms | 100608 KB |
1_37.txt | AC | 50 ms | 104704 KB |
1_38.txt | AC | 53 ms | 104832 KB |
1_39.txt | AC | 50 ms | 104832 KB |
1_40.txt | AC | 53 ms | 104832 KB |
1_41.txt | AC | 38 ms | 104832 KB |
1_42.txt | AC | 37 ms | 104704 KB |