Submission #352012

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;
#define rep2(x,from,to) for(long long x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 10000000
#define Mod 1000000007
#define all(X) X.begin(),X.end()
long long n;
long long inn;
long long a[10004];
vector<long long >hai;
long long before;
long long ans;
long long anss;
int main()
{
	anss=1;
	cin>>n;
	rep(i,n)
	{
		cin>>inn;
		hai.push_back(inn);
	}
	hai.push_back(INF);
	sort(all(hai));
	rep(i,n)
	{
			ans+=(hai[i]+before);
			before=hai[i]+before;

	}
	rep(i,n)
	{
		if(i==0)a[i]=1;
		else
		{
			if(hai[i]==hai[i-1])a[i]=a[i-1]+1;
			else a[i]=1;
		}
	}
	a[n]=1;
	rep(i,n)
	{
			anss*=a[i];
			anss%=Mod;
	}
	cout<<ans<<endl;
	cout<<anss<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - アットコーダー王国のコンテスト事情
User tainohimono
Language C++ (GCC 4.9.2)
Score 100
Code Size 866 Byte
Status AC
Exec Time 40 ms
Memory 1180 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 26 ms 924 KiB
subtask0_sample_02.txt AC 26 ms 756 KiB
subtask0_sample_03.txt AC 26 ms 928 KiB
subtask1_01.txt AC 24 ms 800 KiB
subtask1_02.txt AC 26 ms 800 KiB
subtask1_03.txt AC 26 ms 796 KiB
subtask1_04.txt AC 26 ms 924 KiB
subtask1_05.txt AC 26 ms 920 KiB
subtask1_06.txt AC 26 ms 920 KiB
subtask1_07.txt AC 26 ms 920 KiB
subtask1_08.txt AC 26 ms 924 KiB
subtask1_09.txt AC 33 ms 1180 KiB
subtask1_10.txt AC 32 ms 1060 KiB
subtask1_11.txt AC 32 ms 1060 KiB
subtask1_12.txt AC 32 ms 1060 KiB
subtask1_13.txt AC 32 ms 1176 KiB
subtask1_14.txt AC 31 ms 1052 KiB
subtask1_15.txt AC 30 ms 1064 KiB
subtask1_16.txt AC 32 ms 988 KiB
subtask1_17.txt AC 30 ms 1052 KiB
subtask1_18.txt AC 31 ms 1060 KiB
subtask1_19.txt AC 30 ms 1056 KiB
subtask1_20.txt AC 25 ms 800 KiB
subtask1_21.txt AC 30 ms 920 KiB
subtask1_22.txt AC 27 ms 796 KiB
subtask2_01.txt AC 32 ms 1048 KiB
subtask2_02.txt AC 33 ms 1180 KiB
subtask2_03.txt AC 34 ms 1176 KiB
subtask2_04.txt AC 40 ms 1060 KiB
subtask2_05.txt AC 33 ms 1060 KiB
subtask2_06.txt AC 31 ms 1052 KiB
subtask2_07.txt AC 29 ms 1052 KiB
subtask2_08.txt AC 30 ms 1056 KiB
subtask2_09.txt AC 30 ms 1052 KiB
subtask2_10.txt AC 31 ms 1056 KiB
subtask2_11.txt AC 32 ms 1056 KiB
subtask2_12.txt AC 32 ms 1056 KiB
subtask2_13.txt AC 29 ms 1060 KiB
subtask2_14.txt AC 31 ms 1056 KiB
subtask2_15.txt AC 31 ms 1056 KiB
subtask2_16.txt AC 32 ms 1052 KiB
subtask2_17.txt AC 31 ms 1056 KiB