Submission #2157

#	Time	Username	Problem	Language	Result	Execution time	Memory
2157		jwvg0425	지우개 (GA4_eraser)	C++98	0 / 100	1000 ms	2448 KiB

eraser

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
using namespace std;

#define MOD 1000000007
int n;
long long int a[100000];
long long int v,s[100000];

int main()
{
	int i,j,k;
	scanf("%d",&n);
	for(i=0;i<n;i++)scanf("%lld",&a[i]);
	sort(&a[0],&a[n]);
	s[0]=a[0];
	for(i=1;i<n;i++)s[i]=s[i-1]+a[i];
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n-1;j++)
		{
			if(a[i]==a[j])continue;
			k=j+1;
			while(a[k]==a[j])k++;
			if(k<n)
			{
				v+=(s[n-1]-s[k-1])*(long long int)a[i]*(long long int)a[j]%MOD;
			}
		}
	}
	printf("%lld",v);
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 26
• Subtask 6: 0 / 28