Any hints to solve INOI 2017 problem 1?
The testing data is available on the IARCS site, maybe you can get someone with access to add the problem on the contest page.
Hi , I tried solving some previous ZIO problems, but found many of them to be quite difficult. Can somebody post whatever solutions they have here (or add them to this folder ZIO solutions)?
We can also use this post to discuss previous years'...
Which question are you having difficulty in?
So, ZCO just ended. I ended up getting only 10 or 25 marks. Is there honestly any hopes that I'll get to INOI ? Also, how did you guys find the difficulty of the test?
Maybe there is some chance if you got 25 although probably not, none if you got 10.
Here's the thing, I messed up my ZCO and is getting 0.
ZIO is my last shot as I am in 12th, and when I sat down to solve ZIO qpaper 2013, I was stumped by the very first question.
So, how do you come to an algorithm for problems in ...
My score was 110/200. Hoping for an Honorable mention! Still have 2 years to improve and perform better so a little chill for me :)
What were your scores? Really curious to know how I ...
Note: The online judge solution checker has issues for this problem because this problem has multiple correct solutions.
Can you share your solution, I am pretty sure my solution is correct but it fails in the last two cases.
Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.
Wouldn't this take O(N^2) time to compute?
You are given an m x n grid with 3 types of cells - empty, black and white. There are b black cells, and w white cells.
A laser starts from an empty cell and travels toward...
Your approach is only fast enough for the first 2 subtasks.
Given an array of N integers and an integer T, find all possible combinations of indices i, j, k, l such that i < j < k < l and S[i] + S[j] + S[k] + S[l] is equal to T where S is the array of integers
Constraints: N <= 5000, T <= 10^6
Why do you have to sort the pairs? Isn't checking if the pairs sum up to T and all the indices of the elements in the pairs are distinct enough?