903D - Almost Difference - CodeForces Solution


data structures math *2200

Please click on ads to support us..

Python Code:

n = int(input())
arr = [int(i) for i in input().split()]
xrr = dict()
ans = 0
s = arr[0]
c = 1
xrr.update({arr[0]:1})
for i in range(1,n):
    if(arr[i]-1 not in xrr):
        xrr.update({arr[i]-1:0})
    if(arr[i]+1 not in xrr):
        xrr.update({arr[i]+1:0})
    if(arr[i] not in xrr):
        xrr.update({arr[i]:0})
    p = s-xrr[arr[i]-1]*(arr[i]-1)-xrr[arr[i]+1]*(arr[i]+1)
    q = c-xrr[arr[i]-1]-xrr[arr[i]+1]
    ans += (q*arr[i])-p
    s += arr[i]
    c += 1
    xrr[arr[i]] += 1
print(ans)


Comments

Submit
0 Comments
More Questions

1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition
1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors