Submission #1213052
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int64; const int64 INF = 1LL << 58; int main() { int64 N, K, A[15]; cin >> N >> K; for(int i = 0; i < N; i++) { cin >> A[i]; } int64 ret = INF; for(int i = 0; i < 1 << N; i++) { if(__builtin_popcount(i) < K) continue; int64 cost = 0, last = 0; for(int j = 0; j < N; j++) { if((i >> j) & 1) { last = max(last + 1, A[j]); cost += last - A[j]; } else if(A[j] > last) { cost = INF; } } ret = min(ret, cost); } cout << ret << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Buildings are Colorful! |
User | ei13333 |
Language | C++14 (GCC 5.4.1) |
Score | 350 |
Code Size | 618 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |