Task: | Jakkara |
Sender: | |
Submission time: | 2015-07-17 23:20:00 +0300 |
Language: | C++ |
Status: | READY |
Result: | 21 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 21 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.07 s | 1 | details |
#2 | ACCEPTED | 0.09 s | 1 | details |
#3 | ACCEPTED | 0.09 s | 1 | details |
#4 | ACCEPTED | 0.08 s | 1 | details |
#5 | ACCEPTED | 0.09 s | 1 | details |
#6 | ACCEPTED | 0.08 s | 2 | details |
#7 | ACCEPTED | 0.09 s | 2 | details |
#8 | ACCEPTED | 0.08 s | 2 | details |
#9 | ACCEPTED | 0.07 s | 2 | details |
#10 | WRONG ANSWER | 0.09 s | 2 | details |
#11 | WRONG ANSWER | 0.10 s | 3 | details |
#12 | WRONG ANSWER | 0.08 s | 3 | details |
#13 | WRONG ANSWER | 0.09 s | 3 | details |
#14 | WRONG ANSWER | 0.07 s | 3 | details |
#15 | ACCEPTED | 0.09 s | 3 | details |
Code
#include <iostream> #include <cmath> // Uolevi vaihtaa tuolin jalan pituutta. Palauttaa käytetyn energian määrän int change(int x, int val) { return abs(x - val); } // Uolevi testaa, jos jotkin jaloista ovat saman pituisia // palauttaa numeron joka esiintyi eniten // tunkee found-muuttujaan 1 jos samoja löytyi, muuten 0 // varoitus: runsaasti purkkakonsteja edessä int same(int a, int b, int c, int d, int & found) { found = 1; int ab = 0, ac = 0, ad = 0, bc = 0, bd = 0, cd = 0; int abc = 0, bcd = 0, acd = 0, abd = 0; if (a == b) ab = 1; if (a == c) ac = 1; if (a == d) ad = 1; if (b == c) bc = 1; if (b == d) bd = 1; if (c == d) cd = 1; if (ab && ac) abc = 1; if (bc && cd) bcd = 1; if (ac && cd) acd = 1; if (ab && bd) abd = 1; if (abc) return a; if (bcd) return b; if (acd) return a; if (abd) return a; if (ab) return a; if (ac) return a; if (ad) return a; if (bc) return b; if (bd) return b; if (cd) return c; found = 0; return 0; } // ei se yks juttu toiminu :( // tän pidemmälle en jaksa ajatella... // ehkä ens kerralla paremmin int main() { int a,b,c,d; std::cin >> a >> b >> c >> d; int found = 0; int min = same(a,b,c,d, found); if (found == 0) { min = (a + b + c + d) / 4; // keskiarvo } int result = change(a, min) + change(b, min) + change(c, min) + change(d, min); std::cout << result << std::endl; return 0; }
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: WRONG ANSWER
input |
---|
805 794 799 591 |
correct output |
---|
219 |
user output |
---|
313 |
Test 11
Group: 3
Verdict: WRONG ANSWER
input |
---|
918046201 377309798 763092200 ... |
correct output |
---|
753184325 |
user output |
---|
-3 |
Test 12
Group: 3
Verdict: WRONG ANSWER
input |
---|
185264934 19222757 522094385 9... |
correct output |
---|
595938743 |
user output |
---|
634798821 |
Test 13
Group: 3
Verdict: WRONG ANSWER
input |
---|
727047841 260674959 553589480 ... |
correct output |
---|
678802024 |
user output |
---|
-2 |
Test 14
Group: 3
Verdict: WRONG ANSWER
input |
---|
769070856 877861912 488304785 ... |
correct output |
---|
614008750 |
user output |
---|
0 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
1 1 1 1000000000 |
correct output |
---|
999999999 |
user output |
---|
999999999 |