Submission #781123

#	Time	Username	Problem	Language	Result	Execution time	Memory
781123		Charizard2021	Swap (BOI16_swap)	C++17	0 / 100	4 ms	9684 KiB

swap

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
    a = max(a, b);
}
void selfMin(long long& a, long long b){
    a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};

/*

Use DSU dsu(N);

*/
struct DSU {
	vector<long long> e;
	DSU(long long N) { e = vector<long long>(N, -1); }

	// get representive component (uses path compression)
	long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

	bool same_set(long long a, long long b) { return get(a) == get(b); }

	long long size(long long x) { return -e[get(x)]; }

	bool unite(long long x, long long y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y]; e[y] = x;
		return true;
	}
};
/*

Run with Bit<long long> BIT

*/
template <class T> class BIT {
    private:
        long long size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(long long size) : size(size), bit(size + 1), arr(size) {}
        void set(long long ind, long long val) { add(ind, val - arr[ind]); }
        void add(long long ind, long long val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(long long ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	long long n; vector<T> seg;
	void init(long long _n) { n = _n; seg.assign(2*n,ID); }
	void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(long long p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(long long l, long long r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
const int N = 200001;
int n;
int a[N];
map<int, int> mp[N];
int findVal(int idx, int cur){
    if(mp[idx].find(cur) != mp[idx].end()){
        return mp[idx][cur];
    }
    if(idx * 2 > n){
        mp[idx][cur] = idx;
        return mp[idx][cur];
    }
    if(cur < a[idx * 2] && cur < a[idx * 2 + 1]){
        mp[idx][cur] = idx;
        return mp[idx][cur];
    }
    if(a[idx * 2] < cur && a[idx * 2] < a[idx * 2 + 1]){
        mp[idx][cur] = findVal(idx * 2, cur);
        return mp[idx][cur];
    }
    else{
        int val2 = min(cur, a[idx * 2]);
        int val3 = max(cur, a[idx * 2]);
        if(findVal(idx * 2, val2) < findVal(idx * 2 + 1, val2)){
            if(cur == val2){
                mp[idx][cur] = findVal(idx * 2, cur);
                return mp[idx][cur];
            }
            else{
                mp[idx][cur] = findVal(idx * 2 + 1, cur);
                return mp[idx][cur];
            }
        }
        else{
            if(cur == val2){
                mp[idx][cur] = findVal(idx * 2 + 1, cur);
                return mp[idx][cur];
            }
            else{
                mp[idx][cur] = findVal(idx * 2, cur);
                return mp[idx][cur];
            }
        }
    }
}
int main() {
    IOS;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int idx = 1; idx <= n; idx++){
        if(idx * 2 < n && (a[idx] >= a[idx * 2] || a[idx] >= a[idx * 2 + 1])){
            if(a[idx * 2] < a[idx] && a[idx * 2] < a[idx * 2 + 1]){
                swap(a[idx * 2], a[idx]);
            }
            else{
                int val2 = min(a[idx], a[idx * 2]);
                int val3 = max(a[idx], a[idx * 2]);
                swap(a[idx * 2 + 1], a[idx]);
                if(findVal(idx * 2, val2) < findVal(idx * 2 + 1, val2)){
                    a[idx * 2] = val2;
                    a[idx * 2 + 1] = val3;
                }
                else{
                    a[idx * 2] = val3;
                    a[idx * 2 + 1] = val2;
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        cout << a[i] << " ";
    }
    cout << "\n";
}

Compilation message (stderr)

swap.cpp: In function 'int findVal(int, int)':
swap.cpp:110:13: warning: unused variable 'val3' [-Wunused-variable]
  110 |         int val3 = max(cur, a[idx * 2]);
      |             ^~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32