Tunnels

#include <functional>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < int(b); ++i)
#define rrep(i,a,b) for(int i = (b); i --> int(a); )
#define trav(i,v) for(auto&i:v)
#define all(c) (c).begin(), (c).end()
#define sz(c) int((c).size())
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
	cin.tie(0);
	cin.sync_with_stdio(0);
	int n,k;
	cin >> n >> k;
	vi v(n);
	trav(i,v) cin >> i;
	set<pii> S;
	map<int,int> C;
	function<void(int)> add = [&](int a){
		if(C[a]++) return;
		if(S.empty()){
			S.insert({a,a});
			return;
		}
		auto it = S.lower_bound({a,-1});
		if(it == S.begin()){
			if(it->first == a+1){
				pii p = *it;
				S.erase(it);
				S.insert({a,p.second});
			} else S.insert({a,a});
		} else if(it == S.end()) {
			--it;
			if(it->second == a-1){
				pii p = *it;
				S.erase(it);
				S.insert({p.first,a});
			} else S.insert({a,a});
		} else {
			auto it2 = it--;
			if(it->second == a-1 && it2->first == a+1){
				pii p = {it->first,it2->second};
				S.erase(it),S.erase(S.upper_bound({a,-1}));
				S.insert(p);
			} else if(it->second == a-1){
				pii p = {it->first,a};
				S.erase(it);
				S.insert(p);
			} else if(it2->first == a+1){
				pii p = {a,it2->second};
				S.erase(it2);
				S.insert(p);
			} else S.insert({a,a});
		}
	}, rem = [&](int a){
		if(--C[a]) return;
		auto it = --S.upper_bound({a,-1});
		pii p = *it;
		S.erase(it);
		if(p.first == a){
			if(p.first != p.second) S.insert({a+1,p.second});
		} else if(p.second == a)
			S.insert({p.first,a-1});
		else
			S.insert({p.first,a-1}),S.insert({a+1,p.second});
	};
	rep(i,0,k) add(v[i]);
	rep(i,k,n+1){
		pii p = *S.begin();
		if(!p.first) cout << p.second+1 << " ";
		else cout << p.first-1 << " ";
		if(i < n)add(v[i]);
		rem(v[i-k]);
	}
	cout << endl;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: RUNTIME ERROR

*** Error in `input/code': free(): invalid pointer: 0x00007ffc290feed8 ***

Test 9

Group: 2

Verdict: RUNTIME ERROR

*** Error in `input/code': free(): invalid pointer: 0x00007ffeb040e9b8 ***

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: RUNTIME ERROR

*** Error in `input/code': free(): invalid pointer: 0x00007ffd58f55548 ***

Test 14

Group: 3

Verdict: RUNTIME ERROR

*** Error in `input/code': free(): invalid pointer: 0x00007ffd7dccdc48 ***

Test 15

Group: 3

Verdict: RUNTIME ERROR