oj.uz

답안 #337474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337474 2020-12-21T01:55:12 Z tjrwodnjs999 수열 (APIO14_sequence) C++11
89 / 100
 543 ms 86124 KB 
#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
int n,m,arr[100005],pv[100005][205];
ll DP[100005][2],sum[100005];
struct CHT{
	ll a[101010], b[101010], c[101010];
	int pv, top;

	void clear(){
		pv = top = 0;
	}

	ll f(ll idx, ll x){
		return a[idx]*x + b[idx];
	}

	void udt(ll aa, ll bb, ll cc){
		if(top >= 1 && aa == a[top-1]){
			c[top-1] = cc; return;
		}
		while(top >= 2 && (b[top-1] - b[top-2]) * (a[top-2] - aa) >= (bb - b[top-2]) * (a[top-2] - a[top-1])) top--;
		a[top] = aa;
		b[top] = bb;
		c[top] = cc;
		top++;
		if(pv >= top) pv = top - 1;
	}

	pair<ll,ll> qry(ll x){
		while(pv+1 < top && a[pv+1]*x + b[pv+1] > a[pv]*x + b[pv]) pv++;
		return {f(pv, x), c[pv]};
	}
} cht;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
    for(int j=1;j<=m;j++){
        cht.clear();
        for(int i=1;i<=n;i++){
            pair<ll,int> qry=cht.qry(sum[i]);
            DP[i][j%2]=qry.x; pv[i][j]=qry.y;
            cht.udt(sum[i],-sum[i]*sum[i]+DP[i][(j+1)%2],i);
        }
    }
    printf("%lld\n",DP[n][m%2]);
    function<void (int,int)> solve =  [&](int a,int b){
        if(b==0) return;
        solve(pv[a][b],b-1);
        printf("%d ",pv[a][b]);
        return;
    };
    solve(n,m);
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:40:37: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
   40 |     for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
      |                                  ~~~^  ~~~~~
      |                                     |     |
      |                                     |     int*
      |                                     long long int*
      |                                  %d
sequence.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:40:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |     for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
      |                           ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 492 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 492 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 492 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 492 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 492 KB position 1 occurs twice in split scheme
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1260 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1260 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 3 ms 1260 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1280 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 1260 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 1260 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 4 ms 1260 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 1260 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1260 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 2 ms 1260 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8812 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 8812 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 34 ms 8940 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8940 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 28 ms 8812 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 28 ms 8812 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 33 ms 8940 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 23 ms 8960 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 26 ms 8940 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 32 ms 8940 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 85356 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 57 ms 85356 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 532 ms 86096 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 57 ms 85996 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 543 ms 85520 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 375 ms 85484 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 419 ms 86124 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 345 ms 86080 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 375 ms 85740 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 475 ms 85868 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845