Comments
0

Suggestions 1. It would be helpful, if you can provide code(authors solution) in editorial. 2. Link of editorial on contest page.
0

Thats, why I wrote "probably".
+23

By seeing submission gap between B and C, probably a team.
+8

Thanks, that was really an insightful explanation.
On Zlobober → Codeforces Round #345, 11 years ago
0

Today I learnt a lesson, never use scanf with ios::sync_with_stdio(false); cin.tie(0); today it costed me heavily on D.

+5

simply Brilliant @satyaki3794. Thanks for explaining.
+4

1, Create two graphs G1 and G2, and store the given informaton 2. Find shortest path between every two vertices using floyd_warshall, store it in G1. 3. Now for every street from 1 to m, block each of them and find shortest path using same algo on G2, 4. compare G1 and G2, and count affected distances and store it in vector 5. Recreate graph G2 6. go to step 3 7. return vector of counters
+1

OK
On rng_58 → What do you do if you get WA?, 11 years ago
-12

.
0

Can anyone explain me how to solve Div2 Problem D in detail?
0

Thanks, it was really very helpful.
+1

I applied dp on DIV-2 D problem here is my solution can anyone explain why it failed ?
-8

Best Editorial seen so far, with explanation and codes.

On twarzo → Spoj task, 11 years ago
-8

Previously, I solved it using that approach only. But now I am interested in dp approach not mathematical one :D :P
0

Can anyone explain how to solve this on codechef using above approach ? Any kind of help will be appreciated. Thanks in advance.
On twarzo → Spoj task, 11 years ago
-8

What is digSum ?