oj.uz

Submission #112807

# Submission time Handle Problem Language Result Execution time Memory
112807 2019-05-22T05:01:23 Z Kamisama Split the sequence (APIO14_sequence) C++14
11 / 100
 55 ms 5084 KB 
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <chrono>
//#define Kami
#define taskname "APIO14_sequence"
using namespace std;
const int maxn=1e4+3;
const int maxk=1e2+3;

struct TLines{
    long long a, b; int id;
    inline TLines(long long _a=0, long long _b=0, int _id=0){a=_a;b=_b;id=_id;}
    inline long long Value(const long long &x){return a*x+b;}
    friend inline bool isBad(const TLines &d1, const TLines &d2, const TLines &d3){
        return (d2.b-d1.b)*(d1.a-d3.a)>=(d3.b-d1.b)*(d1.a-d2.a);
    }
};

int n,k,a[maxn],trace[maxn][maxk];
long long s[maxn],f[maxn],g[maxn];
TLines convex[maxn];

inline void Enter(){
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i], s[i]=s[i-1]+a[i];
}

inline void Solve(){ // f[i] = max{ s[j]*s[i] + f[j] - s[j]^2 }
    for(int t=1;t<=k;t++){
        int best=1;
        int nConvex=0;
        swap(f,g);
        for(int i=1;i<=n;i++){
            long long x=s[i];
            TLines newline(s[i],g[i]-s[i]*s[i],i);
            while(nConvex>1 && isBad(convex[nConvex-1],convex[nConvex],newline)){
                best-=(best==nConvex);
                nConvex--;
            } convex[++nConvex]=newline;
            while(best<nConvex && convex[best].Value(x)<=convex[best+1].Value(x)) best++;
            f[i]=convex[best].Value(x);
            trace[i][t]=convex[best].id;
        }
    }
    cout<<f[n]<<'\n';
    int nG=0;
    for(int x=n,i=k;i>=1;i--) g[++nG]=x=trace[x][i];
    for(int i=nG;i;i--) cout<<g[i]<<' ';
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL); if(fopen(taskname".INP","r"))
    freopen(taskname".INP","r",stdin),
    freopen(taskname".OUT","w",stdout);
    #ifdef Kami
    auto start=chrono::steady_clock::now();
    #endif

    Enter();
    Solve();

    #ifdef Kami
    auto end=chrono::steady_clock::now();
    cerr<<"\nIn milliseconds : "
        <<chrono::duration_cast<chrono::milliseconds>(end-start).count();
    cerr<<'\n'<<"In seconds : "<<fixed<<setprecision(3)
        <<(double)chrono::duration_cast<chrono::milliseconds>(end-start).count()/1000<<'\n';
    #endif

    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:55:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(taskname".INP","r",stdin),
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
     freopen(taskname".OUT","w",stdout);
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:55:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 768 KB contestant found the optimal answer: 999 == 999
3 Incorrect 2 ms 768 KB Integer 2 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 768 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 4 ms 768 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 896 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Incorrect 4 ms 896 KB declared answer doesn't correspond to the split scheme: declared = 1019625819, real = 918965330
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1152 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 1152 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 8 ms 1152 KB declared answer doesn't correspond to the split scheme: declared = 49729674225461, real = 48037633301502
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4864 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 4864 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 55 ms 5084 KB declared answer doesn't correspond to the split scheme: declared = 4973126687469639, real = 4681731464341313
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 896 KB Integer 0 violates the range [1, 99999]
2 Halted 0 ms 0 KB -