CSES - Putka Open 2015 – 1/6 - Results
Submission details
Task:Jakkara
Sender:
Submission time:2015-07-19 21:33:46 +0300
Language:Python2
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED25
#3ACCEPTED54
Test results
testverdicttimegroup
#1ACCEPTED0.08 s1details
#2ACCEPTED0.09 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.09 s1details
#5ACCEPTED0.09 s1details
#6ACCEPTED0.09 s2details
#7ACCEPTED0.10 s2details
#8ACCEPTED0.08 s2details
#9ACCEPTED0.09 s2details
#10ACCEPTED0.09 s2details
#11ACCEPTED0.09 s3details
#12ACCEPTED0.08 s3details
#13ACCEPTED0.10 s3details
#14ACCEPTED0.08 s3details
#15ACCEPTED0.09 s3details

Code

# Uolevin jakkarassa on nelja jalkaa, mutta kaikki jalat eivat ole samanpituisia. Uolevi haluaa muuttaa jakkaraa niin, etta jokaisen jalan pituus on sama.

# Uolevi pystyy pidentamaan tai lyhentamaan jalkoja haluamallaan tavalla. Tietyn jalan pidentaminen x:lla tai lyhentaminen x:lla vie energiaa x yksikkoa.

# Tehtavasi on selvittaa pienin yhteisenergia, jolla Uolevi saa kaikki jalat yhta pitkiksi.

# input: a b c d
# optimienergia: x = argmin |a - x| + |b - x| + |c - x| + |d - x|

from math import floor, ceil
jalat = [int(i) for i in raw_input().split()]
jalat.sort()

# Funktio on laskeva jalat[1]:een asti, vakio jalat[1]:sta jalat[2]:een, ja kasvava sen jalkeen.
# Minimi loytyy siis laskemalla energia jalat[1]:ssa, tama taas onnistuu nain:
# abs(j0 - j1) + abs(j1 - j1) + abs(j2 - j1) + abs(j3 - j1)
# = j1 - j0 + (0) + j2 - j1 + j3 - j1
# = -j0 - j1 + j2 + j3.

print - jalat[0] - jalat[1] + jalat[2] + jalat[3]

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
2 4 2 1

correct output
3

user output
3

Test 2

Group: 1

Verdict: ACCEPTED

input
4 4 5 1

correct output
4

user output
4

Test 3

Group: 1

Verdict: ACCEPTED

input
1 3 3 3

correct output
2

user output
2

Test 4

Group: 1

Verdict: ACCEPTED

input
4 5 2 1

correct output
6

user output
6

Test 5

Group: 1

Verdict: ACCEPTED

input
1 2 3 4

correct output
4

user output
4

Test 6

Group: 2

Verdict: ACCEPTED

input
755 181 899 550

correct output
923

user output
923

Test 7

Group: 2

Verdict: ACCEPTED

input
415 158 928 660

correct output
1015

user output
1015

Test 8

Group: 2

Verdict: ACCEPTED

input
8 786 277 786

correct output
1287

user output
1287

Test 9

Group: 2

Verdict: ACCEPTED

input
740 537 892 1000

correct output
615

user output
615

Test 10

Group: 2

Verdict: ACCEPTED

input
805 794 799 591

correct output
219

user output
219

Test 11

Group: 3

Verdict: ACCEPTED

input
918046201 377309798 763092200 ...

correct output
753184325

user output
753184325

Test 12

Group: 3

Verdict: ACCEPTED

input
185264934 19222757 522094385 9...

correct output
595938743

user output
595938743

Test 13

Group: 3

Verdict: ACCEPTED

input
727047841 260674959 553589480 ...

correct output
678802024

user output
678802024

Test 14

Group: 3

Verdict: ACCEPTED

input
769070856 877861912 488304785 ...

correct output
614008750

user output
614008750

Test 15

Group: 3

Verdict: ACCEPTED

input
1 1 1 1000000000

correct output
999999999

user output
999999999