I'm in ACM-ICPC contests too, and I agree in this: - implementation of max bipartite matching algorithm (the same for both of you)
The implementation will determine the name of the matrix or adjacency list too and consequently the reading data, and construct a graph is a so common task in programming contests that most people do it always the same way. Two people that worked together during 4 years develop some similiarity in programming. Other thing is that no one advances passing just small C. So I think the decision can not takes just this in account. Of course that if they had cheated they can't advance, but this conclusion can't be done just comparing the two files. I also believe that many people use Igor Naverniouk's codes disponibilized in shygypsy, Dmitry and Natalia case is not different but wiith a code that only they use. On Mon, Oct 5, 2009 at 6:27 PM, Roman Alekseenkov <[email protected]>wrote: > > Overall, you don't have a lot of flexibility in writing a solution for > C - both easy & hard. The code consists of: > - template (the same for both of you) > - implementation of max bipartite matching algorithm (the same for > both of you) > - reading the data, constructing the graph, and writing the data > (similar, but it's hard to write it in a very different way) > > I know these folks (Dmitry and Natalia) in person, and I don't believe > there exists a fair reason for their disqualification. > > Well, I don't know what else to say... > It looks like we'll be watching the football match all together then > (of course if Natalia is infatuated with football)! > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
