Submission #952565

#	Time	Username	Problem	Language	Result	Execution time	Memory
952565		dilanyan	Bigger segments (IZhO19_segments)	C++17	27 / 100	35 ms	2448 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];
ll dp[N][N];

void KarginSolve() {
    int n; cin >> n;
    // if (n <= 20) {
    //     for (int i = 0;i < n;i++) cin >> a[i];
    //     int ans = 1;
    //     for (int i = 0;i < (1 << n);i++) {
    //         if(!(i & (1 << (n - 1)))) continue; 
    //         ll sum = 0, lastsum = 0;
    //         int c = 0;
    //         bool flag = true;
    //         for (int j = 0;j < n;j++) {
    //             sum += a[j];
    //             if (i & (1 << j)) {
    //                 if (sum < lastsum) {
    //                     flag = false;
    //                     break;
    //                 }
    //                 c++;
    //                 lastsum = sum, sum = 0;
    //             }   
    //         }
    //         if (flag) {
    //             ans = max(ans, c);
    //         }
    //     }
    //     cout << ans << '\n';
    // }
    // else 
    if (n <= 500) {
        for (int i = 1;i <= n;i++) cin >> a[i];
        for (int i = 1;i <= n;i++) {
            for (int j = 1;j <= n;j++) {
                dp[i][j] = inf;
            }
        }
        dp[1][1] = a[1];
        for (int i = 2;i <= n;i++) {
            ll sum = a[i];
            for (int j = i - 1;j > 0;j--) {
                for (int x = j;x > 0;x--) {
                    dp[i][x] = min(dp[i][x], dp[j][x] + sum);
                    if (sum >= dp[j][x]) dp[i][x + 1] = min(sum, dp[i][x + 1]);
                }
                sum += a[j];
            }
        }
        for (int i = n;i >= 1;i--) {
            if (dp[n][i] != inf) {
                cout << i << '\n';
                return;
            }
        }
    }
}

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