oj.uz

답안 #930145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930145 2024-02-18T16:59:59 Z takeonicky Stove (JOI18_stove) C++14
20 / 100
 36 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
int main(){
	int n, k;
	cin>>n>>k;
	int a[n];
	for(int i=0; i<n; i++){
		cin>>a[i];
	}
	long long ans = INF;
	for(int bit=1; bit<int(pow(2, n)); bit++){
		if(__builtin_popcount(bit) > k || (bit & 1) == 0) continue;
		long long now = a[n-1]-a[0]+1;
		for(int i=1; i<n; i++){
			if((bit & (1 << i)) > 0){
				now -= a[i]-a[i-1]-1;
			}
		}
		ans = min(ans, now);
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 36 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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