oj.uz

Submission #2177

# Submission time Handle Problem Language Result Execution time Memory
2177 2013-07-20T07:09:46 Z cki86201 지우개 (GA4_eraser) C++
100 / 100
 19 ms 4792 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;

const int T=1e9+7;
long long int Dp[100010][4];
long long int A[100010];
int X,N;

int main()
{
	scanf("%d",&N);
	int i,j;
	for(i=1;i<=N;i++){
		int x;scanf("%d",&x);
		A[x]++;
		X=max(X,x);
	}
	for(i=1;i<=X;i++){A[i]*=i;A[i]%=T;}
	for(i=0;i<=X;i++)Dp[i][0]=1;
	for(j=1;j<=3;j++){
		for(i=1;i<=X;i++){
			Dp[i][j]=Dp[i-1][j]+Dp[i-1][j-1]*A[i];
			Dp[i][j]%=T;
		}
	}
	printf("%d",Dp[X][3]);
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4792 KB Output is correct
2 Correct 4 ms 4792 KB Output is correct
3 Correct 4 ms 4792 KB Output is correct
4 Correct 13 ms 4792 KB Output is correct
5 Correct 4 ms 4792 KB Output is correct
6 Correct 11 ms 4792 KB Output is correct
7 Correct 6 ms 4792 KB Output is correct
8 Correct 19 ms 4792 KB Output is correct
9 Correct 11 ms 4792 KB Output is correct
10 Correct 16 ms 4792 KB Output is correct

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 4792 KB Output is correct
2 Correct 2 ms 4792 KB Output is correct
3 Correct 16 ms 4792 KB Output is correct
4 Correct 4 ms 4792 KB Output is correct
5 Correct 17 ms 4792 KB Output is correct
6 Correct 6 ms 4792 KB Output is correct
7 Correct 15 ms 4792 KB Output is correct
8 Correct 13 ms 4792 KB Output is correct
9 Correct 17 ms 4792 KB Output is correct
10 Correct 16 ms 4792 KB Output is correct