oj.uz

답안 #544272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544272 2022-04-01T14:45:43 Z SavicS 수열 (APIO14_sequence) C++17
100 / 100
 1114 ms 82904 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 100005; 

int n, K;
int niz[mxN];

int pref[mxN];

ll dp[mxN][2];
int put[mxN][201];

struct line{
    ll k, b; int id;
};

struct CHT{
    deque<line> hull;

    ldb cross(line x, line y){
        return (ldb) (x.b - y.b) / (ldb)(y.k - x.k);
    }   

    void add(line x){
        if(sz(hull) >= 1 && (hull.back().k == x.k && hull.back().b == x.b))hull.pop_back();
        while(sz(hull) >= 2 && cross(x, hull.back()) <= cross(hull.back(), hull[sz(hull) - 2])){
            hull.pop_back();
        }
        hull.pb(x);
    }

    pll get(ll x){

        while(sz(hull) > 1 && x >= cross(hull[0], hull[1])){
            hull.pop_front();
        }

        return {1ll * hull[0].k * x + hull[0].b, hull[0].id};

    }

};

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> K; K += 1;
    ff(i,1,n)cin >> niz[i], pref[i] = pref[i - 1] + niz[i];

    ff(i,1,n)dp[i][1 & 1] = 1ll * pref[i] * (pref[n] - pref[i]);

    ff(j,2,K){

        CHT cht; 
        ff(i,1,n){

            if(dp[i - 1][(j - 1) & 1] != -inf){
                cht.add({pref[i - 1], dp[i - 1][(j - 1) & 1] - 1ll * pref[i - 1] * pref[n], i - 1});
            }

            if(i >= j){
                pll X = cht.get(pref[i]);
                dp[i][j & 1] = X.fi + 1ll * pref[i] * pref[n] - 1ll * pref[i] * pref[i];
                put[i][j] = X.se;
            }
        }

    }

    cout << dp[n][K & 1] << '\n';

    int cur = n;
    fb(i,K,2)cout << put[cur][i] << " ", cur = put[cur][i];
    cout << '\n';


    return 0;
}
/*
 
7 3 
4 1 3 4 0 2 3
 
// probati bojenje sahovski
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8532 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 8608 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 86 ms 8584 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8532 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 66 ms 8532 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 70 ms 8548 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 79 ms 8584 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 59 ms 8532 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 80 ms 8532 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 91 ms 8572 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 82384 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 60 ms 82580 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1018 ms 82808 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 49 ms 82904 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1114 ms 82740 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 758 ms 82496 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 900 ms 82812 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 686 ms 82892 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 680 ms 82732 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 966 ms 82692 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845