oj.uz

답안 #137265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137265 2019-07-27T10:43:33 Z egorlifar 수열 (APIO14_sequence) C++17
32 / 100
 695 ms 131076 KB 
/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const string FILENAME = "input";
const int MAXN = 100228;
using ll = long long;

struct Line
{
    ll k, b;
    int id;
    Line(){}
    Line(ll _k, ll _b, int _id): k(_k), b(_b), id(_id){}
    ll value(ll x) {
        return k * x + b;
    }
};


bool better(Line a, Line b, Line c) {
    return(c.b - a.b) * (a.k - b.k) <= (b.b - a.b) * (a.k - c.k);
}

int n, k;
int a[MAXN];
ll pref[MAXN];
ll dp[202][MAXN];
int pr[202][MAXN];


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME); 
    cin >> n >> k;
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
    }
    sum *= sum;
    for (int i = 0; i < n; i++) {
        pref[i] = a[i];
        if (i) {
            pref[i] += pref[i - 1]; 
        }
    }
    for (int i = 1; i <= k + 1; i++) {
        vector<Line> st;
        int uk = 0;
        for (int j = 0; j < n; j++) {
            if (i == 1) {
                dp[i][j] = pref[j] * pref[j];
            } else {
                if (st.empty()) {
                    dp[i][j] = 1e18;
                } else {
                    while (uk + 1 < sz(st) && st[uk + 1].value(pref[j]) >= st[uk].value(pref[j])) {
                        uk++;
                    }
                    dp[i][j] = -st[uk].value(pref[j]) + pref[j] * pref[j];
                    pr[i][j] = st[uk].id;
                }
                Line k(2 * pref[j], -(dp[i - 1][j] + pref[j] * pref[j]), j);
                while (sz(st) >= 2 && better(st[sz(st) - 2], st.back(), k)) {
                    st.pop_back();
                }
                chkmin(uk, sz(st) - 1);
                st.pb(k);
                chkmax(uk, 0);
            }
        }
    }
    cout << (sum - dp[k + 1][n - 1]) / 2 << '\n';
    int cur = n - 1;
    vector<int> st;
    for (int j = k + 1; j > 1; j--) {
        cur = pr[j][cur];
        st.pb(cur + 1);
    }
    reverse(all(st));
    for (auto x: st) {
        cout << x << ' ';
    }
    cout << endl;
    return 0; 
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 380 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB contestant found the optimal answer: 1093956 == 1093956
2 Incorrect 2 ms 380 KB contestant didn't find the optimal answer: 302420312 < 302460000
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 4788 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 10 ms 4856 KB contestant didn't find the optimal answer: 679388302 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1400 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 1304 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 119 ms 26720 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 1672 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 65 ms 16244 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 67 ms 18732 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 99 ms 20404 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 76 ms 16772 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 94 ms 18972 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 110 ms 24144 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 10708 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 32 ms 10876 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 695 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -