morris821028 / uva Goto Github PK

想請問您這題
https://github.com/morris821028/UVa/blob/master/volume112/11236%20-%20Grocery%20store.cpp

為什麼要加上
if(fabs((a+b+c+d)/100.0 - ((double)a*b*c*d)/100000000.0) < 1e-12)

我以為 d 是直接用整數運算 d = (s * 1000000) / (p - 1000000); 算出來所以應該是對的
而且 if(s > 2000 || d < c)   continue; 檢查過 d 的範圍了應該直接是答案了

為什麼要重新檢查一次呢?

我不加那行結果 WA 了 QQ

謝謝您

4
2.0 2.5
6.9 2.1
7.4 3.3
1.0 2.1
10
-0.3 2.1
1.4 0.1
3.8 0.1
-2.0 0.1
3.2 1.1
-1.9 0.1
9.9 3.1
3.3 0.1
1.5 1.1
7.9 2.1

2.000

1.5

Hello, Vinit. ^_^

It seems like sol is wrong. I've cross-checked with Moriss' code(https://github.com/morris821028/UVa/blob/master/volume009/953%20-%20The%20Incredible%20Pile%20Machine%5Bv2%5D.cpp)

For below Input

---
1
3 7 18 9 15 9 8 15 17 2
----

Output should be

---
120 59

---

but, uDebug gives

---
201 59

---

Explanation

---
If we choose "120"
본문 이미지 1

If we choose "201"
본문 이미지 2
(ans) = (sum of all number)-(yellow number)
At glance, It seems like all correct, but In problem statement, It says
In case there are more than one possibility of pile assignment, choose always the one with lower order (e.g. if 012 and 210 yield 9 operations, choose 012).
So, correct answer is 120 59

---

And, It seems like Morris' code also wrong :(

For below input
----
1
3 10 17 1 9 9 8 12 19 11

---

My output and uDebug's output

---
021 59

---

but, Morris' code gives

---
012 59

---

Explanation

---
본문 이미지 3
본문 이미지 4
(ans) = (sum of all number)-(red number)
So, Correct answer is 021 59

---

If you agree, How about this?
(1) Swap sol with another AC one(I'm enclosing my code ^_^)
(2) Can you send morriss this information?


Thanks,
~/Anjupiter