Submission #1709953


Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
ll dp[52][101][101];
int main()
{
	int num;
	scanf("%d", &num);
	vector<int>v;
	for (int i = 0; i < num + num - 1; i++)
	{
		int z;
		scanf("%d", &z);
		v.push_back(z);
	}
	sort(v.begin(), v.end());
	dp[1][1][0] = 1;
	for (int i = 1; i < num; i++)
	{
		int a1 = int(v[num - 1 - i] != v[num - i]), a2 = int(v[num - 1 + i] != v[num - 2 + i]);
		for (int j = 1; j <= i + i - 1; j++)
		{
			for (int k = 0; k < j; k++)
			{
				for (int l = 0; l < k + a1; l++)
				{
					dp[i + 1][j + a1 + a2 - (k + a1 - l - 1)][l] += dp[i][j][k];
					dp[i + 1][j + a1 + a2 - (k + a1 - l - 1)][l] %= mod;
				}
				dp[i + 1][j + a1 + a2][k + a1] += dp[i][j][k];
				dp[i + 1][j + a1 + a2][k + a1] %= mod;
				for (int l = k + a1 + 1; l < j + a1 + a2; l++)
				{
					dp[i + 1][j + a1 + a2 - (l - 1 - k - a1)][k + a1 + 1] += dp[i][j][k];
					dp[i + 1][j + a1 + a2 - (l - 1 - k - a1)][k + a1 + 1] %= mod;
				}
			}
		}
	}
	ll ans = 0;
	for (int i = 0; i <= num + num - 1; i++)
	{
		for (int j = 0; j < i; j++)
		{
			ans = (ans + dp[num][i][j]) % mod;
		}
	}
	printf("%lld\n", ans);
}

Submission Info

Submission Time
Task F - Prefix Median
User DEGwer
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1236 Byte
Status AC
Exec Time 47 ms
Memory 2816 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &num);
                   ^
./Main.cpp:16:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &z);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 2000 / 2000
Status
AC × 3
AC × 54
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 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 2 ms 384 KB
01.txt AC 47 ms 2816 KB
02.txt AC 34 ms 2816 KB
03.txt AC 7 ms 2816 KB
04.txt AC 4 ms 640 KB
05.txt AC 2 ms 512 KB
06.txt AC 17 ms 2816 KB
07.txt AC 47 ms 2816 KB
08.txt AC 2 ms 512 KB
09.txt AC 47 ms 2816 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 384 KB
12.txt AC 2 ms 512 KB
13.txt AC 13 ms 2816 KB
14.txt AC 22 ms 2816 KB
15.txt AC 1 ms 256 KB
16.txt AC 47 ms 2816 KB
17.txt AC 2 ms 384 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 2 ms 384 KB
21.txt AC 2 ms 384 KB
22.txt AC 1 ms 256 KB
23.txt AC 6 ms 2816 KB
24.txt AC 2 ms 512 KB
25.txt AC 6 ms 2816 KB
26.txt AC 8 ms 2816 KB
27.txt AC 2 ms 512 KB
28.txt AC 40 ms 2816 KB
29.txt AC 3 ms 640 KB
30.txt AC 8 ms 2816 KB
31.txt AC 1 ms 256 KB
32.txt AC 7 ms 2816 KB
33.txt AC 1 ms 256 KB
34.txt AC 5 ms 2816 KB
35.txt AC 34 ms 2816 KB
36.txt AC 1 ms 256 KB
37.txt AC 34 ms 2816 KB
38.txt AC 7 ms 2816 KB
39.txt AC 4 ms 640 KB
40.txt AC 2 ms 512 KB
41.txt AC 16 ms 2816 KB
42.txt AC 46 ms 2816 KB
43.txt AC 2 ms 512 KB
44.txt AC 46 ms 2816 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 384 KB
47.txt AC 2 ms 512 KB
48.txt AC 13 ms 2816 KB
49.txt AC 22 ms 2816 KB
50.txt AC 1 ms 256 KB
51.txt AC 45 ms 2816 KB