Submission #67352169

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <deque>
#include <algorithm>

using namespace std;
using loong = long long;


using pp = pair<int,int>;
int demx = 1'000'000'000;
struct segTreeMin{
public:
    void placeholder();
    int nxt, u, v, sm;

    int logup(int n){
        int res = 1;
        while (res < n){
            res *= 2;
        }
        return res;
    }

    segTreeMin(){

    }

    segTreeMin(int sze, vector<int> &base){
        rsz = sze;
        sz = logup(sze);
        dsz = 2*sz;

        data = vector<pp>(dsz, {demx, 0});
        lbound = vector<int>(dsz, 0);
        rbound = vector<int>(dsz, 0);

        for (int i = 0; i < sz; i++){
            lbound[sz+i] = i;
            rbound[sz+i] = i;
        }
        for (int i = 0; i < rsz; i++){
            data[i+sz] = {base[i], i};
        }

        for (int i = sz-1; i > 0; i--){
            lbound[i] = lbound[2*i];
            rbound[i] = rbound[2*i+1];
            data[i] = min(data[i*2],data[i*2+1]);
        }
    }



    pp getMin(int l, int r, int curr){
        if (l > rbound[curr] || lbound[curr] > r){
            return {demx, 0};
        }
        if (l <= lbound[curr] && rbound[curr] <= r){
            return data[curr];
        }
        pp lsm = {demx, 0};
        lsm = min(lsm, getMin(l, r, curr * 2));
        lsm = min(lsm, getMin(l, r, curr * 2 + 1));
        return lsm;
    }

    void updateMin(int l, int r, int val, int curr){
        if (l > rbound[curr] || lbound[curr] > r){
            return;
        }
        if (l <= lbound[curr] && rbound[curr] <= r){
            data[curr].first+=val;
            return;
        }
        updateMin(l, r, val, curr * 2);
        updateMin(l, r, val, curr * 2 + 1);
        data[curr] = min(data[curr*2],data[curr*2+1]);
        return;
    }
    void updateMin(int l, int r, int val){
        updateMin(l, r, val, 1);
    }

    pp getMin(int l, int r){
        return getMin(l, r, 1);
    }


    int rsz;
    int sz;
    int dsz;
    vector<pp> data;
    vector<int> lbound;
    vector<int> rbound;
};




void buildMin(vector<int> &data, vector<int> &res, int strt, int sze, segTreeMin &tree){
    //cout << sze << endl;
    if (sze == 1){
        res.push_back(data[strt]);
        return;
    }
    pp ixMin = tree.getMin(strt, strt+sze-1);
    if (ixMin.second >= strt+sze/2){
        buildMin(data, res, strt+sze/2, sze/2, tree);
        buildMin(data, res, strt, sze/2, tree);
    } else {
        buildMin(data, res, strt, sze/2, tree);
        buildMin(data, res, strt+sze/2, sze/2, tree);
    }
}


int main() {

    int n, m, a, b, t, p, q;

    cin >> n;

    for (int i = 0; i < n; i++){
        cin >> t;
        t = (1<<(t));
        vector<int> dd(t);
        for (int j = 0; j < t; j++){
            cin >> dd[j];
        }
        vector<int> res;
        segTreeMin tree(dd.size(), dd);

        buildMin(dd, res, 0, dd.size(), tree);
        for (int j = 0; j < res.size(); j++){
            cout << res[j] << " ";
        }
        cout << endl;
    }


}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:137:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  137 |         for (int j = 0; j < res.size(); j++){
      |                         ~~^~~~~~~~~~~~
Main.cpp:122:12: warning: unused variable ‘m’ [-Wunused-variable]
  122 |     int n, m, a, b, t, p, q;
      |            ^
Main.cpp:122:15: warning: unused variable ‘a’ [-Wunused-variable]
  122 |     int n, m, a, b, t, p, q;
      |               ^
Main.cpp:122:18: warning: unused variable ‘b’ [-Wunused-variable]
  122 |     int n, m, a, b, t, p, q;
      |                  ^
Main.cpp:122:24: warning: unused variable ‘p’ [-Wunused-variable]
  122 |     int n, m, a, b, t, p, q;
      |                        ^
Main.cpp:122:27: warning: unused variable ‘q’ [-Wunused-variable]
  122 |     int n, m, a, b, t, p, q;
      |                           ^

Judge Result