oj.uz

답안 #93342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93342 2019-01-07T16:02:13 Z RAkhshon K개의 묶음 (IZhO14_blocks) C++14
53 / 100
 1000 ms 552 KB 
#include<bits/stdc++.h>
#define ll long long
#define fr first
#define se second
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
using namespace std;
ll a[101101], dp[111][111];
int main(){
     ///freopen("A.in", "r", stdin);
    ///freopen("A.out", "w", stdout);
    ios;
    ll n, m;
    cin>>n>>m;
    for(ll i = 1; i <= n; i ++){
        cin>>a[i];
    }
    for(ll i = 1; i <= n; i ++){
        dp[1][i]=max(dp[1][i-1],a[i]);
    }
    for(ll k = 2; k <= m; k ++){
        for(ll i = k; i <= n; i ++){
            ll mx = a[i];
            dp[k][i]=dp[k-1][i-1]+mx;
            for(ll j = i; j >= k; j --){
                mx=max(mx,a[j]);
                dp[k][i]=min(dp[k][i],dp[k-1][j-1]+mx);
                }
               ///cout<<dp[k][i]<<' ';
        }
    }
    ///cout<<endl;
    cout<<dp[m][n];
  return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 420 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 372 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1069 ms 552 KB Time limit exceeded
2 Halted 0 ms 0 KB -