#include <bits/stdc++.h>
#include <ctime>
using namespace std;
using ll = long long;
int N, K, Q;
const int INF = 1e9;
struct Node{
int ans;
int L[55] = {}, R[55] = {};
Node(){}
Node(int _ans){ans = _ans; for(ll i = 0; i < 55; i++) L[i] = INF, R[i] = -INF;}
};
Node f(Node &p, Node &q){
Node ret(min(p.ans, q.ans));
for(int i = 1; i <= K; i++){
ret.L[i] = min(p.L[i], q.L[i]);
ret.R[i] = max(p.R[i], q.R[i]);
}
vector<pair<int, int>> V;
for(int i = 1; i <= K; i++){
V.push_back({p.R[i], i});
}
sort(V.begin(), V.end());
int r = -1;
for(int i = 0; i + 1 < K; i++){
if(q.L[V[i].second] == -INF) break;
r = max(r, q.L[V[i].second]);
ret.ans = min(ret.ans, r - V[i + 1].first + 1);
}
clock_t t2 = clock();
return ret;
}
Node T[400005];
void update(int n, int s, int e, int k, int v){
if(s == e){
T[n] = Node(K == 1 ? 1 : INF);
T[n].L[v] = T[n].R[v] = k;
return;
}
int m = (s + e) / 2;
if(k <= m) update(n * 2, s, m, k, v);
else update(n * 2 + 1, m + 1, e, k, v);
T[n] = f(T[n * 2], T[n * 2 + 1]);
}
int main(){
cin.tie(0) -> sync_with_stdio(false);
fill(T, T + 400005, Node(INF));
cin >> N >> K >> Q;
for(int i = 1; i <= N; i++){
int v; cin >> v;
update(1, 1, N, i, v);
}
clock_t t1 = clock();
while(Q--){
int op; cin >> op;
if(op == 1){
int k, v; cin >> k >> v;
update(1, 1, N, k, v);
} else {
cout << (T[1].ans > N ? -1 : T[1].ans) << '\n';
}
clock_t t2 = clock();
}
assert((double)(t2 - t1) / CLOCKS_PER_SEC <= 0.1);
}
Compilation message
nekameleoni.cpp: In function 'Node f(Node&, Node&)':
nekameleoni.cpp:31:13: warning: unused variable 't2' [-Wunused-variable]
31 | clock_t t2 = clock();
| ^~
nekameleoni.cpp: In function 'int main()':
nekameleoni.cpp:65:17: warning: unused variable 't2' [-Wunused-variable]
65 | clock_t t2 = clock();
| ^~
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from nekameleoni.cpp:1:
nekameleoni.cpp:67:21: error: 't2' was not declared in this scope; did you mean 't1'?
67 | assert((double)(t2 - t1) / CLOCKS_PER_SEC <= 0.1);
| ^~
