Hi,
I've been doing some past IOITC problems for a while now, but due to lack of time before TC I started only from 2014 onwards. I was wondering if there are some more interesting, non-trivial problems from before 2014 besides the one I tried, Facebook, 2012. Would be great help if you named a few!
Thanks!
Hints for Binary Codes problem please. Got a few trivial observations but nothing close to a full solution. :(
This seems to be quite an interesting problem from IOITC 2013.
Problem in Short: You are given N distinct points on a plane where distances are measured using the Manhattan metric. Fin...
However I get TLE in last 2 subtasks. O(N*log(N)*log(N)) should work comfortably in 4s right? The TC judge seems to be very slow for other problems that should easily pass too. :(
Any hints? Seems like an annoying problem of pattern analysis, but if its more than just that, I would really like to know!
Hey can anybody tell me about the O(VE) algorithm of Maximum Bipartite Matching
and also if convex hull and matrix exonentiation is ...
Sorry, my bad. It wasn't there until last year. :/ I myself don't know it, unfortunately.
Got AC.
Here are some hints:
Hey can anybody tell me about the O(VE) algorithm of Maximum Bipartite Matching
and also if convex hull and matrix exonentiation is ...
Maximum Bipartite Matching and Matrix Exponentiation are not in the IOI syllabus. However, Convex Hull is a considerably basic and important geometry algorithm that might feature in the IOITC Tests. You can see more of the official IOI syllabus here: https://people.ksp.sk/~misof/ioi-syllabus/ioi-syllabus.pdf
There is a problem with the judge at the moment. Visit iarcs.org.in and look for the problems archive. The problems with all the testdata have been uploaded.
This seems like a very good problem unfortunately my mind has been unable to make much progress. Therefore hints would be very appreciated :D. Here is the problem:
Today, we have a very interesting problem for you. G...
There is one, but unfortunately for you, its only for students qualified for the IOITC.. :/
The problem is straightforward. You've been given an array A with N integers, and M queries. In each query, you'll be given an integer X and you need to reduce all numbers greater than X in the array. At the end of M queries, print the array.
Constraints:
I did not understand this:
Could you please explain? :p
