oj.uz

답안 #7868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
7868 2014-08-20T14:35:42 Z gs13068 수열 (APIO14_sequence) C++
33 / 100
 4 ms 84292 KB 
#include<cstdio>
#include<algorithm>

std::pair<std::pair<long long,long long>,int> s[100000];
int sn;

long long a[100001];
long long d[2][100001];
int vi[201][100001];

void insert(long long a,long long b,int c)
{
	double t;
    while(sn>=2)
	{
        if((double)(s[sn-1].first.second-s[sn-2].first.second)*(b-s[sn-2].first.second)>=(double)(s[sn-1].first.first-s[sn-2].first.first)*(a-s[sn-2].first.first))break;
        sn--;
	}
	s[sn++]=std::make_pair(std::make_pair(a,b),c);
}

void print(int i,int j)
{
    if(i)
	{
		print(i-1,vi[i][j]);
		printf("%d ",vi[i][j]);
	}
}

int main()
{
	int i,j,k,n,m;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		a[i]+=a[i-1];
		d[0][i]=a[i]*a[i];
	}
	for(i=1;i<=m;i++)
	{
		k=0;
		sn=0;
		for(j=1;j<=n;j++)
		{
			insert(-2*a[j-1],a[j-1]*a[j-1]+d[!(i&1)][j-1],j-1);
			if(k>=sn)k=sn-1;
			while(k+1<sn)
			{
                if(-(s[k+1].first.second-s[k].first.second)<a[j]*(s[k+1].first.first-s[k].first.first))break;
				k++;
			}
			d[i&1][j]=a[j]*a[j]+s[k].first.first*a[j]+s[k].first.second;
			vi[i][j]=s[k].second;
		}
	}
	printf("%lld\n",(a[n]*a[n]-d[m&1][n])/2);
	print(m,n);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 84292 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 84292 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 0 ms 84292 KB Output isn't correct - contestant didn't find the optimal answer: 4698976842 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -