oj.uz

Submission #731249

# Submission time Handle Problem Language Result Execution time Memory
731249 2023-04-27T08:16:53 Z Baytoro Split the sequence (APIO14_sequence) C++17
50 / 100
 138 ms 6996 KB 
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define endl "\n"
#define ll long long
#define int long long
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const ll INF=1e18,mod=1e9+9,N=1e3+5;
int n,m;
int dp[N][205],par[N][205],a[N],pref[N];
void solve(){
	int n,k;cin>>n>>k;
	dp[0][0]=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		pref[i]=a[i]+pref[i-1];
	}
	for(int j=1;j<=k+1;j++){
		for(int i=1;i<=n;i++){
			dp[i][j]=-INF;
			par[i][j]=1;
			for(int last=i;last>=1;last--){
				if(dp[i][j]<dp[last-1][j-1]+(pref[i]-pref[last-1])*(pref[n]-pref[i])){
					dp[i][j]=dp[last-1][j-1]+(pref[i]-pref[last-1])*(pref[n]-pref[i]);
					par[i][j]=last-1;
				}
			}
			if(par[i][j]==0) par[i][j]=1;
		}
	}
	cout<<dp[n][k+1]<<endl;
	vector<int> ans;
	int cur=n;
	for(int i=k;i>0;i--){
		cur=par[cur][i+1];
		ans.pb(cur);
	}
	reverse(all(ans));
	for(auto it: ans) cout<<it<<' ';
}
main(){
	//fopn("balancing");
	ios;
	int T=1;
	//cin>>T;
	for(int i=1;i<=T;i++){
		//cout<<"Case #"<<i<<": ";
		solve();
	}
}

Compilation message

sequence.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main(){
      | ^~~~
sequence.cpp: In function 'void fopn(std::string)':
sequence.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 852 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 8 ms 980 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 852 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 980 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 980 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 980 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 980 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 852 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 980 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3540 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 3540 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 103 ms 3540 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 3540 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 107 ms 3540 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 93 ms 3540 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 138 ms 3540 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 108 ms 3540 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 24 ms 3556 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 47 ms 3540 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 6996 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 6996 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -