CommonLounge
Categories
AboutGo Pro
Message
Tutorials
0
Discussions
16
Comments
90
Followers
31
Profile
Communities
Tutorials
Discussions
Comments
Active In
Competitive Programming
13 replies. 3 discussions. Member
International Olympiad in Informatics
39 replies. 7 discussions. Member
Indian Computing Olympiad (ICO)
31 replies. 2 discussions. Member
CommonLounge Meta
3 replies. 3 discussions. Member
U.S. College Admissions for International Students
1 reply. 1 discussion. Member
Machine Learning
Member
Web Development
Member
New Zealand Olympiad in Informatics
Member
Artificial Intelligence
Member
Reading
Member
Featured Contributions
NaN.
discussion
Asking for interesting IOITC problems!by Tanavya Dimri

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)
3 Comments
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 51w

https://www.dropbox.com/sh/3dpr9sknbu0ufbj/AAADGzJAclywaySuizHfLQC4a/Prelims%202010?dl=0&preview=code.pdf

Hints for Binary Codes problem please. Got a few trivial observations but nothing close to a full solution. :(

Read more… (20 words)
Reply
NaN.
discussion
Triangle Equality (IOITC 2013 Test 3)by Swetanjal Datta

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)
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 51w

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
4.
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)
3 Comments
NaN.
discussion
D - Array (IOITC 2015, Final 3)by IOITC Bot
Read more…
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y

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)
Reply
NaN.
discussion
by Stunning Suhail

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)
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y

Sorry, my bad. It wasn't there until last year. :/ I myself don't know it, unfortunately.

Read more… (16 words)
Reply
NaN.
discussion
Chandragupta and the Transport System (IOITC 2015, Finals 1)by IOITC Bot
Read more…
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y

Got AC.

Here are some hints:

Read more… (325 words)
Reply
NaN.
discussion
by Stunning Suhail

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)
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y

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
NaN.
discussion
[RANK] What's the Rankby Kuntal Majumder
Read more…
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 1y

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)
Reply
NaN.
discussion
Subarray Rank (IOITC 2014)by Pradipta Bora

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)
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 2y

There is one, but unfortunately for you, its only for students qualified for the IOITC.. :/

Read more… (16 words)
Reply
NaN.
discussion
Data Structures Problem!by Tanavya Dimri

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)
comment in this discussion
TD
Tanavya DimriA 16 year old competitive programmer who aims to represent India at the IOI. One time IOITC-er! :D · 2y

I did not understand this:

Could you please explain? :p

Read more… (30 words)
Reply
Load More
Filters
Profile
Communities
Tutorials
Discussions
Comments