oj.uz

답안 #989091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989091 2024-05-27T13:46:21 Z armashka Bigger segments (IZhO19_segments) C++17
27 / 100
 40 ms 2444 KB 
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
const int N = 1e6 + 10;
const int M = 2e7 + 5;
const int B = 316;
const ll msize = 2;
const ll mod1 = 1e9 + 7;
const ll mod2 = 998244353;
const long double Phi = acos(-1);
const long long inf = 2e18;
const vector <pair<int, int>> dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

ll binmul(ll x, ll ti, ll m);
ll binpow(ll x, ll ti, ll m);

ll n, a[505], dp[505][505], pref[505];

const void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++ i) cin >> a[i], pref[i] = pref[i - 1] + a[i];

    for (int i = 0; i <= n; ++ i) {
        for (int j = 0; j <= n; ++ j) {
            dp[i][j] = -inf;
        }
    }

    for (int i = 1; i <= n; ++ i) dp[1][i] = 1;

    for (int i = 2; i <= n; ++ i) {
        for (int j = i; j >= 1; -- j) {
            for (int k = j - 1; k >= 1; -- k) {
                ll sum1 = pref[i] - pref[j - 1];
                ll sum2 = pref[j - 1] - pref[k - 1];

                if (sum2 <= sum1) {
                    dp[j][i] = max(dp[j][i], dp[k][j - 1] + 1);
                }
            }  
        }
    }

    ll ans = 0;
    for (int i = 1; i <= n; ++ i) ans = max(ans, dp[i][n]);
    cout << ans;
}  
                                  
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));

    // file("maze");

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tt = 1;
    // cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        solve();
    }

    #ifndef ONLINE_JUDGE
    cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif

    return 0;
} 


// Template functions
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)(res *= x)%=m;(x*=x)%=m;ti >>= 1; x %= m; res %= m;} return res;}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 34 ms 2396 KB Output is correct
17 Correct 38 ms 2396 KB Output is correct
18 Correct 34 ms 2392 KB Output is correct
19 Correct 34 ms 2396 KB Output is correct
20 Correct 33 ms 2392 KB Output is correct
21 Correct 34 ms 2392 KB Output is correct
22 Correct 23 ms 2392 KB Output is correct
23 Correct 8 ms 1660 KB Output is correct
24 Correct 34 ms 2228 KB Output is correct
25 Correct 34 ms 2392 KB Output is correct
26 Correct 40 ms 2396 KB Output is correct
27 Correct 30 ms 2396 KB Output is correct
28 Correct 36 ms 2444 KB Output is correct
29 Correct 36 ms 2420 KB Output is correct
30 Correct 33 ms 2396 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 34 ms 2396 KB Output is correct
17 Correct 38 ms 2396 KB Output is correct
18 Correct 34 ms 2392 KB Output is correct
19 Correct 34 ms 2396 KB Output is correct
20 Correct 33 ms 2392 KB Output is correct
21 Correct 34 ms 2392 KB Output is correct
22 Correct 23 ms 2392 KB Output is correct
23 Correct 8 ms 1660 KB Output is correct
24 Correct 34 ms 2228 KB Output is correct
25 Correct 34 ms 2392 KB Output is correct
26 Correct 40 ms 2396 KB Output is correct
27 Correct 30 ms 2396 KB Output is correct
28 Correct 36 ms 2444 KB Output is correct
29 Correct 36 ms 2420 KB Output is correct
30 Correct 33 ms 2396 KB Output is correct
31 Runtime error 1 ms 600 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 34 ms 2396 KB Output is correct
17 Correct 38 ms 2396 KB Output is correct
18 Correct 34 ms 2392 KB Output is correct
19 Correct 34 ms 2396 KB Output is correct
20 Correct 33 ms 2392 KB Output is correct
21 Correct 34 ms 2392 KB Output is correct
22 Correct 23 ms 2392 KB Output is correct
23 Correct 8 ms 1660 KB Output is correct
24 Correct 34 ms 2228 KB Output is correct
25 Correct 34 ms 2392 KB Output is correct
26 Correct 40 ms 2396 KB Output is correct
27 Correct 30 ms 2396 KB Output is correct
28 Correct 36 ms 2444 KB Output is correct
29 Correct 36 ms 2420 KB Output is correct
30 Correct 33 ms 2396 KB Output is correct
31 Runtime error 1 ms 600 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 34 ms 2396 KB Output is correct
17 Correct 38 ms 2396 KB Output is correct
18 Correct 34 ms 2392 KB Output is correct
19 Correct 34 ms 2396 KB Output is correct
20 Correct 33 ms 2392 KB Output is correct
21 Correct 34 ms 2392 KB Output is correct
22 Correct 23 ms 2392 KB Output is correct
23 Correct 8 ms 1660 KB Output is correct
24 Correct 34 ms 2228 KB Output is correct
25 Correct 34 ms 2392 KB Output is correct
26 Correct 40 ms 2396 KB Output is correct
27 Correct 30 ms 2396 KB Output is correct
28 Correct 36 ms 2444 KB Output is correct
29 Correct 36 ms 2420 KB Output is correct
30 Correct 33 ms 2396 KB Output is correct
31 Runtime error 1 ms 600 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -