Submission #1889181


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))

#define SZ(a) (int) a.size()
#define ALL(a) a.begin(),a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;

const double PI = acos(-1.0);
const LL INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;

const int MOD = 1000 * 1000 * 1000 + 7;
const int MAX = 111;

int DP[MAX][MAX][MAX];
int A[MAX];

void ADD(int& x, int val)
{
	x += val;
	if (x >= MOD) x -= MOD;
}

int main()
{
	//freopen("in.txt", "r", stdin);
	//ios::sync_with_stdio(false); cin.tie(0);

	int n;
	scanf("%d", &n);

	FOR (i, 0, n * 2 - 1)
	{
		scanf("%d", &A[i]);
	}

	sort(A, A + n * 2 - 1);

	DP[0][1][0] = 1;

	FOR (i, 0, n)
	{
		FOR (j, 0, n*2)
		{
			FOR (k, 0, j)
			{
				if (DP[i][j][k] == 0) continue;

				int total = j;
				int index = k;

				int pos = n - i - 2;
			//	cout<<"! "<<pos<<endl;
				if (pos >= 0)
				{
					if (A[pos] != A[pos+1]) total++, index++;
				}

				pos += 2 * (i + 1);

			//	cout<<"! "<<pos<<endl;
				if (pos < 2 * n - 1)
				{
					if (A[pos] != A[pos - 1]) total++;
				}

			//	cout<<i<<' '<<j<<' '<<k<<": "<<total<<' '<<index<<' '<<DP[i][j][k]<<endl;

				FOR (s, 0, total)
				{
					int tot = total;
					int ind = index;

					int ts = s;
					if (ts > ind) ts = ind + 1;

					if (abs(s - ind) > 1) tot -= abs(s - ind) - 1;

					ADD(DP[i+1][tot][ts], DP[i][j][k]);
				}
			}
		}
	}

	int res = 0;
	FOR (j, 0, n*2)
	{
		FOR (s, 0, j)
		{
			ADD(res, DP[n-1][j][s]);
		}
	}

	cout<<res<<endl;

}

Submission Info

Submission Time
Task F - Prefix Median
User vjudge2
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1777 Byte
Status AC
Exec Time 31 ms
Memory 3200 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:44: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
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 1 ms 384 KB
01.txt AC 31 ms 3200 KB
02.txt AC 23 ms 3200 KB
03.txt AC 5 ms 768 KB
04.txt AC 3 ms 512 KB
05.txt AC 2 ms 512 KB
06.txt AC 12 ms 1024 KB
07.txt AC 31 ms 3200 KB
08.txt AC 2 ms 512 KB
09.txt AC 31 ms 3200 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 9 ms 896 KB
14.txt AC 15 ms 1152 KB
15.txt AC 1 ms 256 KB
16.txt AC 10 ms 2944 KB
17.txt AC 1 ms 384 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 384 KB
21.txt AC 1 ms 384 KB
22.txt AC 1 ms 256 KB
23.txt AC 2 ms 512 KB
24.txt AC 1 ms 384 KB
25.txt AC 2 ms 512 KB
26.txt AC 3 ms 640 KB
27.txt AC 1 ms 384 KB
28.txt AC 10 ms 2944 KB
29.txt AC 2 ms 384 KB
30.txt AC 3 ms 640 KB
31.txt AC 1 ms 256 KB
32.txt AC 2 ms 512 KB
33.txt AC 1 ms 256 KB
34.txt AC 2 ms 512 KB
35.txt AC 6 ms 2816 KB
36.txt AC 1 ms 256 KB
37.txt AC 8 ms 2944 KB
38.txt AC 3 ms 640 KB
39.txt AC 2 ms 512 KB
40.txt AC 1 ms 384 KB
41.txt AC 4 ms 768 KB
42.txt AC 12 ms 2944 KB
43.txt AC 2 ms 384 KB
44.txt AC 13 ms 2944 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 384 KB
47.txt AC 1 ms 384 KB
48.txt AC 4 ms 768 KB
49.txt AC 6 ms 896 KB
50.txt AC 1 ms 256 KB
51.txt AC 2 ms 2432 KB