Submission #1184121

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184121		hoa208	Bigger segments (IZhO19_segments)	C++20	37 / 100	4 ms	400 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N = 500003;
pa dp[N];
ll a[N], n;
void hbmt() {
    cin >> n;
    assert(n <= 5000);
    FOR(i, 1, n) {
        cin >> a[i];
        dp[i] = {-INF, INF};
    }
    dp[0] = {0, 0};
    FOR(i, 1, n) {
        ll sum = 0;
        FORD(j, i, 1) {
            sum += a[j];
            if(sum >= dp[j - 1].se) {
                if(dp[j - 1].fi + 1 > dp[i].fi) {
                    dp[i] = {dp[j - 1].fi + 1, sum};
                }
            }
        }
    }
    cout << dp[n].fi << '\n';

}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.out", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen("hbmt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen("hbmt.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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