Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Hardik 1.3 Ap

    Uploaded by

    Hardik
    The document discusses two heap problems - finding the last remaining stone weight after repeatedly smashing the heaviest stones, and rearranging barcodes so that no adjacent barcodes are equal. Code solutions using a max-heap priority queue are provided for both problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Hardik 1.3 Ap

    Uploaded by

    Hardik
    17 views5 pages
    The document discusses two heap problems - finding the last remaining stone weight after repeatedly smashing the heaviest stones, and rearranging barcodes so that no adjacent barcodes are equal. Code solutions using a max-heap priority queue are provided for both problems.

    Original Description:

    New Arithmetic progression docs

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses two heap problems - finding the last remaining stone weight after repeatedly smashing the heaviest stones, and rearranging barcodes so that no adjacent barcodes are equal. Code solutions using a max-heap priority queue are provided for both problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    17 views5 pages

    Hardik 1.3 Ap

    Uploaded by

    Hardik
    The document discusses two heap problems - finding the last remaining stone weight after repeatedly smashing the heaviest stones, and rearranging barcodes so that no adjacent barcodes are equal. Code solutions using a max-heap priority queue are provided for both problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 5

    DEPARTMENT OF

    COMPUTER SCIENCE & ENGINEERING

    Experiment 1.3

    Student Name: Hardik Singh UID: 21 BCS10108


    Branch: BE-CSE Section/Group:21BCS_SC-906-A
    Semester: 6th Date of Performance: 06-02-2024
    Subject Name: AP Lab Subject Code: 21CSP-351

    1. Aim:
    Understand the concept of Heap model.

    2. Problems:
    a: Last Stone Weight
    You are given an array of integers stones where stones[i] is the weight of the ith stone.
    We are playing a game with the stones. On each turn, we choose the heaviest two
    stones and smash them together. Suppose the heaviest two stones have weights x and
    y with x <= y.
    The result of this smash is:
    If x == y, both stones are destroyed, and If x != y, the stone of weight x is destroyed,
    and the stone of weight y has new weight y - x.
    At the end of the game, there is at most one stone left.
    Return the weight of the last remaining stone. If there are no stones left, return 0.

    b: Distant Barcodes
    In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].
    Rearrange the barcodes so that no two adjacent barcodes are equal. You may return
    any answer, and it is guaranteed an answer exists.

    3. Code:
    a:
    class Solution {
    public:
    int lastStoneWeight(vector<int>& stones) {
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    priority_queue<int> max_heap;
    for (int stone : stones) {
    max_heap.push(stone);
    }
    while (max_heap.size() > 1) {
    int y = max_heap.top(); max_heap.pop();
    int x = max_heap.top(); max_heap.pop();
    if (x != y) {
    max_heap.push(y - x);
    }
    }
    return max_heap.empty() ? 0 : max_heap.top();
    }
    };
    b:
    class Solution {
    public:
    vector<int> rearrangeBarcodes(vector<int>& barcodes) {
    unordered_map<int, int> frequencyMap;
    priority_queue<pair<int, int>> maxHeap;
    for (int barcode : barcodes) {
    frequencyMap[barcode]++;
    }
    for (auto& entry : frequencyMap) {
    maxHeap.push({entry.second, entry.first});
    }
    vector<int> result(barcodes.size());
    int index = 0;
    while (!maxHeap.empty()) {
    auto [freq1, barcode1] = maxHeap.top();
    maxHeap.pop();
    result[index] = barcode1;
    index++;
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    if (!maxHeap.empty()) {
    auto [freq2, barcode2] = maxHeap.top();
    maxHeap.pop();
    result[index] = barcode2;
    index++;
    if (--freq2 > 0) {
    maxHeap.push({freq2, barcode2});
    }
    }
    if (--freq1 > 0) {
    maxHeap.push({freq1, barcode1});
    }
    }
    return result;
    }
    };

    4. Output:
    a.
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    b.
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    You might also like