Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 3w
Hints for Binary Codes problem please. Got a few trivial observations but nothing close to a full solution. :(
Read more… (20 words)
Tanavya Dimri
A 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D
Active In
Competitive Programming
International Olympiad in Informatics
Indian Computing Olympiad (ICO)
Commonlounge Meta
U.S. College Admissions for International Students
Machine Learning
Web Development
New Zealand Olympiad in Informatics
Artificial Intelligence
Reading
Featured Contributions
NaN.
discussion
Asking for interesting IOITC problems!
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!
Read more…(57 words)
reply in this discussion
NaN.
discussion
Triangle Equality (IOITC 2013 Test 3)
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...
Read more…(105 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 3w
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. :(
Read more… (53 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 4w
Any hints? Seems like an annoying problem of pattern analysis, but if its more than just that, I would really like to know!
Read more… (23 words)
NaN.
discussion
Hey can anybody tell me about the O(VE) algorithm of Maximum Bipartite Matching
and also if convex hull and matrix exonentiation is ...
Read more…(28 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 4w
Sorry, my bad. It wasn't there until last year. :/ I myself don't know it, unfortunately.
Read more… (16 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 4w
Got AC.
Here are some hints:
Read more… (325 words)
NaN.
discussion
Hey can anybody tell me about the O(VE) algorithm of Maximum Bipartite Matching
and also if convex hull and matrix exonentiation is ...
Read more…(28 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 4w
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
Read more… (41 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 20w
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.
Read more… (27 words)
NaN.
discussion
Subarray Rank (IOITC 2014)
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...
Read more…(108 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 51w
There is one, but unfortunately for you, its only for students qualified for the IOITC.. :/
Read more… (16 words)
NaN.
discussion
Data Structures Problem!
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:
Read more…(133 words)
reply in this discussion
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y
I did not understand this:
Could you please explain? :p
Read more… (30 words)