oj.uz

Submission #551654

# Submission time Handle Problem Language Result Execution time Memory
551654 2022-04-21T09:10:48 Z Carmel_Ab1 Split the sequence (APIO14_sequence) C++17
100 / 100
 1639 ms 86144 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
vl dp,prv,pref;

vvi opt;

void calc(int l,int r,int optl,int optr,int k){
    if(l>r)return;
    pl ans={-1,-1};

    int m=(l+r)/2;
    for(int i=optl; i<=min(m,optr); i++)
        ans=max(ans, {pref[m]*pref[i-1]-pref[i-1]*pref[i-1]+prv[i-1] ,i});

    opt[m][k]=ans.second;
    dp[m]=ans.first;
    calc(l,m-1,optl,ans.second,k);
    calc(m+1,r,ans.second,optr,k);
}

void solve() {
    int n,k;
    cin >> n >> k;
    vl a(n);
    read(a);

    reverse(all(a));
    a.pb(-1);
    reverse(all(a));

    assert(*max_element(all(a))<=1e4);

    pref.resize(n+1);
    opt.resize(n+1,vi(k+1,-1));

    for(int i=1; i<=n; i++)
        pref[i]=pref[i-1]+a[i];





    dp.resize(n+1);
    prv.resize(n+1);


    for(int j=1; j<=k; j++) {
        calc(1,n,1,n,j);
        prv=dp;
    }

    cout << dp[n] << "\n";

    int cur=n;
    for(int i=k; i>=1; i--){
        cout << opt[cur][i]-1 << " ";
        cur=opt[cur][i]-1;
    }
}
/*
 7 3
4 1 3 4 0 2 3
 */

Compilation message

sequence.cpp: In function 'void usaco(std::string)':
sequence.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 340 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 8 ms 1108 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 340 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1220 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 980 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1188 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1108 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 468 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 596 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 1188 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 65 ms 8916 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 1236 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 75 ms 5736 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 72 ms 6476 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 62 ms 6996 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 59 ms 5844 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 62 ms 6476 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 85 ms 8108 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 8900 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 45 ms 9104 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1058 ms 86144 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 36 ms 9412 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1639 ms 85836 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1099 ms 62356 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 941 ms 67336 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 838 ms 56180 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1061 ms 62504 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1245 ms 78164 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845