답안 #113600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113600	2019-05-26T17:33:12 Z	Kamisama	수열 (APIO14_sequence)	C++14	0 / 100	112 ms	84936 KB

sequence

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <chrono>
//#define Kami
#define taskname "APIO14_sequence"
using namespace std;
const int maxn=1e5+3;
const int maxk=2e2+3;
 
template<typename T> inline void Read(T &x){
    register char c;
    bool neg=false;
    for(c=getchar();c<'0'||c>'9';c=getchar()) if(c=='-') neg=true;
    for(x=0;'0'<=c&&c<='9';c=getchar()) x=x*10+c-'0';
    if(neg) x=-x;
}template<typename T,typename... Args> inline void Read(T &x,Args&... args){
    Read(x);
    Read(args...);
}template<typename T> inline void Write(T x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) Write(x/10);
    putchar(x%10+'0');
}template<typename T> inline void Write(T x, const char &c){
    if(x<0) putchar('-'),x=-x;
    Write(x);
    putchar(c);
}template <typename T,typename... Args> inline void Write(const T &a, const char &c, Args... args){
    Write(a,c);
    Write(args...);
}
 
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(){
    Read(n,k);
    for(int i=1;i<=n;i++) Read(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=0;
        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;
        }
    }
    Write(f[n],'\n');
    for(int x=n,i=k;i>=1;i--) Write(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 'int main()':
sequence.cpp:75: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:75: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

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	4224 KB	contestant didn't find the optimal answer: 98 < 108
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	4352 KB	contestant didn't find the optimal answer: 1090726 < 1093956
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4480 KB	contestant found the optimal answer: 610590000 == 610590000
2	Incorrect	6 ms	4452 KB	contestant didn't find the optimal answer: 203940391 < 311760000
3	Halted	0 ms	0 KB	-