oj.uz

Submission #337471

# Submission time Handle Problem Language Result Execution time Memory
337471 2020-12-21T01:45:20 Z tjrwodnjs999 Split the sequence (APIO14_sequence) C++11
11 / 100
 59 ms 85356 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{
    int s=0,e=0,num[100005];
    pair<ll,ll> p[100005];
    void clear(){
        s=0,e=0;
    }
    long double cross(pair<ll,ll> a,pair<ll,ll> b){
        return 1.0*(a.y-b.y)/(b.x-a.x);
    }
    ll f(int a,ll b){
        return p[a].x*b+p[a].y;
    }
    pair<ll,int> qry(ll x){
        while(s+1<e&&f(s,x)<=f(s+1,x)) s++;
        return {f(s,x),num[s]};
    }
    void udt(ll a,ll b,int k){
        p[e]={a,b}; num[e]=k;
        if(s<e&&p[e-1].x==p[e].x){
            if(p[e-1].y<=p[e].y) p[e-1]=p[e],num[e-1]=num[e];
            e--;
        }
        while(s+1<e&&cross(p[e-2],p[e-1])>=cross(p[e-1],p[e])) num[e-1]=num[e],p[e-1]=p[e--];
        e++;
    }
} 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 member function 'void cht::udt(long long int, long long int, int)':
sequence.cpp:30:90: warning: operation on '((cht*)this)->cht::e' may be undefined [-Wsequence-point]
   30 |         while(s+1<e&&cross(p[e-2],p[e-1])>=cross(p[e-1],p[e])) num[e-1]=num[e],p[e-1]=p[e--];
      |                                                                                         ~^~
sequence.cpp: In function 'int main()':
sequence.cpp:37:37: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
   37 |     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:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:37:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
      |                           ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 1900 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 1900 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 1932 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 1 ms 1900 KB declared answer doesn't correspond to the split scheme: declared = 1005301879, real = 1005301625
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

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