oj.uz

Submission #869332

# Submission time Handle Problem Language Result Execution time Memory
869332 2023-11-04T04:23:38 Z prohacker Split the sequence (APIO14_sequence) C++14
71 / 100
 51 ms 131072 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define int long long

using namespace std;

const int N = 1e5+10;
const int INF = INT_MAX;
const int mod = 1e9+7;

int n,m;
ll dp[N][205],ans;
int s[N],trace[N][205];
stack<int> st;
int pointer;
vector<ll> M;
vector<ll> B;
vector<int> idx;

bool bad(int l1,int l2,int l3) {
    return (ld)(B[l3]-B[l1])/(B[l2]-B[l1]) <= (ld)(M[l1]-M[l3])/(M[l1]-M[l2]);
}

void add(ll m,ll b, int id) {
    M.push_back(m);
    B.push_back(b);
    idx.push_back(id);
    while(M.size() >= 3 and bad(M.size()-3,M.size()-2,M.size()-1)) {
        M.erase(M.end()-2);
        B.erase(B.end()-2);
        idx.erase(idx.end()-2);
    }
}

pair<ll,int> query(ll x) {
    if (pointer >= M.size()) {
        pointer = M.size()-1;
    }
    while(pointer < M.size()-1 and 1LL*M[pointer+1]*x+B[pointer+1] > 1LL*M[pointer]*x+B[pointer]) {
        pointer++;
    }
    return {1LL*M[pointer]*x+B[pointer],idx[pointer]};
}

signed main()
{
    if (fopen("task.inp", "r")) {
        freopen("task.inp", "r", stdin);
        freopen("task.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i++) {
        int x; cin >> x;
        s[i] = s[i-1] + x;
    }
    for(int k = 1 ; k <= m ; k++) {
        for(int i = k ; i <= n ; i++) {
            add(s[i-1],dp[i-1][k-1]-1LL*s[i-1]*s[n],i-1);
            pair<ll,int> val = query(s[i]);
            dp[i][k] = val.first+1LL*s[i]*(s[n]-s[i]);
            trace[i][k] = val.second;
        }
        B.clear();
        M.clear();
        idx.clear();
        pointer = 0;
    }
    int id;
    ans = -1;
    for(int i = 1 ; i <= n ; i++) {
        if(dp[i][m] > ans) {
            ans = dp[i][m];
            id = i;
        }
    }
    cout << ans << '\n';
    while(m > 0) {
        cout << id << " ";
        id = trace[id][m];
        m--;
    }
    return 0;
}

Compilation message

sequence.cpp: In function 'std::pair<long long int, long long int> query(long long int)':
sequence.cpp:37:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     if (pointer >= M.size()) {
      |         ~~~~~~~~^~~~~~~~~~~
sequence.cpp:40:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     while(pointer < M.size()-1 and 1LL*M[pointer+1]*x+B[pointer+1] > 1LL*M[pointer]*x+B[pointer]) {
      |           ~~~~~~~~^~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("task.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:83:12: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |         id = trace[id][m];
      |         ~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2908 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2908 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2908 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2908 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 2908 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 2904 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2908 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2904 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 5724 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 5724 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 5724 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 5724 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 7 ms 5816 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 5816 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 5 ms 5724 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 5724 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 5724 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 5724 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 34652 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 34652 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 38 ms 34908 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 34908 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 37 ms 34652 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 44 ms 34652 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 39 ms 35044 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 28 ms 35036 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 34 ms 34908 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 51 ms 34908 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -