28th Feb Summary

• Problem Solved :
1. UVA - 10307 - Killing Aliens in Borg Maze - MST - Accepted
2. UVA - 11631 - Dark Roads - MST - Accepted
3. UVA - 10600 - ACM Contest and Blackout - MST - Accepted
4. CodeForces - 63A - Sinking Ship - Adhoc - Accepted
5. CodeForces - 63B - Settlers' Training - Adhoc - Accepted
• Problems Trails:
• NONE

• Readings:
• NONE
• Contests :
1. Codeforces Beta Round #59 (Div. 2)
• Rating : 1266 ( -76 )
• Problems Solved : 2  
• Score : 1090
• Notes from mistakes today :
1. On UVA always re-check multi-input problems weather I reset the storage or not.
2. hashCode() & equals() must be implemented together.
3. Use the custom Parser for Java Std Input in large data input problems to avoid TLE.
4. keep a minimum rate of a new topic daily.

UVA - 10600 - ACM Contest and Blackout

• ID : UVA - 10600 - ACM Contest and Blackout
• Status : Accepted
• Type : Graph MST .
• Time : 2 Hours to Submission.
• Language : Java
• Solution :
1. Find MST
2. Find MST in every time you remove an edge from the Original MST
• Problems :
1. Make sure the MST is not the Original MST by removing the edges from the original MST and looping through all edges.
2. Make sure the second minimum MST is larger than the Original MST.