oj.uz

Submission #489348

# Submission time Handle Problem Language Result Execution time Memory
489348 2021-11-22T16:59:40 Z MilosMilutinovic Split the sequence (APIO14_sequence) C++14
0 / 100
 81 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
const ll mod2=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=101000;
int n,k,a[N],go[N][201];
ll pf[N],dp[N][201];

void gao(int l,int r,int pl,int pr,int x) {
	if (l>r) return;
	int md=(l+r)>>1;
	ll bst=0;
	int j=0;
	rep(i,pl,min(pr,md)+1) {
		if (bst<dp[i-1][x-1]+(pf[md]-pf[i-1])*pf[i-1]) {
			bst=dp[i-1][x-1]+(pf[md]-pf[i-1])*pf[i-1];
			j=i;
		}
	}
	go[md][x]=j;
	dp[md][x]=bst;
	gao(l,md-1,pl,j,x);
	gao(md+1,r,j,pr,x);
}

int main() {
	scanf("%d%d",&n,&k);
	rep(i,1,n+1) scanf("%d",a+i);
	rep(i,1,n+1) pf[i]=pf[i-1]+a[i];
	rep(i,1,k+1) gao(1,n,1,n,i);
	printf("%lld\n",dp[n][k]);
	VI ans;
	int pos=n;
	while (pos) ans.pb(pos),pos=go[pos-1][k--];
	reverse(all(ans));
	rep(i,0,SZ(ans)-1) printf("%d ",ans[i]-1); puts("");
}

/*7 3
4 1 3 4 0 2 3
*/

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:3:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    3 | #define rep(i,a,n) for (int i=a;i<n;i++)
      |                    ^~~
sequence.cpp:54:2: note: in expansion of macro 'rep'
   54 |  rep(i,0,SZ(ans)-1) printf("%d ",ans[i]-1); puts("");
      |  ^~~
sequence.cpp:54:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   54 |  rep(i,0,SZ(ans)-1) printf("%d ",ans[i]-1); puts("");
      |                                             ^~~~
sequence.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  scanf("%d%d",&n,&k);
      |  ~~~~~^~~~~~~~~~~~~~
sequence.cpp:46:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  rep(i,1,n+1) scanf("%d",a+i);
      |               ~~~~~^~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB contestant found the optimal answer: 108 == 108
2 Incorrect 0 ms 332 KB declared answer doesn't correspond to the split scheme: declared = 999, real = 951
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 716 KB declared answer doesn't correspond to the split scheme: declared = 610590000, real = 514120000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2636 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23940 KB declared answer doesn't correspond to the split scheme: declared = 1818678304, real = 1718678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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