Submission #1214057
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long #define all(v) begin(v), end(v) #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++) template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;} template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;} using pint = pair<int, int>; using tint = tuple<int, int, int>; using vint = vector<int>; const int inf = 1LL << 55; const int mod = 1e9 + 7; signed main() { cin.tie(0); ios_base::sync_with_stdio(0); cout << fixed << setprecision(12); int N, K; cin >> N >> K; vint a(N); rep(i, N) cin >> a[i]; int ans = inf; rep(bit, 1<<N) { if(__builtin_popcount(bit) != K) continue; int sum = 0; int mx = 0; rep(i, N) { if((bit>>i)&1) { if(a[i] <= mx) { mx++; sum += mx-a[i]; } } chmax(mx, a[i]); } chmin(ans, sum); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Buildings are Colorful! |
User | ukuku09 |
Language | C++14 (GCC 5.4.1) |
Score | 350 |
Code Size | 1015 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 120 / 120 | 90 / 90 | 140 / 140 | ||||||||
Status |
|
|
|
|
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 | 1 ms | 256 KB |
sub0_in2.txt | AC | 1 ms | 256 KB |
sub1_in1.txt | AC | 1 ms | 256 KB |
sub1_in2.txt | AC | 1 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 | AC | 1 ms | 256 KB |
sub3_in2.txt | AC | 1 ms | 256 KB |