oj.uz

Submission #26505

# Submission time Handle Problem Language Result Execution time Memory
26505 2017-07-01T13:38:13 Z oneshadab Split the sequence (APIO14_sequence) C++14
100 / 100
 756 ms 88088 KB 
#include <bits/stdc++.h>

using namespace std;


#define For(i,N) Forr(i, 0, N)
#define Forr(i,a,b) Fotr(i, a, b, 1)
#define Fotr(i,a,b,c) for(int i=(a);i<(b);i+=(c))
#define FOREACH(it, x) for(__typeof__((x).begin()) it=(x).begin();it!=(x).end();it++)
#define MEM(a,x) memset(a,x,sizeof(a))
#define BCHK(a,x) (((a)>>(x))&1)
#define BSET(a,x) ((a)|(1<<(x)))
#define BCLR(a,x) ((a)&(~(1<<(x))))
#define BTGL(a,x) ((a)^(1<<(x)))
#define FMT(...) (sprintf(CRTBUFF, __VA_ARGS__)?CRTBUFF:0)
#define read() freopen("input.txt","r",stdin)
#define write() freopen("output.txt","w",stdout)
#define cpp_io() {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define BUFFSIZE 30000
#define INF 1000000000
#define MOD 1000000007
#define MAX 100100
#define pb push_back
#define mkpr make_pair
#define pii pair<int, int>
#define fi first
#define si second
typedef long long ll;

char CRTBUFF[BUFFSIZE];

#define dbg(args...) {cout<<"-->";debugger::call(#args,args);cout<<"\n";}
struct debugger{
    static void call(const char* it){}
    template<typename T, typename ... aT>
    static void call(const char* it, T a, aT... rest){
        string b;
        for(;*it&&*it!=',';++it) if(*it!=' ')b+=*it;
        cout<<b<<"="<<a<<" ";
        call(++it, rest...);
    }
};

/* Template Ends */

struct CHT{
	vector<ll> m, b, id;
	int ptr = 0;
	bool bad(int l1, int l2, int l3) {
		return (b[l3] - b[l1]) * (m[l1] - m[l2]) <= (b[l2] - b[l1]) * (m[l1] - m[l3]);
	}
	void clear() {
		ptr = 0;
		m.clear();
		b.clear();
		id.clear();
	}
	void add(ll _m, ll _b, ll idx) {
		m.push_back(_m);
		b.push_back(_b);
		id.push_back(idx);
		int s = m.size();
		while(s >= 3 && bad(s-3, s-2, s-1)) {
			s--;
			m.erase(m.end()-2);
			b.erase(b.end()-2);
			id.erase(id.end()-2);
		}
	}
	ll f(int i, ll x) { return m[i]*x + b[i]; }

	pair<ll,ll>  query(ll x) {
		if(ptr >= m.size()) ptr = m.size()-1;
		while(ptr < m.size()-1 &&
			f(ptr+1, x) >= f(ptr, x)) ptr++;
		return {f(ptr, x), id[ptr]};
	}
};

ll A[MAX+10], S[MAX+10];
ll dp[2][MAX+10];
int fd[202][MAX+10];

int main()
{
    //read();
    cpp_io();
    //begin
    int n, k;
    while(cin >> n >> k){
        For(i, n) cin >> A[i];
        For(i, n) S[i]=A[i]+(i?S[i-1]:0);
        For(j, n) dp[0][j]=fd[0][j]=0;
        CHT h;
        Forr(i, 1, k+1){
            h.clear();
            h.add(0, 0, 0);
            int x=i&1;
            For(j, n){
                if(j==0){
                    dp[x][j]=0;
                    fd[i][j]=0;
                }
                else{
                    tie(dp[x][j], fd[i][j])=h.query(S[j]);
                }
                h.add(S[j], dp[x^1][j]-S[j]*S[j], j);
            }
        }
        ll ans=dp[k&1][n-1];
        cout << ans << "\n";
        int j=fd[k][n-1];
        for(int i=k-1; i>=0; i--){
            cout << j+1;
            if(i) cout << " ";
            j=fd[i][j];
        }
        cout << "\n";
    }
    return 0;
}

Compilation message

sequence.cpp: In member function 'std::pair<long long int, long long int> CHT::query(ll)':
sequence.cpp:73:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ptr >= m.size()) ptr = m.size()-1;
          ^
sequence.cpp:74:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ptr < m.size()-1 &&
             ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 84328 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 84328 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 84328 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 84328 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 84328 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 84328 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 84328 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 84328 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 84328 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 84328 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 84328 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 84328 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 84328 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 84328 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 84328 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 84328 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 84328 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 84328 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 84328 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 84328 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 84328 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 84328 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 84328 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 84328 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 84328 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 84328 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 84328 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 84328 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 84328 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 84328 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 84328 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 84328 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 0 ms 84328 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 6 ms 84328 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 3 ms 84328 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 84328 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 84328 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 84488 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 84488 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 49 ms 84752 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 84752 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 49 ms 84488 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 53 ms 84488 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 49 ms 84752 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 33 ms 84752 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 36 ms 84752 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 46 ms 84752 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 88088 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 88088 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 433 ms 88088 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 19 ms 88088 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 756 ms 88088 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 563 ms 88088 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 486 ms 88088 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 356 ms 88088 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 389 ms 88088 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 536 ms 88088 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845