oj.uz

답안 #1066972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066972 2024-08-20T09:09:24 Z parlimoos 수열 (APIO14_sequence) C++14
33 / 100
 64 ms 131072 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<ll , x>
#define endl '\n'

struct line{
    ll ar , sh;
};

int n , k;
ll ps[100000] , dp[100000][201];
int opt[100000][201];
vector<int> cnv;
vector<arr(2)> pts;
line ls[100000];

ll form(int i , int j , int t){
    return (ps[i] - ps[j]) * ps[j] + dp[j][t - 1];
}
bool isDel(line a , line b , line c){
    __int128_t d1 = (a.ar - b.ar) , d2 = (b.sh - a.sh);
    __int128_t d3 = (b.ar - c.ar) , d4 = (c.sh - b.sh);
    if(d2 < 0ll) d1 *= (-1ll) , d2 *= (-1ll);
    if(d4 < 0ll) d3 *= (-1ll) , d4 *= (-1ll);
    return ((d1 * d4) <= (d2 * d3));
}
ll getX(line a , line b){
    ll d1 = a.ar - b.ar , d2 = b.sh - a.sh;
    if(d2 < 0ll) d1 *= (-1ll) , d2 *= (-1ll);
    return ((d1 + d2 - 1) / d2);
}
void addLine(int e){
    if(cnv.empty()){
        cnv.pb(e) , pts.pb({ps[e] , e});
        return;
    }
    int len = (int)cnv.size();
    while(len >= 2 and isDel(ls[e] , ls[cnv[len - 1]] , ls[cnv[len - 2]])){
        cnv.pp() , len--;
    }
    if(len == 1 and ls[e].sh == ls[cnv[len - 1]].sh){
        if(ls[e].ar >= ls[cnv[len - 1]].ar){
            cnv.pp();
            cnv.pb(e) , pts.pb({ps[e] , e});
        }
        return;
    }
    // if(e == 1) cout << getX(ls[e] , ls[cnv[len - 1]]) << "**\n";
    arr(2) d = {max(getX(ls[e] , ls[cnv[len - 1]]) , ps[e]) , e};
    pts.pb(d) , cnv.pb(e);
}
void f(){
    for(int i = 0 ; i < n ; i++){
        opt[i][0] = -1;
        ls[i].ar = dp[i][0] - (ps[i] * ps[i]);
        ls[i].sh = ps[i];
        addLine(i);
    }
    for(int t = 1 ; t <= k ; t++){
        int it = -1;
        for(int i = 0 ; i < n ; i++){
            while(it < (int)pts.size() - 1 and ps[i] >= pts[it + 1][0] and i > pts[it + 1][1]) it++;
            if(it == -1){
                dp[i][t] = -1 , opt[i][t] = -1;
                continue;
            }
            int j = pts[it][1];
            if(j == i){
                cout << i << " " << t << "%\n";
                exit(0);
            }    
            // if(t == 1 and i == 2) cout << pts[0][1] << "^^\n";
            dp[i][t] = form(i , j , t) , opt[i][t] = j;
        }
        cnv.cl() , pts.cl();
        for(int i = 0 ; i < n ; i++){
            if(dp[i][t] == -1) continue;
            ls[i].ar = dp[i][t] - (ps[i] * ps[i]);
            ls[i].sh = ps[i];
            addLine(i);
        }
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    for(int i = 0 ; i < n ; i++) cin >> ps[i];
    for(int i = 1 ; i < n ; i++) ps[i] += ps[i - 1];
    f();
    cout << dp[n - 1][k] << endl;
    vector<int> o;
    int v = n - 1 , i = k;
    while(opt[v][i] != -1) o.pb(opt[v][i]) , v = opt[v][i] , i--;
    reverse(o.bg() , o.end());
    for(int el : o) cout << el + 1 << " ";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2908 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 2904 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 2904 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2908 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 2908 KB contestant found the optimal answer: 679388326 == 679388326
6 Runtime error 7 ms 5480 KB Execution killed with signal 8
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24604 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 11 ms 24568 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 58 ms 24668 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 24600 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 45 ms 24564 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Runtime error 35 ms 49680 KB Execution killed with signal 8
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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