oj.uz

Submission #42048

# Submission time Handle Problem Language Result Execution time Memory
42048 2018-02-22T09:10:41 Z OneSubmissionMan Split the sequence (APIO14_sequence) C++11
100 / 100
 784 ms 84092 KB 
# include <bits/stdc++.h>

# define F first
# define S second
# define mp make_pair
// everything go according to my plan
# define pb push_back
# define sz(a) (int)(a.size())
# define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
# define y1    Y_U_NO_y1
# define left  Y_U_NO_left
# define right Y_U_NO_right

using namespace std;

typedef pair <int, int> pii;
typedef long long ll;
typedef long double ld;

const int Mod = (int)1e9 + 7;
const int MX = 1073741822;
const ll MXLL = 4e18;
const int Sz = 1110111;
// a pinch of soul
inline void Read_rap () {
  ios_base :: sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
}
inline void randomizer3000 () {
  unsigned int seed;
  asm ("rdtsc" : "=A"(seed));
  srand (seed);
}
void files (string problem) {
  if (fopen ((problem + ".in").c_str(),"r")) {
    freopen ((problem + ".in").c_str(),"r",stdin);
    freopen ((problem + ".out").c_str(),"w",stdout);
  }
}
void localInput (string in = "s") {
  if (fopen (in.c_str(), "r"))
    freopen (in.c_str(), "r", stdin);
  else {
    cerr << "Input file not found" << endl;
  }
}    
const int K = 200 + 1;
const int N = 1e5 + 1;

int n;
int k;

ll pref[Sz];

int a[Sz];
             
int pr[K][N];

struct CHT {
  struct line {
    ll k, b;      
    ll get (ll x) {
      return k * x + b;
    }
  };
  vec<line> r;
  vec<int> id;
  int ptr;

  CHT() : ptr(0) {}
  void clear() {
    r.clear();
    id.clear();
    ptr = 0;
  }  
  ld intersection (line &a, line &b) {
    return ((ld)b.b - a.b) / ((ld)a.k - b.k);
  }       
  void add_line (line last, int Id) {
    while (sz(r) >= 2 && intersection (r[sz(r) - 2], r[sz(r) - 1]) > intersection (r[sz(r)-2], last)) {
      r.pop_back();
      id.pop_back();
    }                       
    r.pb (last);         
    ptr = min (ptr, sz(r)-1);
    id.pb (Id);
  }
  pair <ll, int> get2 (ll x, vec<line> &a) {
    int l = 0, r = sz(a)-2, ans = sz(a)-1;
    while (l <= r) {
      int mid = (l+r) >> 1;
      if (intersection (a[mid], a[mid + 1]) >= x)
        r = mid-1, ans = mid;
      else
        l = mid+1;
    }             
    return {a[ans].get(x), id[ans]};
  }  
  pair <ll, int> get (ll x) {   
    ptr = min (ptr, sz(r) - 1);
    while (ptr + 1 < sz(r) && intersection (r[ptr], r[ptr + 1]) < x)
      ptr++;
    return {r[ptr].get (x), id[ptr]};
  }
  void show() {   
    cout << endl;
    for (int i = 0; i < sz(r); i++) 
      cout << r[i].k << ' ' << r[i].b << "  ";
    cout << endl;
    cout << "X: ";
    for (int i = 0; i < sz(r) - 1; i++)
      cout << intersection (r[i], r[i + 1]) << ' ';
    cout << endl;
  }
};

int main()
{
  Read_rap();
  //localInput();
  cin >> n >> k;   
  for (int i = 1; i <= n; i++)
    cin >> a[i];

  for (int i = 1; i <= n; i++)
    pref[i] = pref[i - 1] + a[i]; 
  
  ll dp[n + 2] = {0}, nw[n + 2] = {0};
  CHT T;
  for (int i = 1; i <= k; i++) {
    T.clear();
    T.add_line ({pref[i], -pref[i] * pref[i] + dp[i]}, i);
    for (int j = i + 1; j <= n; j++) {
      if (j > i + 1 && pref[j] == pref[j - 1]) {
        nw[j] = nw[j - 1];
        pr[i][j] = pr[i][j - 1];
        continue;
      }  
      tie (nw[j], pr[i][j]) = T.get (pref[j]);
      if (pref[j] != pref[j - 1])
        T.add_line ( {pref[j], -pref[j] * pref[j] + dp[j]}, j);
    }            
    //T.show();
    for (int j = 1; j <= n; j++)
      dp[j] = nw[j];  
  }
  cout << dp[n] << endl;

  for (int i = k, j = n; i >= 1; ) {
    j = pr[i][j]; 
    i--;     
    assert (j);
    cout << j << ' ';
  }
  return 0;
}










// Coded by Z..

Compilation message

sequence.cpp: In function 'void files(std::__cxx11::string)':
sequence.cpp:37:50: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen ((problem + ".in").c_str(),"r",stdin);
                                                  ^
sequence.cpp:38:52: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen ((problem + ".out").c_str(),"w",stdout);
                                                    ^
sequence.cpp: In function 'void localInput(std::__cxx11::string)':
sequence.cpp:43:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen (in.c_str(), "r", stdin);
                                     ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2288 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 2288 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 67 ms 9900 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 9900 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 47 ms 9900 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 51 ms 9900 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 72 ms 9900 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 48 ms 9900 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 50 ms 9900 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 71 ms 9900 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 9900 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 9900 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 629 ms 84092 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 84092 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 784 ms 84092 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 534 ms 84092 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 718 ms 84092 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 482 ms 84092 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 497 ms 84092 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 624 ms 84092 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845