Submission #1230063


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
#include<string>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define nrep(i,a,b) for(int i=a;i<b;i++)
#define INF 1145141919810893931
using namespace std;

ll solv(vector<ll> a, ll n) {
	ll ret = 0;
	vector<ll> vec;
	ll count = 0;
	ll maxi = a[0];
	bool first = true;
	while (n) {
		if (!first&&n & 1) {
			if (maxi >= a[count]) {
				ret += maxi - a[count] + 1;
				maxi++;
			}
		}
		else if (maxi < a[count]) {
			maxi = a[count];
		}
		n /= 2;
		count++;
		first = false;
	}return ret;
}

ll count(ll n) {
	ll count = 0;
	while (n) {
		if (n & 1) count++;
		n /= 2;
	}return count;
}

int main() {
	ll n, k; cin >> n >> k;
	vector<ll> a(n);
	ll mini = INF;
	rep(i, n) cin >> a[i];
	rep(i, pow(2, n)) {
		if (count(i) == k) {
			mini = min(mini, solv(a,i));
		}
	}cout << mini << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Buildings are Colorful!
User untan
Language C++14 (GCC 5.4.1)
Score 90
Code Size 941 Byte
Status WA
Exec Time 4 ms
Memory 384 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 120 90 / 90 0 / 140
Status
AC × 2
AC × 1
WA × 1
AC × 3
AC × 6
WA × 3
Set Name Test Cases
Sample sub0_in1.txt, sub0_in2.txt
Subtask1 sub1_in1.txt, sub1_in2.txt
Subtask2 sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Subtask3 sub0_in1.txt, sub0_in2.txt, sub1_in1.txt, sub1_in2.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt
Case Name Status Exec Time Memory
sub0_in1.txt AC 4 ms 384 KB
sub0_in2.txt AC 1 ms 256 KB
sub1_in1.txt WA 4 ms 256 KB
sub1_in2.txt AC 4 ms 256 KB
sub2_in1.txt AC 1 ms 256 KB
sub2_in2.txt AC 1 ms 256 KB
sub2_in3.txt AC 1 ms 256 KB
sub3_in1.txt WA 4 ms 256 KB
sub3_in2.txt WA 4 ms 256 KB