oj.uz

Submission #891506

# Submission time Handle Problem Language Result Execution time Memory
891506 2023-12-23T06:28:33 Z nasam Split the sequence (APIO14_sequence) C++17
100 / 100
 388 ms 86224 KB 
/*************************************
*       author: Pham Huy Khanh       *
*************************************/
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--)
#define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define CNTBIT(x) __builtin_popcountll(x)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define left ___left
#define right ___right
#define pii pair<int, int>
#define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl;
#define endl "\n"
#define NAME "main"

using namespace std;

template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; }
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; }

#define  gogobruhbruh  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

const int MOD = 1e9 + 7;

void add(int &a, int b){ if ((a += b) >= MOD) a -= MOD; }
void sub(int &a, int b){ if ((a -= b) < 0) a += MOD; }
int muti(int a, int b){ return (1LL * a * b) % MOD; }
int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; }

const int MAX = 1e5 + 7;
const int K = 2e2 + 7;
const ll INF = 1e18 + 7;

int num, lim;
ll sum[MAX], dp[MAX];
int trace[MAX][K];

struct Line {
    ll a, b;
    int id;

    Line(ll _a, ll _b, int _id){
        a = _a; b = _b; id = _id;
    }

    ll ord(ll x){
        return a * x + b;
    }
};

struct CHT {
    vector<Line> env;
    int idx;

    void init(){
        env.clear();
        idx = 0;
    }

    bool bad(Line a, Line b, Line c){
        return (double) (b.b - a.b) * (a.a - c.a) >= (double) (c.b - a.b) * (a.a - b.a);
    }

    void add(Line newLine){
        while (env.size() >= 2 && bad(env[env.size() - 2], env.back(), newLine))
            env.pop_back();
        env.eb(newLine);
    }
    
    ll getY(ll x){
        int sz = env.size();
        if (idx >= sz)
            idx = sz - 1;
        while (idx + 1 < sz && env[idx + 1].ord(x) > env[idx].ord(x))
            idx++;
        return env[idx].ord(x);
    }

    int getPos(){
        return env[idx].id;
    }
} cht;

void solve(){
    FOR (j, 2, lim){
        cht.add(Line(sum[j - 1], dp[j - 1] - sum[j - 1] * sum[j - 1], j - 1));
        FOR (i, j, num){
            ll DP = cht.getY(sum[i]);
            trace[i][j] = cht.getPos();
            cht.add(Line(sum[i], dp[i] - sum[i] * sum[i], i));
            dp[i] = DP;
        }
        cht.init();
    }
    cout << dp[num] << endl;
    FOD (i, lim, 2){
        num = trace[num][i];
        cout << num << ' ';
    }
}

void read(){
    cin >> num >> lim;
    lim++;
    FOR (i, 1, num)
        cin >> sum[i],
        sum[i] += sum[i - 1];
}

int main(){
    gogobruhbruh
    file("main");
    int test = 1;
    // cin >> test;
    while (test--)
      read(),
      solve();
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:121:5: note: in expansion of macro 'file'
  121 |     file("main");
      |     ^~~~
sequence.cpp:30:95: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:121:5: note: in expansion of macro 'file'
  121 |     file("main");
      |     ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 2396 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 2396 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 2396 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 2396 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 2648 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 2396 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 2396 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 2396 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 2396 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 2396 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 2396 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 2396 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 2244 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 2396 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 2396 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 2396 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2396 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 2396 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 2396 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 2392 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 2396 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 2396 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 2396 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 2396 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2652 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 2652 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2652 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2652 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 2652 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 2652 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2652 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2652 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 2904 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 4700 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 3 ms 4788 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 4696 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 4560 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 3 ms 4700 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 3 ms 4700 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 3 ms 4700 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 1 ms 4568 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 2 ms 4700 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11040 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 11120 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 25 ms 11292 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 11296 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 23 ms 11040 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 25 ms 11040 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 26 ms 11552 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 17 ms 11296 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 21 ms 11424 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 26 ms 11296 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 84932 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 21 ms 84940 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 272 ms 85968 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 19 ms 86072 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 388 ms 85200 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 260 ms 85076 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 251 ms 86224 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 184 ms 85808 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 210 ms 85452 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 266 ms 85708 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845