oj.uz

답안 #952565

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952565 2024-03-24T09:03:47 Z dilanyan Bigger segments (IZhO19_segments) C++17
27 / 100
 35 ms 2448 KB 
//-------------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

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.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 22 ms 2396 KB Output is correct
17 Correct 22 ms 2448 KB Output is correct
18 Correct 24 ms 2396 KB Output is correct
19 Correct 31 ms 2396 KB Output is correct
20 Correct 34 ms 2396 KB Output is correct
21 Correct 23 ms 2396 KB Output is correct
22 Correct 13 ms 1884 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 24 ms 2400 KB Output is correct
25 Correct 24 ms 2260 KB Output is correct
26 Correct 35 ms 2392 KB Output is correct
27 Correct 26 ms 2396 KB Output is correct
28 Correct 25 ms 2396 KB Output is correct
29 Correct 35 ms 2396 KB Output is correct
30 Correct 34 ms 2428 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 22 ms 2396 KB Output is correct
17 Correct 22 ms 2448 KB Output is correct
18 Correct 24 ms 2396 KB Output is correct
19 Correct 31 ms 2396 KB Output is correct
20 Correct 34 ms 2396 KB Output is correct
21 Correct 23 ms 2396 KB Output is correct
22 Correct 13 ms 1884 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 24 ms 2400 KB Output is correct
25 Correct 24 ms 2260 KB Output is correct
26 Correct 35 ms 2392 KB Output is correct
27 Correct 26 ms 2396 KB Output is correct
28 Correct 25 ms 2396 KB Output is correct
29 Correct 35 ms 2396 KB Output is correct
30 Correct 34 ms 2428 KB Output is correct
31 Incorrect 0 ms 348 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 22 ms 2396 KB Output is correct
17 Correct 22 ms 2448 KB Output is correct
18 Correct 24 ms 2396 KB Output is correct
19 Correct 31 ms 2396 KB Output is correct
20 Correct 34 ms 2396 KB Output is correct
21 Correct 23 ms 2396 KB Output is correct
22 Correct 13 ms 1884 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 24 ms 2400 KB Output is correct
25 Correct 24 ms 2260 KB Output is correct
26 Correct 35 ms 2392 KB Output is correct
27 Correct 26 ms 2396 KB Output is correct
28 Correct 25 ms 2396 KB Output is correct
29 Correct 35 ms 2396 KB Output is correct
30 Correct 34 ms 2428 KB Output is correct
31 Incorrect 0 ms 348 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 22 ms 2396 KB Output is correct
17 Correct 22 ms 2448 KB Output is correct
18 Correct 24 ms 2396 KB Output is correct
19 Correct 31 ms 2396 KB Output is correct
20 Correct 34 ms 2396 KB Output is correct
21 Correct 23 ms 2396 KB Output is correct
22 Correct 13 ms 1884 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 24 ms 2400 KB Output is correct
25 Correct 24 ms 2260 KB Output is correct
26 Correct 35 ms 2392 KB Output is correct
27 Correct 26 ms 2396 KB Output is correct
28 Correct 25 ms 2396 KB Output is correct
29 Correct 35 ms 2396 KB Output is correct
30 Correct 34 ms 2428 KB Output is correct
31 Incorrect 0 ms 348 KB Output isn't correct
32 Halted 0 ms 0 KB -