oj.uz

답안 #162533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162533 2019-11-08T16:44:31 Z combi1k1 수열 (APIO14_sequence) C++14
100 / 100
 1603 ms 85180 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define X   first
#define Y   second

const int   N   = 1e5 + 1;

typedef pair<ll,ll>     ii;

struct  ConvexHull  {
    int tot, ptr;

    ii  line[N];
    int name[N];

    int bad(ii a,ii b,ii c) {
        return  1.0 * (c.Y - a.Y) / (a.X - c.X) <= 1.0 * (b.Y - a.Y) / (a.X - b.X);
    }
    int add(ll s,ll c,int i){
        while (tot > 1) {
            if (bad(line[tot - 1],line[tot],ii(s,c)))   {
                tot--;
                continue;
            }
            break;
        }
        ++tot;
        line[tot] = ii(s,c);
        name[tot] = i;
    }
    ll  get(int i,int x)    {
        return  line[i].X * x + line[i].Y;
    }
    ii  get(int x)  {
        for(ptr = min(ptr,tot) ; ptr < tot && get(ptr,x) <= get(ptr + 1,x) ; ++ptr);
        return ii(get(ptr,x),name[ptr]);
    }
}   Combi;

int a[N], c[N];
ll  f[N], g[N];

int opt[N][205];

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

    int n;  cin >> n;
    int k;  cin >> k;

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

    for(int i = 1 ; i <= n ; ++i)   f[i] = 1ll * a[i] * a[i];
    for(int i = 2 ; i <= k + 1 ; ++i)   {
        Combi.tot = 0;
        Combi.ptr = 0;
        for(int j = i ; j <= n ; ++j)   {
            Combi.add(a[j - 1], -f[j - 1] - 1ll * a[j - 1] * a[j - 1],j - 1);

            int t = Combi.get(2 * a[j]).Y;
            ll  C = Combi.get(2 * a[j]).X;

            g[j] = 1ll * a[j] * a[j] - C;

            opt[j][i] = t;
        }
        for(int j = i ; j <= n ; ++j)
            f[j] = g[j];
    }
    cout << (1ll * a[n] * a[n] - f[n]) / 2 << "\n";

    stack<int>  res;

    for(int i = k ; i ; --i)
        res.push(n = opt[n][i + 1]);

    while (res.size())
        cout << res.top() << " ",
        res.pop();
}
/*
7 3
4 1 3 4 0 2 3
*/

Compilation message

sequence.cpp: In member function 'int ConvexHull::add(long long int, long long int, int)':
sequence.cpp:33:5: warning: no return statement in function returning non-void [-Wreturn-type]
     }
     ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10232 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 12 ms 10232 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 78 ms 10232 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 12 ms 10236 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 53 ms 10232 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 58 ms 10284 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 62 ms 10232 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 54 ms 10232 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 63 ms 10232 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 71 ms 10232 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 84472 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 110 ms 84624 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1111 ms 84984 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 107 ms 85180 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1603 ms 84764 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 742 ms 84600 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1147 ms 84984 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 1469 ms 84856 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1430 ms 84956 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1169 ms 84856 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845