Submission #9840

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9840	2014-10-01T14:06:46 Z	effserv	Uniting (kriii2_U)	C++	1 / 4	16 ms	1360 KB

U

#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

int main()
{
	int N;
	scanf("%d", &N);

	ll a;
	scanf("%lld", &a);

	ll A = (ll)a;
	ll C = 0;
	int arr[100001] = { (int)a };
	for (int i = 0; i < N - 1; i++)
	{
		scanf("%lld", &a);
		arr[i + 1] = (int)a;
		C += A*a;
		A += a;
	}

	sort(arr, arr + N);

	printf("%lld\n", C);

	ll mod = 1000000007;
	ll bigmod = 10000000000000;
	ll S = 1;
	int cnt = 1;
	for (int i = 0; i < N - 1; i++)
	{
		if (arr[i] != arr[i + 1])
			cnt++;
	}

	for (int i = cnt; i >= 1; i--)
	{
		S*= (ll)i;
		S %= bigmod;
	}

	printf("%lld\n", S%mod);

	return 0;
}

Subtask #1

1.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	1352 KB	Output is partially correct
2	Partially correct	0 ms	1356 KB	Output is partially correct
3	Partially correct	0 ms	1356 KB	Output is partially correct
4	Partially correct	0 ms	1356 KB	Output is partially correct
5	Partially correct	0 ms	1356 KB	Output is partially correct
6	Partially correct	0 ms	1352 KB	Output is partially correct
7	Partially correct	0 ms	1356 KB	Output is partially correct
8	Partially correct	0 ms	1356 KB	Output is partially correct
9	Partially correct	0 ms	1356 KB	Output is partially correct
10	Partially correct	0 ms	1356 KB	Output is partially correct
11	Partially correct	0 ms	1352 KB	Output is partially correct
12	Partially correct	0 ms	1356 KB	Output is partially correct
13	Partially correct	0 ms	1356 KB	Output is partially correct
14	Partially correct	0 ms	1352 KB	Output is partially correct
15	Partially correct	0 ms	1356 KB	Output is partially correct
16	Partially correct	0 ms	1356 KB	Output is partially correct
17	Partially correct	0 ms	1360 KB	Output is partially correct
18	Partially correct	0 ms	1356 KB	Output is partially correct
19	Partially correct	0 ms	1356 KB	Output is partially correct
20	Partially correct	0 ms	1356 KB	Output is partially correct
21	Partially correct	0 ms	1360 KB	Output is partially correct
22	Partially correct	0 ms	1352 KB	Output is partially correct
23	Partially correct	4 ms	1360 KB	Output is partially correct
24	Partially correct	0 ms	1356 KB	Output is partially correct
25	Partially correct	4 ms	1356 KB	Output is partially correct
26	Partially correct	4 ms	1356 KB	Output is partially correct
27	Partially correct	0 ms	1352 KB	Output is partially correct
28	Partially correct	4 ms	1360 KB	Output is partially correct
29	Partially correct	4 ms	1356 KB	Output is partially correct
30	Partially correct	4 ms	1356 KB	Output is partially correct
31	Partially correct	0 ms	1356 KB	Output is partially correct
32	Partially correct	4 ms	1356 KB	Output is partially correct
33	Partially correct	4 ms	1352 KB	Output is partially correct
34	Partially correct	8 ms	1352 KB	Output is partially correct
35	Partially correct	8 ms	1360 KB	Output is partially correct
36	Partially correct	8 ms	1356 KB	Output is partially correct
37	Partially correct	4 ms	1356 KB	Output is partially correct
38	Partially correct	8 ms	1356 KB	Output is partially correct
39	Partially correct	8 ms	1356 KB	Output is partially correct
40	Partially correct	8 ms	1356 KB	Output is partially correct
41	Partially correct	4 ms	1356 KB	Output is partially correct
42	Partially correct	12 ms	1352 KB	Output is partially correct
43	Partially correct	8 ms	1356 KB	Output is partially correct
44	Partially correct	12 ms	1356 KB	Output is partially correct
45	Partially correct	12 ms	1356 KB	Output is partially correct
46	Partially correct	12 ms	1352 KB	Output is partially correct
47	Partially correct	12 ms	1356 KB	Output is partially correct
48	Partially correct	8 ms	1352 KB	Output is partially correct
49	Partially correct	16 ms	1356 KB	Output is partially correct
50	Partially correct	12 ms	1352 KB	Output is partially correct