DDIMMST - Editorial

editorial
, ,
4

I was stuck at this problem for the last 6 days ,finally solved it on 8th day.
This and adding squares were great problems.
Learned a lot in this long challenge.

6 Likes
5

Just like in Lunchtime or cookoff , why CC doesn’t make Video Editorial for these , please make for long too , at least from 5’th question onwards.

6 Likes
6

Could anyone help me with my logic?
Here is my code…

http://p.ip.fi/wQ7R

Let’s me know if you could understand something, i will try to explain.
PS: I didn’t use any algo sort of thing, but an observation to select nodes in such a way that I could get max weight.

7

I can’t solve this for full but i came across lot of computation geometry algorithms like line sweep ,
Delanuy triangulation . I know this question could be solve by delanuay triangulation but couldn’t implement it.
i any one has use this method i would be very thankful to them to share their ideas on these.

1 Like
8

Research is still going on for Delaunay’s triangulation in dimensions >=3

1 Like
9

After seeing the hard work of people like you and then plagiarism from others, it makes me sad.

5 Likes
10

Ya I too proceeded in the same way but I was adding all Di instead of multiplying, that’s why I couldn’t solve it full even with >25 wrong submissions

1 Like
11

what i was thinking after completing for partial that if i am able to find two points whose distance is maximum let say p1 and p2,
then i will add this max distance and
while iterating through the points and not p1 and not p2
ans+=max((p1-pi),(p2-pi))

1 Like
12

@ssrivastava990 Actually, it exists! Go check it out here.

1 Like
13

Yeah , But I think instead of live they record separate video for each question and attach the video above.

14

Yup any how it was intereseting to come across this topics

15

@ssrivastava990 Bro, I think it doesn’t matter whether it’s live or recorded because you can access the video editorial any time on youtube so, that’s not an issue. But yeah, they can provide the link in every editorial.

16

where is the video tutorial for DDIMMST?

2 Likes
17

video bna de bro in do question pe

18

Did someone read this paper and tried to implement based on this ?

19

The editorial is shit man. Learn from codeforces!! short, precise and easy to understand.

For eg : Read G of this editorial, sorry for the bad language, but it really is SHIT.

10 Likes
20

You overkilled it dude :rofl:

1 Like
21

I understand and can implement Prim’s algorithm and Kruskal’s algorithm, but can’t follow the editorial concerning how to minimize the number of edges that must be considered in applying these algorithms. The part of the editorial describing the masks is especially difficult for me to follow. Could you provide one or two numerical examples of the steps involved in generating the masks and showing how this minimizes the number of edges that need to be considered in the solution?

3 Likes
23

can you tell us in easy language what exactly has happened in this editorial pls

1 Like
24

why do you waste time writing editorial when you have a firm determination of not letting new comers understand.

15 Likes