Submission #1213067
Source Code Expand
#include "bits/stdc++.h" #define MOD 1000000007 #define INF 11234567890 #define in std::cin #define out std::cout #define rep(i,N) for(LL i=0;i<N;++i) typedef long long int LL; LL N, K, a[20]; LL ans; int main() { in >> N >> K; rep(i, N) { in >> a[i]; } if (N != K) { return 0; } LL want = a[0]; rep(i, N) { if (i == 0) { continue; } if (want >= a[i]) { ans += (want - a[i]) + 1; a[i] = want + 1; want = a[i]; } } out << ans << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Buildings are Colorful! |
User | Bwambocos |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 511 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 120 | 0 / 90 | 0 / 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 | WA | 1 ms | 256 KB |
sub1_in1.txt | WA | 1 ms | 256 KB |
sub1_in2.txt | AC | 1 ms | 256 KB |
sub2_in1.txt | WA | 1 ms | 256 KB |
sub2_in2.txt | WA | 1 ms | 256 KB |
sub2_in3.txt | WA | 1 ms | 256 KB |
sub3_in1.txt | WA | 1 ms | 256 KB |
sub3_in2.txt | WA | 1 ms | 256 KB |