Submission #952572

#	Time	Username	Problem	Language	Result	Execution time	Memory
952572		dilanyan	Bigger segments (IZhO19_segments)	C++17	27 / 100	1 ms	604 KiB

segments

//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------Kargpefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
 
void KarginSet(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    if (name.size()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1000000007;
const ll inf = 1e15;
 
//-------------------KarginCode-----------------------\\ 
 
const int N = 505, M = 1000005;
ll a[N];
pair<ll,int> dp[N];

void KarginSolve() {
    int n; cin >> n;
    if (n <= 5000) {
        for (int i = 1;i <= n;i++) cin >> a[i];
        dp[1] = { a[1],1 };
        for (int i = 2;i <= n;i++) {
            ll sum = a[i];
            for (int j = i - 1;j >= 1;j--) {
                if (dp[j].second > dp[i].second) {
                    dp[i].first = dp[j].first + sum;
                    dp[i].second = dp[j].second;
                }
                else if (dp[j].second == dp[i].second) {
                    dp[i].first = min(dp[i].first, dp[j].first + sum);
                }
                if (sum >= dp[j].first) {
                    if (dp[j].second + 1 > dp[i].second) {
                        dp[i].second = dp[j].second + 1;
                        dp[i].first = sum;
                    }
                    else if (dp[j].second + 1 == dp[i].second) {
                        dp[i].first = min(dp[i].first, sum);
                    }
                }
                sum += a[j];
            }
        }
        cout << dp[n].second << '\n';
    }
}

int main() {
    KarginSet();
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message (stderr)

segments.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
segments.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
segments.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
segments.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
segments.cpp: In function 'void KarginSet(std::string)':
segments.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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