oj.uz

Submission #112812

# Submission time Handle Problem Language Result Execution time Memory
112812 2019-05-22T05:12:00 Z Kamisama Split the sequence (APIO14_sequence) C++14
0 / 100
 7 ms 4992 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];
            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;
            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;
        }
    }
    cout<<0<<'\n';
    int nG=0;
    for(int x=n,i=k;i>=1;i--) cout<<(x=trace[x][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 'void Solve()':
sequence.cpp:47:9: warning: unused variable 'nG' [-Wunused-variable]
     int nG=0;
         ^~
sequence.cpp: In function 'int main()':
sequence.cpp:54: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:54: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 Incorrect 2 ms 768 KB declared answer doesn't correspond to the split scheme: declared = 0, real = 108
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

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