oj.uz

Submission #2162

# Submission time Handle Problem Language Result Execution time Memory
2162 2013-07-20T06:12:53 Z jwvg0425 지우개 (GA4_eraser) C++
46 / 100
 1000 ms 2448 KB 
#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= (v+(s[n-1]-s[k-1])*(long long int)a[i]*(long long int)a[j])%MOD;
			}
		}
	}
	printf("%lld",v);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2448 KB Output is correct
2 Correct 0 ms 2448 KB Output is correct
3 Correct 0 ms 2448 KB Output is correct
4 Correct 0 ms 2448 KB Output is correct
5 Correct 0 ms 2448 KB Output is correct
6 Correct 0 ms 2448 KB Output is correct
7 Correct 0 ms 2448 KB Output is correct
8 Correct 0 ms 2448 KB Output is correct
9 Correct 0 ms 2448 KB Output is correct
10 Correct 0 ms 2448 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2448 KB Output is correct
2 Correct 0 ms 2448 KB Output is correct
3 Correct 0 ms 2448 KB Output is correct
4 Correct 0 ms 2448 KB Output is correct
5 Correct 0 ms 2448 KB Output is correct
6 Correct 0 ms 2448 KB Output is correct
7 Correct 0 ms 2448 KB Output is correct
8 Correct 0 ms 2448 KB Output is correct
9 Correct 0 ms 2448 KB Output is correct
10 Correct 0 ms 2448 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2448 KB Output is correct
2 Correct 0 ms 2448 KB Output is correct
3 Correct 1 ms 2448 KB Output is correct
4 Correct 1 ms 2448 KB Output is correct
5 Correct 1 ms 2448 KB Output is correct
6 Correct 1 ms 2448 KB Output is correct
7 Correct 0 ms 2448 KB Output is correct
8 Correct 0 ms 2448 KB Output is correct
9 Correct 0 ms 2448 KB Output is correct
10 Correct 1 ms 2448 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2448 KB Output is correct
2 Correct 0 ms 2448 KB Output is correct
3 Correct 0 ms 2448 KB Output is correct
4 Correct 0 ms 2448 KB Output is correct
5 Correct 2 ms 2448 KB Output is correct
6 Correct 0 ms 2448 KB Output is correct
7 Correct 0 ms 2448 KB Output is correct
8 Correct 0 ms 2448 KB Output is correct
9 Correct 0 ms 2448 KB Output is correct
10 Correct 0 ms 2448 KB Output is correct

Subtask #5
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -