Submission #1212706

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;

const int N = 55;
const int M = 155;
typedef long long LL;
const LL mo = 1000000007;

int n,m,Ans,A[M],d[N],f[N][M][M];
bool Min[N],Max[N];

void Add(int &x,const int &y) {x += y; if (x > mo) x -= mo;}

int main()
{
	#ifdef DMC
		freopen("DMC.txt","r",stdin);
	#endif
	
	cin >> n; m = 2 * n - 1;
	for (int i = 1; i <= m; i++) scanf("%d",&A[i]);
	sort(A + 1,A + m + 1); int mid = 1 + m >> 1;
	for (int i = 2; i <= n; i++)
	{
		if (A[mid - i + 1] != A[mid - i + 2]) ++d[i],Min[i] = 1;
		if (A[mid + i - 1] != A[mid + i - 2]) ++d[i],Max[i] = 1;
	}
	f[1][1][1] = 1;
	for (int i = 1; i < n; i++)
		for (int j = 1; j <= m; j++)
			for (int k = 1; k <= j; k++)
			{
				if (!f[i][j][k]) continue;
				int tot = j + d[i + 1];
				int pos = Min[i + 1] ? k + 1 : k;
				for (int l = 1; l < pos; l++)
					Add(f[i + 1][tot - (pos - l - 1)][l],f[i][j][k]);
				Add(f[i + 1][tot][pos],f[i][j][k]);
				for (int l = pos + 1; l <= tot; l++)
					Add(f[i + 1][tot - (l - pos - 1)][pos + 1],f[i][j][k]);
			}
	for (int i = 1; i <= m; i++)
		for (int j = 1; j <= i; j++)
			Add(Ans,f[n][i][j]);
	cout << Ans << endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= m; i++) scanf("%d",&A[i]);
                                                ^

Judge Result