Submission #3569474
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) int n, k; long long a[16]; long long ans = 1e18 * 2; int main() { cin >> n >> k; rep(i, n)cin >> a[i]; rep(i, 1 << n) { int c = 0; rep(j, n)if (i&(1 << j))c++; if (c != k)continue; long long cnt = 0; long long mem = 0; rep(j, n) { if (i&(1 << j)) { cnt += max((long long)0, mem - a[j] + 1); mem++; } mem = max(mem, a[j]); } ans = min(ans, cnt); } cout << ans << endl; getchar();getchar(); }
Submission Info
Submission Time | |
---|---|
Task | B - Buildings are Colorful! |
User | anmichi |
Language | C++14 (GCC 5.4.1) |
Score | 350 |
Code Size | 556 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 | 2 ms | 256 KB |
sub1_in2.txt | AC | 2 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 | 2 ms | 256 KB |
sub3_in2.txt | AC | 2 ms | 256 KB |