oj.uz

Submission #289265

# Submission time Handle Problem Language Result Execution time Memory
289265 2020-09-02T13:51:08 Z NaimSS Split the sequence (APIO14_sequence) C++14
100 / 100
 1157 ms 91788 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}

const int N = 100100;
ll pre[N],a[N];
ll dp[N][2];
int go[N][210];
typedef pair<ll,ll> pll;
#define pii pll
struct coisa{
  pll p;
  int id;
  coisa(){}
  coisa(pll p,int id):p(p),id(id){}
};
struct cht {
    int p = 0;
    vector<coisa> func;
    
    //Cuidado com OVERFLOW
    bool bad(pii A, pii B, pii C){

    return (ll)(B.ss - A.ss)*(A.ff - C.ff) > (ll)(C.ss - A.ss)*(A.ff - B.ff);
    }
    ll f(pll r, ll x){
        return 1ll*r.ff*x + r.ss;
    }
    void addline(pii r,int id) {
      swap(r.ff,r.ss);

        if(!func.empty() and func.back().p.ff == r.ff){
            if(func.back().p.ss <= r.ss) return;
            func.pop_back();
            if(p == sz(func)) p--;
        }
        while(func.size() >= 2 && bad(func[sz(func) - 2].p, func[sz(func) - 1].p, r)){
            func.pop_back();
            if(p == sz(func)) p--;
        }
        func.push_back(coisa(r,id));
    }
    pll queryMin(ll x){
      if(func.empty() || p >= sz(func))return pll(0,0);
        
        while(p < sz(func) - 1 && f(func[p].p, x) > f(func[p + 1].p, x)) p++;
        return pll(f(func[p].p, x),func[p].id);
    }

};
int32_t main(){
  fastio;
  int n,K;
  cin >> n >> K;

  for(int i=1;i<=n;i++){
    cin >> a[i];
    pre[i] = a[i] + pre[i-1];
  }
  for(int k=1;k<=K;k++){
    int cur = k&1,last = cur^1;
    cht CHT;

    //CHT.addline(pll(0,0),0);
    CHT.addline(pll( - (dp[k][last] - 1ll * pre[k]*pre[k]), - pre[k]),k);

    for(int i=k+1;i<=n;i++){
     
        pll best = CHT.queryMin( pre[i]);
        if(best.ss == 0)best.ss = i-1;
        go[i][k] = best.ss;
        dp[i][cur] = - best.ff;  
      
   
      CHT.addline(pll(-  (dp[i][last] - 1ll * pre[i]*pre[i]), - pre[i]),i);
    }
  }
  cout << dp[n][K&1] << endl;
  vi res;
  int cur = n;
  for(int i=K;i>=1;i--){
    res.pb(go[cur][i]);
    cur = go[cur][i];
  }
  for(int x : res)cout << x<<" ";
  cout<<endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9224 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 9280 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 86 ms 9572 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 9504 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 48 ms 9336 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 52 ms 9276 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 9564 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 57 ms 9892 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 64 ms 9680 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 81 ms 9560 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 90644 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 63 ms 90900 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1157 ms 91788 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 64 ms 91668 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1137 ms 90960 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 473 ms 88976 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 921 ms 91656 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 722 ms 91436 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 808 ms 91496 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1032 ms 91548 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845