oj.uz

답안 #960800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960800 2024-04-11T04:24:00 Z Whisper 수열 (APIO14_sequence) C++17
71 / 100
 70 ms 131072 KB 
#include <bits/stdc++.h>
#pragma GCC optmize("Ofast")
using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, nGroup;
const int MAX = 1e5 + 5;
int a[MAX];


int dp[MAX][2];
int opt[MAX][205];
int s[MAX];
struct Line {
    ll a, b, id;
    Line (ll _a = 0, ll _b = 0, ll _id = -1) { a = _a; b = _b; id = _id; };
    ll cal(ll x) { return a * x + b; }
    long double cross(Line o) { return (long double) (b - o.b) / (long double) (o.a - a); }
};
struct CHT {
    deque <Line> q;
    void addLine(Line nLine) {
        // need to change when a is increasing or decreasing
        while (q.size() >= 2
            && (q.back().cross(nLine) <= q.back().cross(q[q.size() - 2])
                || (q.back().a == nLine.a && q.back().b <= nLine.b)))
            q.pop_back();
        q.push_back(nLine);
    }

    pair <ll, int> query(ll x) {
        while (q.size() >= 2 && q[0].cal(x) <= q[1].cal(x))
            q.pop_front();
        return {q[0].cal(x), q[0].id};
    }
};
void Whisper(){
    cin >> nArr >> nGroup; ++nGroup;

    for (int i = 1; i <= nArr; ++i) cin >> a[i], s[i] = s[i - 1] + a[i];

    //s[nArr] * s[i] - s[nArr] * s[j] - s[i] * s[i] + s[i] * s[j]
    //using s(j) as x we have equation
    //s(j) * x + - s(nArr) * s(j) - s(i) * s(i) + s(nArr) * s(i) + dp(j, k - 1)
    for (int k = 1; k <= nGroup; ++k){
        CHT cht;
        cht.addLine(Line(0, 0, 0));
        for (int i = 1; i <= nArr; ++i){
            pair<int, int> ret = cht.query(s[i]);
            dp[i][1] = ret.first + s[nArr] * s[i] - s[i] * s[i];
            opt[i][k] = ret.second;
            cht.addLine(Line(s[i], -s[i] * s[nArr] + dp[i][0], i));
        }
        for (int i = 1; i <= nArr; ++i){
            dp[i][0] = dp[i][1];
        }
    }
    cout << dp[nArr][0] << '\n';
    vector<int> ans;
    int current = nArr;
    while(nGroup > 0){
        if (current != nArr)
            ans.push_back(current);
        current = opt[current][nGroup];
        nGroup--;
    }
    reverse(ans.begin(), ans.end());
    for (int&v : ans) cout << v << " ";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Compilation message

sequence.cpp:2: warning: ignoring '#pragma GCC optmize' [-Wunknown-pragmas]
    2 | #pragma GCC optmize("Ofast")
      |

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 2648 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2396 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 2396 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 2392 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 2396 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 2396 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 2396 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 2396 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 2396 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2396 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2392 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2392 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2396 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 2396 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 2396 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2396 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2396 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 2396 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 4444 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 4440 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 4440 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 7 ms 4440 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 6 ms 4440 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 6 ms 2652 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 8 ms 2652 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 2652 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 2652 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17500 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 17500 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 70 ms 17500 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 17496 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 48 ms 17500 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 58 ms 17496 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 56 ms 17552 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 44 ms 17548 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 50 ms 17744 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 61 ms 17500 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 53 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -