Submission #343991

#	Time	Username	Problem	Language	Result	Execution time	Memory
343991		IZhO_2021_I_want_Silver	Bigger segments (IZhO19_segments)	C++14	Compilation error	0 ms	0 KiB

segments

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll

const int N = (1 << 13) - 1;
const int oo = 1e15 + 5;

int n, a[N], sum[N], dp[N][N], ans, mn[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        sum[i] = sum[i-1] + a[i];
    }
    for (int i = 1; i <= n; ++i) {
        dp[i][1] = sum[i];
    }
    mn[n+1] = oo;
    for (int i = n; i >= 1; --i) {
        mn[i] = min(mn[i+1], dp[i][1] + sum[i]);
    }
    for (int k = 2; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            dp[i][k] = oo;
            int l = 1, r = i-1;
            while (l < r) {
                int mid = (l + r + 1) / 2;
                if (mn[mid] <= sum[i]) l = mid;
                else r = mid - 1;
            }
            if (mn[l] <= sum[i]) { dp[i][k] = min(dp[i][k], sum[i] - sum[l]); }
        }
        for (int i = n; i >= 1; --i) {
            mn[i] = min(mn[i+1], dp[i][k] + sum[i]);
        }
    }
    int ans = 0;
    for (int k = 1; k <= n; ++k) {
        if (dp[n][k] != oo) { ans = k; }
    }
    cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll

const int N = (1 << 13) - 1;
const int oo = 1e15 + 5;

int n, a[N], sum[N], dp[N][N], ans, mn[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        sum[i] = sum[i-1] + a[i];
    }
    for (int i = 1; i <= n; ++i) {
        dp[i][1] = sum[i];
    }
    mn[n+1] = oo;
    for (int i = n; i >= 1; --i) {
        mn[i] = min(mn[i+1], dp[i][1] + sum[i]);
    }
    for (int k = 2; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            dp[i][k] = oo;
            int l = 1, r = i-1;
            while (l < r) {
                int mid = (l + r + 1) / 2;
                if (mn[mid] <= sum[i]) l = mid;
                else r = mid - 1;
            }
            if (mn[l] <= sum[i]) { dp[i][k] = min(dp[i][k], sum[i] - sum[l]); }
        }
        for (int i = n; i >= 1; --i) {
            mn[i] = min(mn[i+1], dp[i][k] + sum[i]);
        }
    }
    int ans = 0;
    for (int k = 1; k <= n; ++k) {
        if (dp[n][k] != oo) { ans = k; }
    }
    cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

segments.cpp:81:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   81 |  main () {
      |        ^
segments.cpp:115:25: error: conflicting declaration 'typedef struct std::pair<long long int, long long int> pii'
  115 | typedef pair <int, int> pii;
      |                         ^~~
segments.cpp:22:25: note: previous declaration as 'typedef struct std::pair<int, int> pii'
   22 | typedef pair <int, int> pii;
      |                         ^~~
segments.cpp:134:11: error: redefinition of 'const ll N'
  134 | const int N = (1 << 13) - 1;
      |           ^
segments.cpp:41:11: note: 'const ll N' previously defined here
   41 | const int N = (1 << 13) - 1;
      |           ^
segments.cpp:135:11: error: redefinition of 'const ll oo'
  135 | const int oo = 1e15 + 5;
      |           ^~
segments.cpp:42:11: note: 'const ll oo' previously defined here
   42 | const int oo = 1e15 + 5;
      |           ^~
segments.cpp:137:5: error: redefinition of 'll n'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |     ^
segments.cpp:44:5: note: 'll n' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |     ^
segments.cpp:137:8: error: redefinition of 'll a [8191]'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |        ^
segments.cpp:44:8: note: 'll a [8191]' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |        ^
segments.cpp:137:14: error: redefinition of 'll sum [8191]'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |              ^~~
segments.cpp:44:14: note: 'll sum [8191]' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |              ^~~
segments.cpp:137:22: error: redefinition of 'll dp [8191][8191]'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                      ^~
segments.cpp:44:22: note: 'll dp [8191][8191]' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                      ^~
segments.cpp:137:32: error: redefinition of 'll ans'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                                ^~~
segments.cpp:44:32: note: 'll ans' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                                ^~~
segments.cpp:137:37: error: redefinition of 'll mn [8191]'
  137 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                                     ^~
segments.cpp:44:37: note: 'll mn [8191]' previously declared here
   44 | int n, a[N], sum[N], dp[N][N], ans, mn[N];
      |                                     ^~
segments.cpp:174:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  174 |  main () {
      |        ^
segments.cpp:174:2: error: redefinition of 'int main()'
  174 |  main () {
      |  ^~~~
segments.cpp:81:2: note: 'int main()' previously defined here
   81 |  main () {
      |  ^~~~