Submission #5633

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5633	2014-05-09 04:13:03	gs13073	지우개 (GA4_eraser)	C++98	100 / 100	20 ms	4996 KiB

eraser

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100100],b[100100];
long long dp[4][100100];  //dp[i][j] : (1~j)까지, i개씩 곱들의 합
int main()
{
  int N,i;
  //freopen("input.txt","r",stdin);
  scanf("%d",&N);
  for(i=1;i<=N;i++)scanf("%d",&a[i]);
  sort(a+1,a+N+1);
  int j=0;
  for(i=1;i<=N;i++){
    if(a[i]!=a[i-1])j++;
    b[j]+=a[i];
  }
  int J=j;
  //for(i=1;i<=J;i++)printf("%d ",b[i]);
  //puts("");
  for(j=1;j<=J;j++)dp[1][j]=dp[1][j-1]+b[j];
  for(i=2;i<=3;i++){
    for(j=1;j<=J;j++){
      if(j<i)continue;
      int tmp=(dp[i-1][j-1]*b[j])%1000000007;
      dp[i][j]=dp[i][j-1]+tmp;
      dp[i][j]%=1000000007;
    }
  }
  /*for(i=1;i<=3;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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