// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("Ofast,unroll-loops")
/* I don't understand these pragmas at all.
Earlier I added all the optimizations I could find but
upon my short amount of testing, these 2 are enough and adding more makes it slower. */
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// ----------------</Defines and typedefs>----------------
// -------------------<Debugging stuff>-------------------
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
// ------------------</Debugging stuff>-------------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
void solvethetestcase();
signed main(){
// (UNCOMMENT FOR CIN/COUT) \
FAST_IO
PRECISION(10)
int t = 1;
// (UNCOMMENT FOR MULTIPLE TEST CASES) \
sfl(t);
FOR(testcase,1,t+1){
// (UNCOMMENT FOR CODEJAM) \
printf("Case #%lld: ",testcase);
solvethetestcase();
}
}
int n,k;
int a[100005],pref[100005];
int dp[100005][2];
signed opt[100005][201];
int ptr;
vector<pair<pii,int> > lines;
void reset(){
lines.clear();
ptr = 0;
}
bool bad(pii l1,pii l2,pii l3){
// check if intersection of l1,l3 is <= intersection of l1,l2
// x*l1.F+l1.S = x*l3.F+l3.S
// x*(l3.F-l1.F) = l1.S-l3.S
// x = (l1.S-l3.S)/(l3.F-l1.F)
// (l1.S-l3.S)/(l3.F-l1.F) <= (l1.S-l2.S)/(l2.F-l1.F)
return (l1.S-l3.S)*(l2.F-l1.F) <= (l1.S-l2.S)*(l3.F-l1.F);
}
void add(int m,int c,int ind){ // y = mx+c
pair<pii,int> u = {{m,c},ind};
while(lines.size() >= 2 and bad(lines[lines.size()-2].F,lines[lines.size()-1].F,u.F)) lines.pop_back();
lines.pb(u);
}
pii quer(int x){
if(!lines.size()) return {-INF,-1};
if(ptr >= lines.size()) ptr = lines.size()-1;
while(ptr < lines.size()-1 and lines[ptr].F.F*x+lines[ptr].F.S < lines[ptr+1].F.F*x+lines[ptr+1].F.S) ptr++;
return {lines[ptr].F.F*x+lines[ptr].F.S,lines[ptr].S};
}
void solvethetestcase(){
sfl2(n,k)
FOR(i,1,n+1){
sfl(a[i])
pref[i] = pref[i-1]+a[i];
}
if(k == 0){
printf("0\n");
return;
}
FOR(j,1,k+1){
int cur = j%2;
int prev = 1-cur;
reset();
FOR(i,1,n+1){
pii u = quer(pref[i]);
dp[i][cur] = u.F;
opt[i][j] = u.S;
if(dp[i][prev] != -INF) add(pref[i],dp[i][prev]-pref[i]*pref[i],i);
}
}
pfl(dp[n][k%2]);
int cur = opt[n][k];
REP(i,k){
pwe(cur)
if(i+1 != k) cur = opt[cur][k-1-i];
}
printf("\n");
}
Compilation message
sequence.cpp:54:1: warning: multi-line comment [-Wcomment]
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
^
sequence.cpp:179:5: warning: multi-line comment [-Wcomment]
// (UNCOMMENT FOR CIN/COUT) \
^
sequence.cpp:184:5: warning: multi-line comment [-Wcomment]
// (UNCOMMENT FOR MULTIPLE TEST CASES) \
^
sequence.cpp:187:9: warning: multi-line comment [-Wcomment]
// (UNCOMMENT FOR CODEJAM) \
^
sequence.cpp: In function 'pii quer(ll)':
sequence.cpp:224:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ptr >= lines.size()) ptr = lines.size()-1;
~~~~^~~~~~~~~~~~~~~
sequence.cpp:225:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(ptr < lines.size()-1 and lines[ptr].F.F*x+lines[ptr].F.S < lines[ptr+1].F.F*x+lines[ptr+1].F.S) ptr++;
~~~~^~~~~~~~~~~~~~~~
sequence.cpp: In function 'void solvethetestcase()':
sequence.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
~~~~~^~~~~~~~~~~~~~~~~~
sequence.cpp:230:5: note: in expansion of macro 'sfl2'
sfl2(n,k)
^~~~
sequence.cpp:93:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
#define sfl(x) scanf("%lld",&x);
~~~~~^~~~~~~~~~~
sequence.cpp:232:9: note: in expansion of macro 'sfl'
sfl(a[i])
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
8896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
8896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
44 ms |
8828 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8956 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
38 ms |
8896 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
41 ms |
8896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
43 ms |
8956 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
34 ms |
8936 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
36 ms |
8956 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
8828 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
84320 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
60 ms |
84328 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
540 ms |
85132 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
61 ms |
85092 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
654 ms |
84328 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
438 ms |
84324 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
477 ms |
85096 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
424 ms |
84964 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
474 ms |
84712 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
557 ms |
84708 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
