Submission #345366

# Submission time Handle Problem Language Result Execution time Memory
345366 2021-01-07T08:00:37 Z shmad K blocks (IZhO14_blocks) C++14
18 / 100
1000 ms 504 KB
#include <bits/stdc++.h>
 
#define nl '\n'
#define pb push_back
#define E exit(0)
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define sz(s) (s).size()

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
 
const int N=1e6+5;
const int INF=1e9+7;
const int eps=1e-6;

int mn=INF,a[101],n;

void rec (int pos, int k, int mx=0, int sum=0) {
	if (pos>n && k!=0) return;
	if (pos>n && k==0) { mn=min(mn,sum); return; }
	if (k<0) return;
	rec(pos+1,k-1,a[pos],sum+a[pos]);
	rec(pos+1,k,max(mx,a[pos]),sum-mx+max(mx,a[pos]));
}

void solve() {
	int k;
	cin>>n>>k;
	for (int i=1;i<=n;i++) {
		cin>>a[i];
	}
	rec(1,k);
	cout<<mn;
}

ll test=1;

int main () {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
	cin.tie();
//	cin>>test;
    while (test--) solve();
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Execution timed out 1022 ms 364 KB Time limit exceeded
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 392 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 8 ms 364 KB Output is correct
15 Correct 8 ms 364 KB Output is correct
16 Correct 8 ms 492 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 6 ms 364 KB Output is correct
19 Correct 8 ms 392 KB Output is correct
20 Correct 8 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Execution timed out 1022 ms 364 KB Time limit exceeded
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Execution timed out 1022 ms 364 KB Time limit exceeded
14 Halted 0 ms 0 KB -