Submission #528758

#	Time	Username	Problem	Language	Result	Execution time	Memory
528758		dxz05	Bigger segments (IZhO19_segments)	C++14	37 / 100	1590 ms	2640 KiB

segments

//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 1222;

int dp[N];
ll sum[N], pref[N];

void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++){
        cin >> pref[i];
        pref[i] += pref[i - 1];
    }

    for (int i = 0; i < n; i++){
        for (int j = i + 1; j <= n; j++){
            if (pref[j] >= pref[i] + sum[i]){
                if (dp[j] < dp[i] + 1 || dp[j] == dp[i] + 1 && sum[j] > pref[j] - pref[i]){
                    dp[j] = dp[i] + 1;
                    sum[j] = pref[j] - pref[i];
                }
            }
        }
    }

    cout << dp[n] << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message (stderr)

segments.cpp: In function 'void solve(int)':
segments.cpp:60:61: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   60 |                 if (dp[j] < dp[i] + 1 || dp[j] == dp[i] + 1 && sum[j] > pref[j] - pref[i]){
      |                                          ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27