I would love to see a stack based dfs solution to this problem? If anyone solved by that method please share.

C++ (AC) Solution:

#include <iostream>
#include <vector>
#include <queue>

I'am Getting WA....Any Corner Case??

My code Ubuntu Pastebin

I was using an unordered hash map for storing the graph as adjacency list and I got some wrong answers. The problem was, I did not observed that in some test cases their might be some cities w...

What am i doing wrong here? Getting TLE

#include<bits/stdc++.h>
#define lli long long int
#define pb push_back

If a component contains cycle then the minimum number of separated cities after the reform of this component is zero, one otherwise. Because a component without cycle forms a tree and root of ...

This might help: International Olympiad in Informatics: Path to Gold

This playlist is mostly based on IARCS syllabus and previous years' papers' trends.

It is a classical problem.Number of swaps needed is nothing but the number of inversions in the array.

I have solved it using BIT,below is my code.

#include <bits/stdc++.h>

For anyone interested, I found a nice explanation of the crux of the problem.

Sorting a sequence by swapping adjacent elements using minimum swaps

I just submitted a total naive O(n^2) solution and I'm quite surprised to see that it actually worked in 0.08s. CodeChef needs to fix it's test cases. Anyways, I have no clue on how to prove correctness of my algorithm.

I'm getting WA on some test cases. Where's the mistake?

#include <iostream>
#include <vector>
#include <algorithm>

Such an error might come because while your program is still in process of exiting the recursion, it might be accessing an array index which is not there. This might be just over the largest possible index, and therefore declaring a little larger array than required might work.

Time Complexity:

O(R*C) for d = max(R, C) - 1

O(R*C*d) for any arbitrary d

#INOI1401

Hey, can you explain the last part of your solution?(the for loop after calculating `right` and `left`)

Please check my code....i am getting WA for few test cases

#include<bits stdc++.h="">

using namespace std;

int n,k;

I got AC in 0.25 secs. This is my solution:

#include <iostream>
#include <vector>
#include <algorithm>