oj.uz

답안 #499015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499015 2021-12-27T04:23:40 Z tmn2005 K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 460 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],arr[101][N],b[101][N],c;

main(){
	NeedForSpeed
    cin>>n>>m;
    for(int i=1; i<=n; i++){
    	cin>>a[i];
    	mx = max(mx, a[i]);
    	o += a[i];
    	arr[i][i] = o;
    	b[i][i] = a[i];
    	arr[1][i] = mx;
	}
	for(int i=2; i<=m; i++){
		for(int j=i+1; j<=n; j++){
			if(arr[i-1][j-1] + a[j] <= (b[i][j-1] >= a[j] ? arr[i][j-1] : arr[i][j-1] + a[j]-b[i][j-1])){
				arr[i][j] = arr[i-1][j-1] + a[j];
				b[i][j] = a[j];
			}
			else{
				if(b[i][j-1] >= a[j]){
					arr[i][j] = arr[i][j-1];
					b[i][j] = b[i][j-1];
				}
				else{
					arr[i][j] = arr[i][j-1] + a[j] - b[i][j-1];
					b[i][j] = a[j];
				}
			}
		}
	}
	cout<<arr[m][n];




	return 0;
}

Compilation message

blocks.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Incorrect 1 ms 460 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Incorrect 0 ms 460 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Incorrect 1 ms 460 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Incorrect 1 ms 460 KB Output isn't correct
12 Halted 0 ms 0 KB -