Submission #2216065

---

Source Code Expand

#include <bits/stdc++.h>
#define P 1000000007

using namespace std;

int n, L[111], F[55][111][111], Lf[111], Ri[111], t = 0;

void add(int &x, int y) {
	x = (x + y) % P;
}

int main() {
	scanf("%d", &n);
	for(int i = 1; i < 2 * n; i++) scanf("%d", &L[i]);
	sort(L + 1, L + 2 * n);
	int l, r;
	for(int i = 1; i <= 2 * n; i++)
		if(L[i] != L[i - 1]) {
			Ri[t] = i - 1;
			Lf[++t] = i;
		}
	for(int i = 1; i <= t; i++)
		if(Lf[i] <= n && Ri[i] >= n) {
			l = (r = i);
			break;
		}
	F[0][1][1] = 1;
	for(int i = 0; i < n - 1; i++) {
		int tmpl = 0, tmpr = 0;
		if(Lf[l] >= n - i) l--, tmpl = 1;
		if(Ri[r] <= n + i) r++, tmpr = 1;
		for(int j = 1; j <= t; j++)
			for(int k = 1; k <= t; k++) {
				int v = F[i][j][k];
				add(F[i + 1][j + tmpl + tmpr][k + tmpl], v);
				for(int s = k + tmpl - 1; s >= 1; s--)
					add(F[i + 1][j + tmpl + tmpr - (k + tmpl - s - 1)][s], v);
				for(int s = k + tmpl + 1; s <= j + tmpl + tmpr; s++)
					add(F[i + 1][j + tmpl + tmpr - (s - (k + tmpl + 1))][k + tmpl + 1], v);
			}
	}
	int ans = 0;
	for(int i = 1; i <= t; i++)
		for(int j = 1; j <= t; j++)
			add(ans, F[n - 1][i][j]);
	printf("%d\n", (ans % P + P) % P);
	return 0;
}

Submission Info

Compile Error

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

Judge Result