제출 #263232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
263232		kaage	수열 (APIO14_sequence)	C++17	0 / 100	55 ms	17712 KiB

sequence

#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 3 "/Users/kaage/Desktop/ProgrammingWorkspace/library/data-structure/LiChaoTree.hpp"
class LiChaoTree{
    int n,id;
    std::vector<std::tuple<lint,lint,lint>> interval;
    std::vector<std::pair<LP,int>> node;
    std::vector<lint> cord;
    lint calc(std::pair<LP,int> l,lint x){
        return l.first.first*x+l.first.second;
    }
public:
    LiChaoTree(){}
    template<class T> LiChaoTree(T vec){init(vec);}
    template<class T> void init(T con){
        interval.clear();node.clear();cord.clear();
        n=1;id=0;
        con.emplace_back(con.back()+1);
        while(n<(int)con.size())n*=2;
        while((int)con.size()<n+1)con.emplace_back(con.back()+1);
        node.assign(2*n,{{0,LINF},-1});
        interval.emplace_back(0,0,0);
        for(int range=n;range;range>>=1){
            for(int i=0;i<n;i+=range){
                if(range==1)interval.emplace_back(con[i],0,con[i+range]);
                else interval.emplace_back(con[i],con[i+range/2],con[i+range]);
            }
        }
        cord=std::move(con);
    }
    void addLine(lint a,lint b){
        int cnt=1;
        std::pair<LP,int> newLine={{a,b},id};
        while(true){
            lint l=std::get<0>(interval[cnt]),m=std::get<1>(interval[cnt]),r=std::get<2>(interval[cnt]);
            if(n<=cnt){
                if(calc(node[cnt],l)>calc(newLine,l))node[cnt]=newLine;
                break;
            }
            if(calc(node[cnt],l)<calc(newLine,l)&&calc(node[cnt],r)<calc(newLine,r))break;
            if(calc(node[cnt],l)>calc(newLine,l)&&calc(node[cnt],r)>calc(newLine,r)){
                node[cnt]=newLine;
                break;
            }
            if(calc(node[cnt],m)>calc(newLine,m))std::swap(node[cnt],newLine);
            if(calc(node[cnt],l)>calc(newLine,l))cnt=cnt<<1;
            else cnt=cnt<<1|1;
        }
        id++;
    }
    std::pair<lint,int> query(int idx){
        lint x=cord[idx];
        idx+=n;
        std::pair<lint,int> res={LINF,-1};
        while(idx){
            if(chmin(res.first,calc(node[idx],x)))res.second=node[idx].second;
            idx>>=1;
        }
        return res;
    }
    void clear(){
        id=0;node.assign(2*n,{{0,LINF},-1});
    }
};
#line 3 "main.cpp"
int n,k,a[100010];
lint b[100010],dp[2][100010];
int from[210][100010];
int main(){
	scanf("%d%d",&n,&k);
	rep(i,n){
		scanf("%d",a+i);
		b[i]=a[i];
		if(i)b[i]+=b[i-1];
	}
	std::vector<lint> vec;
	rep(i,n)vec.emplace_back(b[i]);
	LiChaoTree lct(vec);
	rep(i,k){
		lct.clear();
		for(int j=i+1;j<n;j++){
			lct.addLine(-b[j-1],-(dp[0][j-1]-b[j-1]*b[j-1]));
			auto p=lct.query(j);
			from[i][j]=p.second+i;
			dp[1][j]=-p.first;
		}
		std::move(dp[0],dp[0]+n,dp[1]);
		std::fill(dp[1],dp[1]+n,0);
	}
	vec.clear();
	int now=n-1;
	for(int i=k-1;i>=0;i--){
		now=from[i][now];
		vec.push_back(now+1);
	}
	std::reverse(all(vec));
	printf("%lld\n",dp[0][n-1]);
	printArray(vec);
}

컴파일 시 표준 에러 (stderr) 메시지

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp: In instantiation of 'void printArray(std::vector<_Tp>&) [with T = long long int]':
main.cpp:35:16:   required from here
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:102:2: note: in expansion of macro 'rep'
main.cpp: In function 'int main()':
main.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
main.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29