We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Lily's Homework
  2. Discussions

Lily's Homework

Sort by

recency

|

22 Discussions

|

  • 2k23_cscys231212
     + 0 comments
    #include <bits/stdc++.h>
/*
 * Difficulty Medium
 * Max Score 40
 * https://www.hackerrank.com/challenges/lilys-homework/
 */

using namespace std;

vector <string> split_string(string);

// Complete the lilysHomework function below.
int lilysHomework(vector<int> arr_orig) {
    int result = INT_MAX;


    vector<int> sorted(arr_orig);
    sort(sorted.begin(), sorted.end(), greater<int>());

    for (int rev = 0; rev < 2; rev++) {
        int curSwap = 0;
        if (rev) {
            reverse(sorted.begin(), sorted.end());
        }
        vector<int> arr(arr_orig);
        // val, pos
        unordered_map<int, int> val2pos;
        for (int i = 0; i < arr.size(); i++) {
            val2pos[arr[i]] = i;
        }


        for (int i = 0; i < arr.size(); i++) {
            if (arr[i] == sorted[i]) {
                continue;
            }
            int ai = arr[i];
            int si = sorted[i];

            swap(arr[i], arr[val2pos[si]]);
            curSwap++;


            val2pos[ai] = val2pos[si];
            val2pos[si] = i;


        }

        result = min(result, curSwap);

    }


    return result;


}

int main() {
    ofstream fout(getenv("OUTPUT_PATH"));

    int n;
    cin >> n;
    cin.ignore(numeric_limits<streamsize>::max(), '\n');

    string arr_temp_temp;
    getline(cin, arr_temp_temp);

    vector <string> arr_temp = split_string(arr_temp_temp);

    vector<int> arr(n);

    for (int i = 0; i < n; i++) {
        int arr_item = stoi(arr_temp[i]);

        arr[i] = arr_item;
    }

    int result = lilysHomework(arr);

    fout << result << "\n";

    fout.close();

    return 0;
}

vector <string> split_string(string input_string) {
    string::iterator new_end = unique(input_string.begin(), input_string.end(), [](const char &x, const char &y) {
        return x == y and x == ' ';
    });

    input_string.erase(new_end, input_string.end());

    while (input_string[input_string.length() - 1] == ' ') {
        input_string.pop_back();
    }

    vector <string> splits;
    char delimiter = ' ';

    size_t i = 0;
    size_t pos = input_string.find(delimiter);

    while (pos != string::npos) {
        splits.push_back(input_string.substr(i, pos - i));

        i = pos + 1;
        pos = input_string.find(delimiter, i);
    }

    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

    return splits;
}

  • millanmyra14
     + 0 comments

    Reviving Teammates Once a shrine has been placed, gamers will need to technique the shrine and location the glowing coronary heart in their deceased teammate on pinnacle of it. As soon as this is carried out, gamers will need to start a lengthy ritual of prayer at the shrine. Players must only start this ritual when they are quite secure to achieve this, because the ritual to revive fallen teammates takes quite a long term to complete, leaving the participant and their crew at risk of ambush with the aid of monsters or different gamers.

    Once gamers finish channeling the ritual, the heart could be ate up, reviving the teammate who the coronary heart belongs to. Players can then supply their teammate their gear back that was looted formerly, as the revived group member will haven't any gadget in any respect whilst they come again, and they could preserve to try to acquire greater spoils in the course of the dungeon.

  • ciforo5712
     + 0 comments

    Pool compliance refers to adhering to local regulations and safety standards concerning the construction, maintenance, and operation of swimming pools.

  • davihiw751
     + 0 comments

    Pool compliance refers to adhering to the regulations and safety standards set by local authorities regarding the construction, maintenance, and operation of swimming pools.

  • rebel_again1
     + 1 comment

    Few cases are still failing. Not sure why

    public static int lilysHomework(List<Integer> arr) {
        
        List<Integer> sor = new ArrayList<>(arr);
        Collections.sort(sor);
        int asc = sove(sor, new ArrayList<>(arr));
        
        Collections.reverse(sor);
        int dec = sove(sor, new ArrayList<>(arr));
        return Math.min(asc, dec);
    }
    
    public static int sove(List<Integer> arr, List<Integer> org) {
        Map<Integer, Integer> iMap = new HashMap<>();
        for (int i = 0; i < org.size(); i++) {
            iMap.put(org.get(i), i);
        }
        int count = 0;
        for (int i = org.size() - 1; i >= 0; i--) {
            if(org.get(i) != arr.get(i)) {
                int in = iMap.get(arr.get(i));
                org.set(in, org.get(i));
                org.set(i, arr.get(i));
                iMap.put(org.get(i), in);
                count++;
            }
        }
        return count;
    }