oj.uz

답안 #470682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470682 2021-09-05T03:27:56 Z ymm 수열 (APIO14_sequence) C++17
100 / 100
 625 ms 87184 KB 
///
///   ♪ Pizza mozzarella rella rella rella... ♪
///

#define _USE_MATH_DEFINES
#define FAST ios::sync_with_stdio(false),cin.tie(0);
#include <bits/stdc++.h>
#define Loop(x, l, r) for(int x = (l); x < (r); ++x)
#define LoopR(x, l, r) for(int x = (r)-1; x >= (l); --x)
#define all(x) x.begin(), x.end()
#define Kill(x) exit((cout << (x) << '\n', 0))
#define YN(flag) ((flag)? "YES": "NO")
#define F first
#define S second
typedef          long long   ll;
typedef unsigned long long  ull;
typedef std::pair<int,int>  pii;
typedef std::pair<ll ,ll >  pll;
using namespace std;

const int N = 100'010;
const int K = 210;
ll dp0[N], dp1[N];
int sp[N][K];
ll a[N];
int n, k;

inline ll ival(pll p, ll x){return p.F*x + p.S;}

int main()
{
    FAST;
    cin >> n >> k;
    Loop(i,0,n) cin >> a[i];
    Loop(i,1,N) dp0[i] = -1e18;
    vector<pair<pll, int>> v(N);
    Loop(j,1,k+2)
    {
        v.clear();
        dp1[0] = 0;
        v.emplace_back(pll{0, 0}, 0);
        int pv = 0;
        ll x = 0;
        Loop(i,0,n)
        {
            x += a[i];
            while(pv+1 < v.size() && ival(v[pv].F, x) <= ival(v[pv+1].F, x)) ++pv;
            dp1[i+1] = ival(v[pv].F, x);
            sp[i+1][j] = v[pv].S;
            pll p = {x, dp0[i+1]-x*x};
            while(v.size() > 1)
            {
                pll q1 = v[v.size()-1].F;
                pll q2 = v[v.size()-2].F;
                if(q1 == p || __int128(q1.S-p.S)*(p.F-q2.F) < __int128(q2.S-p.S)*(p.F-q1.F)) v.pop_back();
                else break;
            }
            v.emplace_back(p,i+1);
            pv = min(pv, (int)v.size()-1);
        }
        Loop(i,0,N) dp0[i] = dp1[i];
    }
    cout << dp0[n] << '\n';
    for(int j = k+1; j >= 2; --j)
    {
        cout << sp[n][j] << ' ';
        n = sp[n][j];
    }
    cout << '\n';
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:47:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             while(pv+1 < v.size() && ival(v[pv].F, x) <= ival(v[pv+1].F, x)) ++pv;
      |                   ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11852 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 11724 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 49 ms 11724 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 11840 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 39 ms 11724 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 44 ms 11852 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 45 ms 11724 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 37 ms 11764 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 45 ms 11756 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 53 ms 11820 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 87148 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 53 ms 87088 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 566 ms 87144 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 66 ms 87120 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 625 ms 87136 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 488 ms 87080 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 468 ms 87116 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 399 ms 87184 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 416 ms 87108 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 512 ms 87116 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845