Submission #2561075


Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
using namespace std;
using ll = int long long;
map <int ,int> mpa,mpb;

int main(){
  int N,K;
  cin >> N >> K;
  ll a[16];
  ll ans=0;
  a[0]=0;
  for(int i=1;i<=N;i++){
    cin >> a[i];
    if(a[i-1]>=a[i]){
      ans+=abs(a[i]-a[i-1])+1;
      a[i]=a[i-1]+1;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task B - Buildings are Colorful!
User arks1225
Language C++14 (GCC 5.4.1)
Score 120
Code Size 510 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 120 / 120 0 / 90 0 / 140
Status
AC × 1
WA × 1
AC × 2
WA × 3
AC × 3
WA × 6
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 AC 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