oj.uz

답안 #134968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134968 2019-07-23T13:34:38 Z wilwxk 수열 (APIO14_sequence) C++14
50 / 100
 2000 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=1e5+5;
const ll INF=1e18;
ll dp[MAXN][205];
int opt[MAXN][205];
ll soma[MAXN];
ll v[MAXN];
int n, x;

int main() {
	scanf("%d %d", &n, &x); x++;
	for(int i=1; i<=n; i++) scanf("%lld", &v[i]);
	for(int i=1; i<=n; i++) soma[i]=soma[i-1], soma[i]+=v[i];

	dp[0][0]=0; for(int i=1; i<=x; i++) dp[0][i]=-INF;
	for(int i=1; i<=n; i++) dp[i][0]=-INF;
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=x; j++) {
			dp[i][j]=dp[i-1][j-1]+v[i]*soma[i-1];
			opt[i][j]=i-1;

			for(int k=0; k<i; k++) {
				ll val=dp[k][j-1]+(soma[i]-soma[k])*soma[k];
				if(val>=dp[i][j]) {
					dp[i][j]=val;
					opt[i][j]=k;
				}
			}

			// printf("%d %d >> %lld // %d\n", i, j, dp[i][j], opt[i][j]);
		}
	}

	printf("%lld\n", dp[n][x]);
	vector<int> respf;
	int ind=n; int k=x;
	while(respf.size()<x-1) {
		respf.push_back(opt[ind][k]);
		ind=opt[ind][k--];
	}
	reverse(respf.begin(), respf.end());
	for(auto cur : respf) printf("%d ", cur);
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(respf.size()<x-1) {
        ~~~~~~~~~~~~^~~~
sequence.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &x); x++;
  ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:15:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=n; i++) scanf("%lld", &v[i]);
                          ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2808 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 7 ms 2808 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 232 ms 2792 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 7 ms 2680 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 242 ms 2788 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 232 ms 2812 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 233 ms 2808 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 237 ms 2836 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 46 ms 2808 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 96 ms 2844 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 875 ms 24652 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 885 ms 24700 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2060 ms 18960 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 120 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -