Submission #855248

#	Time	Username	Problem	Language	Result	Execution time	Memory
855248		vjudge1	Split the sequence (APIO14_sequence)	C++17	0 / 100	6 ms	2732 KiB

sequence

#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <unordered_set>

#define Bekabot ios_base::sync_with_stdio(NULL);cin.tie(0);cout.tie(0);
#define fopen(s) freopen(s".in","r",stdin);freopen(s".out","w",stdout)
#define all(x) (x).begin(), (x).end()
#define len(x) (int)x.size()
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define elif else if
#define F first
#define S second
#define int long long
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(all(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(all(v),x)-v.begin())

const int N = 1e5 + 78 , inf = 1e18 , M = 1e9 + 7;
using namespace std;

string trans(int n , int k){
    string s = "";
    while(n != 0){
        int d = n % k;
        if(d < 10){
            s = to_string(d) + s;
        }
        else{
            s = char(d + 'A' - 10) + s;
        }
        n /= k;
    }
    return s;
}
int pref[N] , suff[N];
void solve(){
	int n , k;
	cin >> n >> k;
	int a[n + 1];
	
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	for(int i = n ; i >= 1 ; i--)suff[i] = suff[i + 1] + a[i];
	int x = pref[n] / (k + 1);
	int s = 0 , ans = 0;
	vector<int> v;
	for(int i = 1 ; i <= n ; i++){
		s += a[i];
		if(s >= x and len(v) < k){
			ans += s * suff[i + 1];
			s = 0;
			v.pb(i);
		}
	}
	cout << ans << '\n';
	for(int i = 0 ; i < len(v) ; i++)cout << v[i] << ' ';
	
}

signed main(){
    Bekabot
    int t = 1;
    //cin >> t;
    while(t--){
		solve();
	}
}

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