Absolute Permutation (from HackerRank)

-
This was a fun, moderate problem: https://www.hackerrank.com/challenges/absolute-permutation
It is asking you to find an absolute permutation for the given arrays. All you have to do is check whether you can find a suitable candidate for each position in the array. There are only two candidates: index+k and index-k. Keep track of the candidates already used, make sure to prioritize the ones in ascending order, and you should be good. It is in linear time, and given the upper bound of 10^5, this would have been a hint that you need to do it in linear time otherwise the TCs will timeout. Apparently it worked:


Code is below, cheers, Marcelo.

using System;
using System.Collections.Generic;
using System.IO;
using System.Text;
using System.Collections;
class Solution
{
    public static void Main(String[] args)
    {
        int t = Int32.Parse(Console.ReadLine());
        int[][] solution = new int[t][];

        for (int i = 0; i < t; i++)
        {
            string[] parts = Console.ReadLine().Split(' ');
            int n = Int32.Parse(parts[0]);
            int k = Int32.Parse(parts[1]);

            solution[i] = new int[n];

            Hashtable htUsed = new Hashtable();
            for (int j = 0; j < n; j++)
            {
                int index = j + 1;
                int candidate1 = index + k;
                int candidate2 = index - k;

                if (candidate1 > 0 &&
                    candidate1 <= n &&
                    !htUsed.ContainsKey(candidate1))
                {
                    if (candidate2 <= 0 ||
                        candidate2 > n ||
                        htUsed.ContainsKey(candidate2))
                    {
                        solution[i][j] = candidate1;
                        htUsed.Add(candidate1, true);
                    }
                    else
                    {
                        if (candidate1 < candidate2)
                        {
                            solution[i][j] = candidate1;
                            htUsed.Add(candidate1, true);
                        }
                        else
                        {
                            solution[i][j] = candidate2;
                            htUsed.Add(candidate2, true);
                        }
                    }
                }
                else if (candidate2 > 0 &&
                         candidate2 <= n &&
                         !htUsed.ContainsKey(candidate2))
                {
                    if (candidate1 <= 0 ||
                        candidate1 > n ||
                        htUsed.ContainsKey(candidate1))
                    {
                        solution[i][j] = candidate2;
                        htUsed.Add(candidate2, true);
                    }
                    else
                    {
                        if (candidate2 < candidate1)
                        {
                            solution[i][j] = candidate2;
                            htUsed.Add(candidate2, true);
                        }
                        else
                        {
                            solution[i][j] = candidate1;
                            htUsed.Add(candidate1, true);
                        }
                    }
                }
                else
                {
                    solution[i] = new int[1];
                    solution[i][0] = -1;
                    break;
                }
            }
        }

        for (int i = 0; i < t; i++)
        {
            for (int j = 0; j < solution[i].Length; j++)
            {
                Console.Write("{0} ", solution[i][j]);
            }
            Console.WriteLine();
        }
    }
}

Comments

  1. TarasDecember 6, 2017 at 11:00 PM

    I'm not sure why this problem was marked as medium, since it required only a very basic math and coding, but it's still a nice little problem. My solution is pretty much the same, except that I didn't want to accumulate as much memory (storing the entire grid can be pretty expensive in terms of memory) and used a bitset instead of hashtable for checking used values, since most of the time it's going to be full anyways, so hashtable only adds performance and memory overhead :)

    #include
    #include
    #include
    using namespace std;

    int value_at(int i, int k, const vector used) {
    // abs(x - i) = k:
    // 1) x - i = k => x = k + i
    // 2) x - i = -k => x = -k + i
    int case_2 = -k + i;
    // case 2 is preferable (smaller) as long as it's still unused
    if (case_2 > 0 && !used[case_2]) return case_2;
    return k + i; // case 1
    }

    vector permutation_for(int K, int N) {
    vector permutation(N);
    vector used(N+1, false);
    for (int i = 1; i <= N; ++i) {
    int value = value_at(i, K, used);
    if (value > N || used[value]) return {};
    permutation[i-1] = value;
    used[value] = true;
    }
    return permutation;
    }

    int main() {
    int T; cin >> T;
    for (int t = 0; t < T; ++t) {
    int N, K; cin >> N >> K;
    vector permutation = permutation_for(K, N);
    if (permutation.empty()) {
    cout << "-1";
    } else {
    copy(permutation.cbegin(), permutation.cend(), ostream_iterator(cout, " "));
    }
    cout << endl;
    }
    return 0;
    }

    Cheers,
    Taras

    ReplyDelete

Post a Comment

Popular posts from this blog

Changing the root of a binary tree

-
Image
If you work with graphics and eventually you want to pivot a binary tree using a different node as the root, this might be interesting to you. Here is the problem:  Change the Root of a Binary Tree - LeetCode 1666. Change the Root of a Binary Tree Medium 6 14 Add to List Share Given the  root  of a binary tree and a  leaf  node, reroot the tree so that the  leaf  is the new root. You can reroot the tree with the following steps for each node  cur  on the path  starting from the  leaf  up to the  root ​​​  excluding the root : If  cur  has a left child, then that child becomes  cur 's right child. Note that it is guaranteed that  cur  will have at most one child. cur 's original parent becomes  cur 's left child. Return  the new root  of the rerooted tree. Note:  Ensure that your solution sets the  Node.parent  pointers correctly after rerooting or you will receive "Wrong Answer".   Example 1: Input: root = [3,5,1,6,2,0,8,null,null,7,4], leaf = 7 Output: [7,2,nul
Read more

Prompt Engineering and LeetCode

-
Image
With AI it becomes super interesting to try to "guide" it to solve a coding (LeetCode) problem. An example would be this one here:  The Knight’s Tour - LeetCode 2664. The Knight’s Tour Medium 11 0 Add to List Share Given two positive integers  m  and  n  which are the height and width of a  0-indexed  2D-array  board , a pair of positive integers  (r, c)  which is the starting position of the knight on the board. Your task is to find an order of movements for the knight, in a manner that every cell of the  board  gets visited  exactly  once (the starting cell is considered visited and you  shouldn't  visit it again). Return  the array   board   in which the cells' values show the order of visiting the cell starting from 0 (the initial place of the knight). Note that a  knight  can  move  from cell  (r1, c1)  to cell  (r2, c2)  if  0 <= r2 <= m - 1  and  0 <= c2 <= n - 1  and  min(abs(r1 - r2), abs(c1 - c2)) = 1  and  max(abs(r1 - r2), abs(c1 - c2)) = 2 .  
Read more

ProjectEuler Problem 719 (some hints, but no spoilers)

-
Image
Last time that I solved a ProjectEuler (PE) problem was in 2015... This is their latest problem as of today:  https://projecteuler.net/problem=719 Number Splitting        Problem 719 We define an  S S -number to be a natural number,  n n , that is a perfect square and its square root can be obtained by splitting the decimal representation of  n n  into 2 or more numbers then adding the numbers. For example, 81 is an  S S -number because  81 − − √ = 8 + 1 81 = 8 + 1 . 6724 is an  S S -number:  6724 − − − − √ = 6 + 72 + 4 6724 = 6 + 72 + 4 . 8281 is an  S S -number:  8281 − − − − √ = 8 + 2 + 81 = 82 + 8 + 1 8281 = 8 + 2 + 81 = 82 + 8 + 1 . 9801 is an  S S -number:  9801 − − − − √ = 98 + 0 + 1 9801 = 98 + 0 + 1 . Further we define  T ( N ) T ( N )  to be the sum of all  S S  numbers  n ≤ N n ≤ N . You are given  T ( 10 4 ) = 41333 T ( 10 4 ) = 41333 . Find  T ( 10 12 ) The rules of PE prevent me from disclosing the solution (they are very picky about it, rightfully so), but I can chat abo
Read more