oj.uz

Submission #7985

# Submission time Handle Problem Language Result Execution time Memory
7985 2014-08-27T04:10:45 Z gs13068 Split the sequence (APIO14_sequence) C++
22 / 100
 0 ms 81948 KB 
#include<cstdio>

long long a[100001];
long long d[2][100001];
long long *now, *next;
int v[201][100001];

void dfs(int p,int s,int e,int f,int r)
{
	if(s<=e)
	{
		int i,t=(s+e)/2;
		next[t]=9e18;
		for(i=f;i<=t&&i<=r;i++)if(next[t]>now[i]+(a[t]-a[i])*(a[t]-a[i]))
		{
			next[t]=now[i]+(a[t]-a[i])*(a[t]-a[i]);
			v[p][t]=i;
		}
		dfs(p,s,t-1,f,v[p][t]);
		dfs(p,t+1,e,v[p][t],r);
	}
}

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

int main()
{
	long long *temp;
	int i,n,m;
	scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		a[i]+=a[i-1];
	}
	now=d[0];
	next=d[1];
	for(i=1;i<=n;i++)now[i]=a[i]*a[i];
    for(i=1;i<=m;i++)
	{
        dfs(i,1,n,i,n);
        temp=now;
        now=next;
        next=temp;
	}
	printf("%lld\n",(a[n]*a[n]-now[n])/2);
	print(m,n);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 81948 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 0 ms 81948 KB Output isn't correct - Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #5
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -