Submission #1670625
Source Code Expand
#include <cstdio> #include <algorithm> const long long MOD = 1000000007; int a[100], N; long long f[51][100][100], O; inline void add(long long &x, long long y) { x = x + y < MOD ? x + y : x + y - MOD; } int main() { scanf("%d", &N); for (int i = 1; i < N + N; i++) scanf("%d", a + i); std::sort(a + 1, a + N + N); f[1][0][0] = 1; for (int i = 2; i <= N; i++) { int last = a[N + i - 2] - a[N - i + 2]; for (int j = 0; j <= last; j++) for (int k = 0; j + k <= last; k++) { int L = j + (a[N + i - 1] != a[N + i - 2]), R = k + (a[N - i + 1] != a[N - i + 2]); for (int u = 1; u <= L; u++) add(f[i][L - u][R + 1], f[i - 1][j][k]); for (int u = 1; u <= R; u++) add(f[i][L + 1][R - u], f[i - 1][j][k]); add(f[i][L][R], f[i - 1][j][k]); } } for (int i = 0; i <= N + N - 2; i++) for (int j = 0; i + j <= N + N - 2; j++) add(O, f[N][i][j]); printf("%lld\n", O); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Prefix Median |
User | NiroBC |
Language | C++14 (GCC 5.4.1) |
Score | 2000 |
Code Size | 957 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 2432 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:14:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", a + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 2000 / 2000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 128 KB |
00_example_02.txt | AC | 1 ms | 128 KB |
00_example_03.txt | AC | 1 ms | 384 KB |
01.txt | AC | 9 ms | 2304 KB |
02.txt | AC | 7 ms | 1920 KB |
03.txt | AC | 2 ms | 896 KB |
04.txt | AC | 1 ms | 640 KB |
05.txt | AC | 1 ms | 512 KB |
06.txt | AC | 4 ms | 1408 KB |
07.txt | AC | 9 ms | 2304 KB |
08.txt | AC | 1 ms | 512 KB |
09.txt | AC | 10 ms | 2304 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 384 KB |
13.txt | AC | 3 ms | 1280 KB |
14.txt | AC | 5 ms | 1664 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 10 ms | 2432 KB |
17.txt | AC | 1 ms | 384 KB |
18.txt | AC | 1 ms | 128 KB |
19.txt | AC | 1 ms | 128 KB |
20.txt | AC | 1 ms | 384 KB |
21.txt | AC | 1 ms | 384 KB |
22.txt | AC | 1 ms | 128 KB |
23.txt | AC | 2 ms | 768 KB |
24.txt | AC | 1 ms | 384 KB |
25.txt | AC | 2 ms | 896 KB |
26.txt | AC | 2 ms | 896 KB |
27.txt | AC | 1 ms | 384 KB |
28.txt | AC | 9 ms | 2176 KB |
29.txt | AC | 1 ms | 640 KB |
30.txt | AC | 2 ms | 896 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 2 ms | 896 KB |
33.txt | AC | 1 ms | 128 KB |
34.txt | AC | 2 ms | 768 KB |
35.txt | AC | 6 ms | 1792 KB |
36.txt | AC | 1 ms | 128 KB |
37.txt | AC | 9 ms | 2176 KB |
38.txt | AC | 3 ms | 1024 KB |
39.txt | AC | 1 ms | 640 KB |
40.txt | AC | 1 ms | 512 KB |
41.txt | AC | 5 ms | 1536 KB |
42.txt | AC | 10 ms | 2432 KB |
43.txt | AC | 1 ms | 512 KB |
44.txt | AC | 11 ms | 2432 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 512 KB |
48.txt | AC | 3 ms | 1280 KB |
49.txt | AC | 6 ms | 1792 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 384 KB |