×

# Why DLDAG is a challenge problem?

 0 I am having hard time understand how DLDAG is a challenge problem. we have: "The score for each test file is 10⋅(C/S)2, where C is the number of steps in which you deleted exactly 2 vertices. The final score of your submission is equal to the sum of scores for each test file." On the other hand we know that at each step we can delete at most 2 vertices. And question asks us to find S to be the minimum number of steps required (and we have to print S to get AC) then isn't C is n - S? asked 15 Dec '18, 13:07 4★mrkhani 1●1 accept rate: 0%

 0 Well , I also can't understand what really C is ?? But yes what we can do is to reduce no. of steps to delete DAG. answered 15 Dec '18, 13:56 11●2 accept rate: 0% edited my initial question to be more clear. My problem is that question asks us to find minimum S to get AC. (15 Dec '18, 21:47) mrkhani4★
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×19
×15
×6

question asked: 15 Dec '18, 13:07

question was seen: 483 times

last updated: 16 Dec '18, 18:32