oj.uz

답안 #4127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4127 2013-09-01T17:33:36 Z pichulia 지우개 (GA4_eraser) C++
100 / 100
 16 ms 3040 KB 
#include<stdio.h>
#include<algorithm>
#define M 1000000007
using namespace std;
long long int a[100005];
long long int s[100005];
int n, m;
int b[100005];
int main()
{
	long long int i, j, k;
	scanf("%d",&n);
	for(i=0; i<n; i++)
	{
		scanf("%lld",&j);
		b[j]++;
	}
	for(i=1; i<=100000;i++)
	{
		if(b[i]>0)
		{
			a[++m]=(i*b[i])%M;
		}
	}
	for(i=1;i<=m;i++)
		s[i]=(s[i-1]+a[i])%M;
	k=0;
	for(i=1; i<=m; i++)
	{
		j=(s[i-1]*(s[m]-s[i]))%M;
		k=(k+ j * a[i])%M;
	}
	printf("%lld\n",k);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 0 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 0 ms 3040 KB Output is correct
8 Correct 0 ms 3040 KB Output is correct
9 Correct 0 ms 3040 KB Output is correct
10 Correct 0 ms 3040 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 0 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 0 ms 3040 KB Output is correct
8 Correct 0 ms 3040 KB Output is correct
9 Correct 0 ms 3040 KB Output is correct
10 Correct 0 ms 3040 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 0 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 0 ms 3040 KB Output is correct
8 Correct 0 ms 3040 KB Output is correct
9 Correct 0 ms 3040 KB Output is correct
10 Correct 0 ms 3040 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 0 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 0 ms 3040 KB Output is correct
8 Correct 0 ms 3040 KB Output is correct
9 Correct 0 ms 3040 KB Output is correct
10 Correct 0 ms 3040 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 4 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 8 ms 3040 KB Output is correct
7 Correct 4 ms 3040 KB Output is correct
8 Correct 16 ms 3040 KB Output is correct
9 Correct 8 ms 3040 KB Output is correct
10 Correct 8 ms 3040 KB Output is correct

Subtask #6
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 12 ms 3040 KB Output is correct
4 Correct 4 ms 3040 KB Output is correct
5 Correct 12 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 12 ms 3040 KB Output is correct
8 Correct 8 ms 3040 KB Output is correct
9 Correct 12 ms 3040 KB Output is correct
10 Correct 8 ms 3040 KB Output is correct