oj.uz

답안 #671875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671875 2022-12-14T06:27:25 Z Baytoro K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 37 ms 82548 KB 
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=1e9+7;
int n,k;
int dp[100005][105],a[100005],mx[100005][105];
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	memset(dp,0x3f3f3f3f,sizeof(dp));
	dp[0][0]=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=min(k,i);j++){
			dp[i][j]=dp[i-1][j-1]+a[i];
			mx[i][j]=a[i];
			if(dp[i][j]>dp[i-1][j]-mx[i-1][j]+max(mx[i-1][j],a[i])){
				dp[i][j]=dp[i-1][j]-mx[i-1][j]+max(mx[i-1][j],a[i]);
				mx[i][j]=max(mx[i-1][j],a[i]);
			}
		}
	}
	cout<<dp[n][k];
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

blocks.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main(){
      | ^~~~
blocks.cpp: In function 'void fopn(std::string)':
blocks.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 82516 KB Output is correct
2 Correct 30 ms 82504 KB Output is correct
3 Correct 30 ms 82496 KB Output is correct
4 Correct 31 ms 82472 KB Output is correct
5 Correct 32 ms 82400 KB Output is correct
6 Correct 37 ms 82508 KB Output is correct
7 Correct 30 ms 82516 KB Output is correct
8 Correct 35 ms 82508 KB Output is correct
9 Correct 31 ms 82508 KB Output is correct
10 Correct 31 ms 82488 KB Output is correct
11 Incorrect 30 ms 82476 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 82384 KB Output is correct
2 Correct 30 ms 82480 KB Output is correct
3 Correct 30 ms 82516 KB Output is correct
4 Correct 30 ms 82432 KB Output is correct
5 Correct 30 ms 82440 KB Output is correct
6 Correct 34 ms 82548 KB Output is correct
7 Correct 34 ms 82500 KB Output is correct
8 Correct 31 ms 82448 KB Output is correct
9 Correct 32 ms 82436 KB Output is correct
10 Correct 32 ms 82524 KB Output is correct
11 Incorrect 32 ms 82500 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 82516 KB Output is correct
2 Correct 30 ms 82504 KB Output is correct
3 Correct 30 ms 82496 KB Output is correct
4 Correct 31 ms 82472 KB Output is correct
5 Correct 32 ms 82400 KB Output is correct
6 Correct 37 ms 82508 KB Output is correct
7 Correct 30 ms 82516 KB Output is correct
8 Correct 35 ms 82508 KB Output is correct
9 Correct 31 ms 82508 KB Output is correct
10 Correct 31 ms 82488 KB Output is correct
11 Incorrect 30 ms 82476 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 82516 KB Output is correct
2 Correct 30 ms 82504 KB Output is correct
3 Correct 30 ms 82496 KB Output is correct
4 Correct 31 ms 82472 KB Output is correct
5 Correct 32 ms 82400 KB Output is correct
6 Correct 37 ms 82508 KB Output is correct
7 Correct 30 ms 82516 KB Output is correct
8 Correct 35 ms 82508 KB Output is correct
9 Correct 31 ms 82508 KB Output is correct
10 Correct 31 ms 82488 KB Output is correct
11 Incorrect 30 ms 82476 KB Output isn't correct
12 Halted 0 ms 0 KB -