[SPOILER] You will not believe what happened when his mother got tickets for Bajrangi Bhaijaan instead of Bahubali.

Yes. A click bait. My apologies. But the fact of the matter is click baits work. So lemme try a 'popular' like article over here.

So this young Indian like any other wanted to watch India's next big epic. Bahubali. But things didn't work out as planned and his mother got tickets for Bajrangi Bhaijaan. We'd just be fed up and not go. Right? That's not quite what happened. Aman decided the movie needed a running commentary to kill his time and 'help' people who couldn't watch the movie themselves this Ramadan. You could imagine the surprise on his friend's notification feeds when it said..

Apologies for no picture courtesy! :P

Yes. It all started with this post.

Came with mom to watch this racist comedy.
Posted by Aman Biswas on Friday, July 17, 2015

But things quickly went south when the wrong tickets were served.

"It literally went from worse to I don't even know what."

So get this. Apparently mom cut tickets for Bajrangi Bhaaijan and not Bahubaali.It literally went from worse to I don't...
Posted by Aman Biswas on Saturday, July 18, 2015

And so it started...

Salman Khan mostly travels via the bus in this movie. Gotta love the public service he's doing if nothing else.
Posted by Aman Biswas on Saturday, July 18, 2015

This guy needs to be a film critic!
"15 mins into the movie, and the movie's focus shifts completely to a love story..." 

The movie starts off as a story about a 5 year old girl who can't speak, is from Pakistan and gets lost in India. 15...
Posted by Aman Biswas on Saturday, July 18, 2015

"Now a song and dance number just started about different kinds of chicken dishes. 2 people walked out, I'm guessing they got hungry."

Now a song and dance number just started about different kinds of chicken dishes. 2 people walked out, I'm guessing they...
Posted by Aman Biswas on Saturday, July 18, 2015

As Half time approaches, you'd think he'd give a respite to his friends.

Half time. The story till now, Salman Khan finally realizes the girl is from Pakistan and drops her off at a travel...
Posted by Aman Biswas on Saturday, July 18, 2015

No. Just plain no.

Movie started. Salman Khan meets smugglers who help him cross the border and says they immediately thought that he was a nice guy. Well atleast he found someone whom he can relate to.
Posted by Aman Biswas on Saturday, July 18, 2015

And guess who show's up in the movie?

Faizal bhai from Gangs of Wassypur is here man!
Posted by Aman Biswas on Saturday, July 18, 2015

Salman Khan just beat up Pakistani police officers and ran out of the police station. No one thought to shoot him or something. Man Pakistani police is lacking, no wonder terrorism is rampant there.
Posted by Aman Biswas on Saturday, July 18, 2015

Salman Khan tells the truth the entire movie and is dumb enough to take permission from the border guards even after...
Posted by Aman Biswas on Saturday, July 18, 2015

The other moral of this movie. If you want to survive in Pakistan without a passport or visa, make sure you're a bhakt.
Posted by Aman Biswas on Saturday, July 18, 2015

The End? NO! Where's the twist and the climax?

The TWIST:

Police finally capture Salman Khan and beat the shit out of him in a beautiful forest location in slow mo.The forest...
Posted by Aman Biswas on Saturday, July 18, 2015

Faizal Khan uploads the Salman Khan and 5 year old girls story to the Internet. It goes viral. But the Pakistani police...
Posted by Aman Biswas on Saturday, July 18, 2015

It looks like half the citizens of Pakistan came up to the border to make sure Salman Khan gets home. (to India)Oh I...
Posted by Aman Biswas on Saturday, July 18, 2015

And the climax...

All the Pakistani citizens break open the border gate and cross and also makes sure that Salman Khan gets to cross. The...
Posted by Aman Biswas on Saturday, July 18, 2015

" (Cmon, we knew she wasn't going to be dumb the entirety of the movie, this is bollywood) "

Salman Khan crosses the border. So much feels. Kareena Kapoors father suddenly loves him because feels. Dumb girl...
Posted by Aman Biswas on Saturday, July 18, 2015

Approx 3 mins of Salman Khan and not anymore dumb girl running into each others arms in slow mo as the not anymore dumb...
Posted by Aman Biswas on Saturday, July 18, 2015

Final Verdict?

"And Salman completely steals the show, not because of his great acting or anything but because most of the camera time is on him."

That was an amazing experience. I should watch shitty movies and live blog them more often.What do I think about the...
Posted by Aman Biswas on Saturday, July 18, 2015

11/10! 

Hope you enjoyed this. Leave your comments below or hit me back at fb.com/ash1794

Stay Tuned for more!

-ash1794

ACM Kharagpur Online 2014

Pretext
Not a post for almost an year and suddenly a wild post appears out of nowhere. I know. I'm just gonna act as if everything was normal and some dumbass hacker hacked my account and removed the few posts in between. Let me continue in this post about my team experience in the ACM ICPC Kharagpur Online Qualifiers that took place today. (Technically Yesterday. But who cares!)

What Comes after Pretext? Text??
I had just finished eating home cooked Chappatis and a lip-smacking Aloo-Bhindi fry when the contest started. Today was the qualifiers to the Kharagpur On-site regionals for the prestigious ICPC contest. One would think having participated in a ton of contests and a regionals or two before the stress and tension levels to be normal if not cool. It was definitely not the case.
Observing from how Codechef conducted Amritapuri Online my spidey senses told me the contest would start 30 secs before and it did. There it was at 13:59:30 IST sharp. The tingling sensation, the rush of adrenaline and 5 unsolved problems which could be our ticket to the Kharagpur on-site. My team consisted of Sai Kiran who was in his 4th year of B.Tech and Sandeep my class mates. Well-rested and the team spirits high, tabs were rushing on my computer screen to the right of my current tab. All 5 problems were open and each of us attacked a separate problem each.
Sandeep started of with the first problem in the set. The geometry. Little did he know he'd be stuck with it through out the contest. I was reading the second problem which seemed do-able. Not wasting another second I quickly checked out the other problems. With a small constrain and no complications I quickly recognized that the 5th problem was the easiest and was off coding it. The first submission mattered. 2 minutes to code and test the solution and another to add the word 'Case', we clocked our first submission at 00:04:22. Pretty decent.
With sandeep still hacking at the Geometry problem alone, Sai Kiran and me quicky decided that the graph problem was one among the hardest and settled for solving Inversions which indeed turned out to be the second easiest problem. First with an initial idea to simulate the k-swaps with a modification of Bubble sort, the Idea was thorough. A quick insertion of the BIT for counting the Inversion count, our code was set. Hoping to clock a 20 minute submission for the second one, we submitted it, but was awarded with a wrong answer instead. The next submission involved removing the Bubble sort modification upon realising that it doesn't matter which numbers were swapped. This resulted in a wrong answer as well. We both took a brake to help with Sandeep with his idea. He was stuck. 'Modify the closest pair problem?', 'Here's where it fails'. Things didn't look good. We were off. Each working on our own. Thinking where we could have gone wrong. That's when Kiran realised the corner case that we missed. Oh it was stupid. We repeated the same mistake in the practice contest too. We realised we need to buck up. Clocking in at 01:03:00 with 2 penalties we were decently ranked near the 50s.
But with 2 hours to go we knew we had to solve the third to maintain our rank. Since the other two problems lacked any successful submission, we were sure our conclusions were right. Coming back to the geometry problem 4 dis-proved ideas later, we were dead beat. A crazy idea strikes me. To select points at random and keep updating the minimum. Will it work? Don't know. Is there a chance? Yes. A TLE and a resubmission later we were dead beat. Ranking in at 114 we were happy. Not content. Just happy that we put up a decent performance. Awaiting the official results.
After the contest it was depressing to hear that the 70+ submission were not all authentic. I understand finding an idea or an algorithm online. But the same exact problem being previously used in another contest with code available? Heart-breaking. Not that we didn't Google it. But that it wasn't a fair contest. But I'm sure the mistake could be corrected. Copied code be eliminated. But the contest wasn't glitch-free. Just like last time. (Oh yeah! The DP fiasco) Looking forward for a good regionals this year. Adios. Wish all the teams good luck. And as Modi at Madison Square puts it, 'May the force be with you!

Problem E
Cakewalk - Sorting -  Print the sum of 3 maximum numbers. n>=3

Problem B
Easy Medium - BIT/Merge Sort - Given an array and a number K, perform exactly k 'adjacent' swaps so that the number of inversions in the array is minimized.
Given that only adjacent swaps may be performed, it can be proved that each swap will decrease (or increase) the number of inversions by at most 1. Calculate the number of inversions I. If K is lesser then the final answer was I - K. If K was greater there were two options. If K - I was odd and even. If K - I was odd, repeated swaps of the same element would end up with one inversion never zero. If it was even then the number of inversions can be maintained at zero. The corner case that we missed was if there were repeated elements. Then the extra swaps can be made on them and the answer is always zero.

Problem A
Medium - Geometry - The intended solution seems to be a modification of the existing closest pair problem. For n value less than 5 we brute force. Refering to ACRush's AC code in the GCJ, it is just an extension of the closest pair. Each recursion keeps track of the minimum sum distance in a global variable. If points lie on (R/2) of the midpoint (where we divide them into two planes) then we select the points. Then for each point on the left side we select all points on the right which lies at most (R/2) distance from it. And for each pair of points in the right we check if it forms a better answer with the current point. We repeat the same by selecting one point on the right and two on the left. The time complexity analysis of this fails me.

AC Rush's code

void solve(int H,int T)
{
if (T-H+1<=5)
{
for (int i=H;i<=T;i++)
for (int j=i+1;j<=T;j++)
for (int k=j+1;k<=T;k++)
checkIt(i,j,k);
return;
}
int M=(H+T)/2;
solve(H,M);
solve(M+1,T);
double sp=(P[M].first+P[M+1].first)/2.0;
vector<pair<double,int> > QL,QR;
for (int i=H;i<=T;i++) if (fabs(P[i].first-sp)<=R/2.0)
if (i<=M)
QL.push_back(MP(P[i].second,i));
else
QR.push_back(MP(P[i].second,i));
sort(QL.begin(),QL.end());
sort(QR.begin(),QR.end());
for (int step=0;step<2;step++)
{
for (int i=0,k=0;i<SIZE(QL);i++)
{
for (;k<SIZE(QR) && QR[k].first<QL[i].first-R/2.0;k++);
int d=k;
for (;d<SIZE(QR) && QR[d].first<=QL[i].first+R/2.0;d++);
for (int a=k;a<d;a++)
for (int b=a+1;b<d;b++)
checkIt(QL[i].second,QR[a].second,QR[b].second);
}
if (step==0)
{
vector<pair<double,int> > T=QL;
QL=QR;
QR=T;
}
}
}

Will solve Problem C and D and update the blog later.
All my solutions to today's problem is available here: https://github.com/ash1794/Share-Code/tree/master/ACMKGP14

Happy Coding!


Update 1: Upon discussion with Sandeep, it became more clear why this would run in time. Not definite. But approximate. Approximate enough for Competitive purposes. (:P) Since this is a direct modification of the closest pair the rough Time Complexity was O(n log n). The part which eluded me was
for (int a=k;a<d;a++)
for (int b=a+1;b<d;b++)
which could contain infinite many points, because this being real numbers. What we do is fix a point on the left hand side, draw a circle of R/2 and pick points on the other side which is within the circle. But this could contain many points. R here is current found minimum of sum of distances. So if there were a lot of points within the circle, the R value would have been much smaller. Since it's not, we don't have as much values as we hoped. Therefore the number of points would be close to ten which is good enough to pass within the time-limits. Pretty Smart.

That annoying friend.

Ever felt like killing someone? The most brutal long not painful but gruesome and emoctionally heavy murder. Im talking about none other than that irritating idiot everyone's got. Either your that guy for someone. Or for some set of people rather. At other times you its you, the guy with the knife.
And its not his fault. He doesnt deserve to die. Its your fault of all the added up choris. My fat (oops fluffy) friend can relate.

Like achmed the dead terrorist said, its easy to kill. Its harder to be politically correct!

The official Sem End Post

As i wake up in the bus after a rather overstayed stay of bangalore, it was a refreshing site of coconut trees and malayalam words looming past by. One day being left for the next sem to start i can still hardly digest that one just got over. Having said, that it was rather a poetic end to an adventurous and eventful semester that passed by. The results though mattered, it mattered not. 

Last semester that got over had mixed reactions from me. With my comeback at qualifying the ICPC regionals it turned out that i still had to learn more. Not only algos but much morw than that. And as i missed most of the greater events in my class for one genuine reason or the other, i missed them nevertheless and it still gives a heartburn. But much more important than any of that was the dust clearing from the stomped shoes of about 120 horses that roared by an year before. With more clear sight some of us at least got it clear on the real nature of friendship ties and the set of broken and unbroken vows that came with it.

None of it matters. As i complete a year and a half I realise what true goals are. A train must go forward until it reaches its destination no matter how late or how empty it rides. This will go on too.

P.S I know it might sound a little cryptic and illegible to some. Forgive me. Next blog post will be far more comprehensible.

Memories and Birthdays - Breaking The Curse.

"Hello"
"Hey. Wassup?"
"Uhm. 'twas my birthday yesterday"
"Oh." Oh fuck!
"I'm Sorry"/ "You know me" / "Oops" / "Belated Happy Birthday"...

Sounds familiar? Well that's the story of every one of my friends' birthdays. They suffer. Oh yeah. You'd think it's worthy to show you are friends at least on birthdays. Not with me. I'd call them on any of the 364 Days that cursed year has. Except on the birthday. I somehow manage too. And on the very rare occasions that I do call them on that day; That's the worst. I still don't remember it's their birthday.

I could think of a million justifications for that. Ranging from "I'm like that, oops" to "My friends don't deserve me" (JK). I'm one of a kind remember. :P That's not the point. What matters is how your friends take it. Just today when the same thing happened when I called to Aji, I learnt on how you could teach someone a lesson. And her excuse on making me do all the stuff she made me do? - I said sorry. I won't go into the details of the actions I was condemned to, but I'm sure I won't forget her birthday ever again.

Ashwin Krish

The Officially Second Year Post.

College has finally resumed since past two weeks and it's been exactly that much amount of time since I'm officially a senior. What's the difference? Well you've got one year behind you and that's exactly what it means. Nothing more. Nothing less. It's another semester. New Subjects. The funniest ones are what you already have some knowledge about. For instance we're learning the OOPs concept which is technically a revisit of my 11th and 12th standard. And to think that past three classes already operator overloading, method overloading and overriding has been 'briefly' covered is damn funny. Seriously. Then there's the hostel factor. This time we get, well almost an hostel for ourselves. Adding to the fact that laptops are legal to carry and use. That adds a lot of movies which I've missed out on to be watched currently. It's a nice alternative to going back and just sleep.

The Trail

Blood drops as i walk, leave behind
with twisted, torn, scraps of paper soaking in the red, 
fairies and god mothers and gods themselves failed, 
there stuck i am at and no choices to make.
Real and sad the music goes on, 
queer and weird and fuzzy. But in there.
Random i speak, My words don't aim,
but my heart is free and decisions are thick.

Ashwin. K

"A sad soul can kill quicker than a germ."