oj.uz

답안 #200806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200806 2020-02-08T08:08:22 Z nvmdava 수열 (APIO14_sequence) C++17
100 / 100
 714 ms 100088 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 100001
#define K 202
#define MOD 1000000007
 
ll p[N];
int opt[N][K];
struct Line{
    ll y, g, x;
    int i;
    Line(ll _y, ll _g, int _i){
        i = _i;
        y = _y;
        g = _g;
        x = 0;
    }
};
 
struct Hull{
    deque<Line> line;
    int sz = 0;
 
    ll div(ll y, ll x){
        if(x == 0 || y <= 0)
            return 0;
        return y / x + (y % x != 0);
    }
 
    void addLine(ll y, ll g, int i){
        if(sz && line.back().g == g && line.back().y >= y){
            if(line.back().y == y)
                line.back().i = i;
            return;
        }
        Line tmp = Line(y, g, i);
        while(sz){
            tmp.x = div(line.back().y - tmp.y, tmp.g - line.back().g);
            if(tmp.x > line.back().x)
                break;
            line.pop_back();
            --sz;
        }
        ++sz;
        line.push_back(tmp);
    }
 
    pair<ll, int> query(ll x){
        if(!sz)
            return {0, 0};
        while(sz >= 2 && line[1].x <= x){
            line.pop_front();
            sz--;
        }
        return {line[0].y + line[0].g * x, line[0].i};
    }
} hull[K];
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int n, k;
    cin>>n>>k;
    ++k;
    for(int i = 1; i <= n; ++i){
        cin>>p[i];
        p[i] += p[i - 1];
    }
    for(int i = 1; i <= n; ++i){
        for(int j = k; j > 0; --j){
            auto a = hull[j - 1].query(p[i]);
            opt[i][j] = a.ss;
            hull[j].addLine(a.ff - p[i] * p[i], p[i], i);
        }
    }
    cout<<hull[k].line.back().y + p[n] * p[n]<<'\n';
    for(int i = k; i >= 2; i--){
        n = opt[n][i];
        cout<<n<<' ';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9080 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 9208 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 54 ms 10488 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 9212 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 43 ms 10232 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 45 ms 9592 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 59 ms 10360 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 46 ms 10616 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 50 ms 10100 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 55 ms 10232 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 85752 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 67 ms 85980 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 694 ms 100088 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 67 ms 87288 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 714 ms 97400 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 480 ms 91616 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 607 ms 98424 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 505 ms 97144 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 509 ms 97272 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 638 ms 97768 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845