Submission #1800881


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

typedef long long LL;

const int oo = 0x3f3f3f3f;

const int Mod = 1e9 + 7;

const int maxn = 110;

int n, step;
int a[maxn + 5];

int dp[maxn + 5][maxn + 5][maxn + 5];

int main()
{
#ifdef matthew99
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	scanf("%d", &n), step = n, n = (n << 1) - 1;
	REP(i, 0, n) scanf("%d", a + i);
	sort(a, a + n);
	dp[0][1][0] = 1;
	int mid = n >> 1;
	REP(i, 0, step) 
	{
		if (i)
		{
			static int nxt[maxn + 5][maxn + 5];
			if (a[mid + i] != a[mid + i - 1])
			{
				memset(nxt, 0, sizeof nxt);
				REP(j, 1, n + 1) REP(k, 0, j)
					if (dp[i][j][k])
					{
						nxt[j + 1][k] = dp[i][j][k];
					}
				memcpy(dp[i], nxt, sizeof dp[i]);
			}
			if (a[mid - i] != a[mid - i + 1])
			{
				memset(nxt, 0, sizeof nxt);
				REP(j, 1, n + 1) REP(k, 0, j)
					if (dp[i][j][k])
					{
						nxt[j + 1][k + 1] = dp[i][j][k];
					}
				memcpy(dp[i], nxt, sizeof dp[i]);
			}
		}
		REP(j, 1, n + 1) REP(k, 0, j) if (dp[i][j][k]) REP(l, 0, j)
		{
			if (l < k)
			{
				(dp[i + 1][j - (k - l - 1)][l] += dp[i][j][k]) %= Mod;
			}
			else if (l == k)
			{
				(dp[i + 1][j][l] += dp[i][j][k]) %= Mod;
			}
			else if (l > k)
			{
				(dp[i + 1][j - (l - k - 1)][k + 1] += dp[i][j][k]) %= Mod;
			}
		}
	}
	int ans = 0;
	REP(i, 0, n + 1) REP(j, 0, i) (ans += dp[step][i][j]) %= Mod;
	(ans += Mod) %= Mod;
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task F - Prefix Median
User matthew99
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1982 Byte
Status AC
Exec Time 16 ms
Memory 4352 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n), step = n, n = (n << 1) - 1;
                                             ^
./Main.cpp:37:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, 0, n) scanf("%d", a + i);
                                 ^

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 384 KB
00_example_02.txt AC 1 ms 384 KB
00_example_03.txt AC 2 ms 896 KB
01.txt AC 16 ms 4352 KB
02.txt AC 13 ms 4352 KB
03.txt AC 4 ms 1792 KB
04.txt AC 3 ms 1408 KB
05.txt AC 2 ms 1280 KB
06.txt AC 7 ms 2304 KB
07.txt AC 16 ms 4352 KB
08.txt AC 2 ms 1280 KB
09.txt AC 16 ms 4352 KB
10.txt AC 1 ms 512 KB
11.txt AC 2 ms 896 KB
12.txt AC 2 ms 1152 KB
13.txt AC 6 ms 2048 KB
14.txt AC 9 ms 4352 KB
15.txt AC 1 ms 512 KB
16.txt AC 7 ms 4096 KB
17.txt AC 1 ms 640 KB
18.txt AC 1 ms 384 KB
19.txt AC 1 ms 256 KB
20.txt AC 2 ms 1024 KB
21.txt AC 2 ms 768 KB
22.txt AC 1 ms 512 KB
23.txt AC 2 ms 1536 KB
24.txt AC 2 ms 1024 KB
25.txt AC 2 ms 1536 KB
26.txt AC 3 ms 1792 KB
27.txt AC 2 ms 1024 KB
28.txt AC 7 ms 4096 KB
29.txt AC 2 ms 1280 KB
30.txt AC 3 ms 1536 KB
31.txt AC 1 ms 512 KB
32.txt AC 3 ms 1536 KB
33.txt AC 1 ms 512 KB
34.txt AC 2 ms 1408 KB
35.txt AC 5 ms 3968 KB
36.txt AC 1 ms 384 KB
37.txt AC 6 ms 4224 KB
38.txt AC 3 ms 1664 KB
39.txt AC 2 ms 1408 KB
40.txt AC 2 ms 1152 KB
41.txt AC 4 ms 2048 KB
42.txt AC 8 ms 4224 KB
43.txt AC 2 ms 1024 KB
44.txt AC 8 ms 4224 KB
45.txt AC 1 ms 512 KB
46.txt AC 1 ms 768 KB
47.txt AC 2 ms 1024 KB
48.txt AC 4 ms 1920 KB
49.txt AC 5 ms 4224 KB
50.txt AC 1 ms 512 KB
51.txt AC 2 ms 2432 KB