Submission #1749255
Source Code Expand
#include <bits/stdc++.h> using namespace std; bool fp[5005][5005], fr[5005][5005]; int sr[5005][5005]; int n, k, a[5005], an; int main(){ scanf("%d%d",&n,&k); for(int i = 1; i <= n; ++i) scanf("%d",&a[i]), a[i] = min(a[i], k); fp[0][0] = 1; for(int i = 0; i < n; ++i){ for(int j = 0; j <= k; ++j){ fp[i + 1][j] |= fp[i][j]; fp[i + 1][min(j + a[i + 1], k)] |= fp[i][j]; } } fr[n + 1][0] = 1; for(int i = n + 1; i > 1; --i){ for(int j = k; j >= 0; --j){ fr[i - 1][j] |= fr[i][j]; fr[i - 1][min(j + a[i - 1], k)] |= fr[i][j]; } } for(int i = 1; i <= n + 1; ++i){ sr[i][0] = 1; for(int j = 1; j <= k; ++j) sr[i][j] = sr[i][j - 1] + fr[i][j]; } an = n; for(int i = 1; i <= n; ++i){ bool ok = 0; for(int j = 0; j < k; ++j){ int l = k - a[i] - j, r = k - 1 - j; l = max(l, 0); ok |= (fp[i - 1][j] & (sr[i + 1][r] - (l ? sr[i + 1][l - 1] : 0) > 0)); } an -= ok; } printf("%d", an); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - NarrowRectangles |
User | Minology |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 989 Byte |
Status | RE |
Exec Time | 2103 ms |
Memory | 26240 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&k); ^ ./Main.cpp:11:68: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 1; i <= n; ++i) scanf("%d",&a[i]), a[i] = min(a[i], k); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 700 | ||||||||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt |
Subtask | 0_000, 0_001, 0_004, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 2_018.txt, 2_019.txt, 2_020.txt, 2_021.txt, 2_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | WA | 2 ms | 4352 KB |
0_001.txt | AC | 2 ms | 4352 KB |
0_002.txt | RE | 99 ms | 2304 KB |
0_003.txt | WA | 8 ms | 4864 KB |
0_004.txt | AC | 2 ms | 4352 KB |
1_005.txt | WA | 4 ms | 14976 KB |
1_006.txt | WA | 4 ms | 14976 KB |
1_007.txt | AC | 4 ms | 14976 KB |
1_008.txt | WA | 5 ms | 14976 KB |
1_009.txt | WA | 5 ms | 14976 KB |
1_010.txt | WA | 5 ms | 15104 KB |
1_011.txt | WA | 4 ms | 14976 KB |
1_012.txt | WA | 5 ms | 14976 KB |
1_013.txt | WA | 5 ms | 14976 KB |
1_014.txt | WA | 5 ms | 15104 KB |
1_015.txt | WA | 5 ms | 14976 KB |
1_016.txt | WA | 6 ms | 15104 KB |
1_017.txt | WA | 6 ms | 15104 KB |
2_018.txt | WA | 3 ms | 4352 KB |
2_019.txt | WA | 2 ms | 4352 KB |
2_020.txt | RE | 150 ms | 26240 KB |
2_021.txt | RE | 1291 ms | 16640 KB |
2_022.txt | TLE | 2103 ms | 22784 KB |
2_023.txt | TLE | 2103 ms | 22784 KB |
2_024.txt | TLE | 2103 ms | 22784 KB |
2_025.txt | TLE | 2103 ms | 22784 KB |
2_026.txt | TLE | 2103 ms | 22784 KB |
2_027.txt | TLE | 2103 ms | 22784 KB |
2_028.txt | TLE | 2103 ms | 22784 KB |
2_029.txt | TLE | 2103 ms | 22784 KB |
2_030.txt | TLE | 2103 ms | 22784 KB |
2_031.txt | TLE | 2103 ms | 22784 KB |
2_032.txt | TLE | 2103 ms | 22784 KB |
2_033.txt | TLE | 2103 ms | 22784 KB |
2_034.txt | TLE | 2103 ms | 22784 KB |
2_035.txt | TLE | 2103 ms | 22784 KB |
2_036.txt | RE | 100 ms | 2304 KB |