oj.uz

답안 #1082245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082245 2024-08-31T01:10:59 Z ByeWorld Bigger segments (IZhO19_segments) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 2e5+15;
const int INF = 1e9+10;
const int MOD = 1e9+7;

/*
dp[i] : max segment [1..i]
pref[i] : prefix sum [1..i]
opt[i] : min last segment untuk mendapatkan dp[i]

for (int i=1;i<=N;i++) {
    dp[i] = dp[i-1];
    opt[i] = opt[i-1]+a[i];
    for (int j=i-1;j>=0;j--) {
        if (dp[j] != dp[i-1]) break;
        if (opt[j] <= pref[i]-pref[j]) {
            dp[i] = dp[j]+1;
            opt[i] = pref[i]-pref[j];
            break;
        }
    }
}
*/
int n;
int a[MAXN], dp[MAXN], pr[MAXN], opt[MAXN];

signed main(){
    cin >> n;
    for(int i=1; i<=n; i++){ cin >> a[i]; pr[i] = pr[i-1]+a[i]; }
    for(int i=1; i<=n; i++){
        dp[i] = dp[i-1];
        opt[i] = opt[i-1]+a[i];
        for(int j=i-1; j>=0; j--){
            if(dp[i] != dp[j]) continue;
            if(opt[j] <= pr[i]-pr[j]){
                dp[i] = dp[j]+1;
                opt[i] = pr[i]-pr[j];
                break;
            }
        }
    }
    cout << dp[n] << '\n';
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
10 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 348 KB Output is correct
3 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
10 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 348 KB Output is correct
3 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -