Submission #351592

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main() {
	int N;
	cin >> N;
	vector<ll> T(N), fact(N+2);
	for(auto &i : T) cin >> i;
	sort(T.begin(), T.end());

	const ll mod = 1000000007;
	fact[1] = 1;
	for(int i = 2; i <= N+1; i++){
		fact[i] = (i*fact[i-1])%mod;
	}
	fact[0] = 0;
	
	ll ans = 0, t = 0, n = 1;
	for(auto b = T.begin(); b != T.end();){
		auto e = upper_bound(b, T.end(), *b);
		ll d = (e - b);
		n = (n*fact[d])%mod;
		ans += t*d + (d * (d+1) / 2)*(*b);
		t += d*(*b);
//		cout << d << " " <<n << " " << ans << " " << t << endl;
		b = e;
	}
	cout << ans << "\n" << n << endl;
	
	return 0;
}

Submission Info

Submission Time
Task B - アットコーダー王国のコンテスト事情
User blst_yg
Language C++11 (GCC 4.9.2)
Score 100
Code Size 748 Byte
Status AC
Exec Time 30 ms
Memory 1060 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 23
AC × 42
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 23 ms 808 KiB
subtask0_sample_02.txt AC 23 ms 920 KiB
subtask0_sample_03.txt AC 25 ms 928 KiB
subtask1_01.txt AC 24 ms 736 KiB
subtask1_02.txt AC 24 ms 920 KiB
subtask1_03.txt AC 23 ms 676 KiB
subtask1_04.txt AC 24 ms 928 KiB
subtask1_05.txt AC 24 ms 796 KiB
subtask1_06.txt AC 23 ms 920 KiB
subtask1_07.txt AC 22 ms 924 KiB
subtask1_08.txt AC 24 ms 804 KiB
subtask1_09.txt AC 29 ms 1056 KiB
subtask1_10.txt AC 29 ms 932 KiB
subtask1_11.txt AC 28 ms 1052 KiB
subtask1_12.txt AC 29 ms 924 KiB
subtask1_13.txt AC 29 ms 1056 KiB
subtask1_14.txt AC 30 ms 1056 KiB
subtask1_15.txt AC 29 ms 1048 KiB
subtask1_16.txt AC 27 ms 1052 KiB
subtask1_17.txt AC 28 ms 1052 KiB
subtask1_18.txt AC 29 ms 1052 KiB
subtask1_19.txt AC 29 ms 1056 KiB
subtask1_20.txt AC 23 ms 928 KiB
subtask1_21.txt AC 23 ms 928 KiB
subtask1_22.txt AC 24 ms 804 KiB
subtask2_01.txt AC 27 ms 936 KiB
subtask2_02.txt AC 29 ms 860 KiB
subtask2_03.txt AC 29 ms 888 KiB
subtask2_04.txt AC 28 ms 1052 KiB
subtask2_05.txt AC 28 ms 1060 KiB
subtask2_06.txt AC 30 ms 1056 KiB
subtask2_07.txt AC 29 ms 1060 KiB
subtask2_08.txt AC 28 ms 1052 KiB
subtask2_09.txt AC 30 ms 940 KiB
subtask2_10.txt AC 28 ms 1048 KiB
subtask2_11.txt AC 29 ms 1048 KiB
subtask2_12.txt AC 30 ms 1052 KiB
subtask2_13.txt AC 28 ms 856 KiB
subtask2_14.txt AC 30 ms 1060 KiB
subtask2_15.txt AC 28 ms 1056 KiB
subtask2_16.txt AC 27 ms 928 KiB
subtask2_17.txt AC 28 ms 1052 KiB