/**
* author: fractal
* timus: 288481RF
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) (int)x.size()
#define len(x) (int)strlen(x)
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub upper_bound
#define lb lower_bound
#define nl printf("\n");
#define clbuff fflush(stdin);
#define make_unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef set<int> si;
typedef set<ll> sll;
typedef set<pii> spii;
typedef set<pll> spll;
typedef multiset <int> msi;
typedef multiset <ll> msll;
typedef map <int, int> mi;
typedef map <ll, ll> mll;
const int N = 1e6 + 2;
const int M = 1e5;
const int mod = 0;
const int inf = 2e9 + 3;
const ll INF = 1e18;
const ld pi2 = 2.0 * 3.141592;
const ld pi = 3.141592;
const ld eps = 1e-12;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
void files(string s = "main") {
#ifndef PC
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
#endif
}
int add(int a, int b) {
if (a + b < 0) return a + b + mod;
if (a + b >= mod) return a + b - mod;
return a + b;
}
int mul(int a, int b) {
return a * 1LL * b % mod;
}
int binpow(int a, int n) {
int ret = 1;
while (n) {
if (n & 1) ret = mul(ret, a);
a = mul(a, a);
n >>= 1;
}
return ret;
}
int n, k, q;
int a[N];
vector<pii> ls, rs;
bitset<50> is;
struct tree {
int R[50][N << 2], L[50][N << 2], t[N << 2];
void merge(int v, int l, int r) {
for (int i = 0; i < k; ++i) {
L[i][v] = min(L[i][l], L[i][r]);
R[i][v] = max(R[i][l], R[i][r]);
}
t[v] = min(t[l], t[r]);
ls.clear();
int ansr = 0;
for (int i = 0; i < k; ++i) {
if (R[i][l] != -inf)
ls.pb({R[i][l], i});
}
if (!sz(ls)) return;
sort(all(ls));
is.reset();
for (int i = 0; i < sz(ls); ++i)
is[ls[i].S] = 1;
for (int i = 0; i < k; ++i) {
if (is[i] == 0) {
ansr = max(ansr, L[i][r]);
if (ansr == inf)
return;
is[i] = 1;
}
}
if (ansr) t[v] = min(t[v], ansr - ls[0].F + 1);
for (int i = 0; i + 1 < sz(ls); ++i) {
ansr = max(ansr, L[ls[i].S][r]);
if (ansr == inf)
return;
t[v] = min(t[v], ansr - ls[i + 1].F + 1);
}
return;
}
void build(int v = 1, int tl = 1, int tr = n) {
if (tl == tr) {
t[v] = (k == 1 ? 1 : inf);
for (int i = 0; i < k; ++i) {
R[i][v] = (i == a[tl] ? tl : -inf);
L[i][v] = (i == a[tl] ? tl : +inf);
}
return;
}
int tm = tl + tr >> 1;
build(v * 2, tl, tm);
build(v * 2 + 1, tm + 1, tr);
merge(v, v * 2, v * 2 + 1);
}
void upd(int pos, int v = 1, int tl = 1, int tr = n) {
if (tl == tr) {
t[v] = (k == 1 ? 1 : inf);
for (int i = 0; i < k; ++i) {
R[i][v] = (i == a[tl] ? tl : -inf);
L[i][v] = (i == a[tl] ? tl : +inf);
}
return;
}
int tm = tl + tr >> 1;
if (pos <= tm)
upd(pos, v * 2, tl, tm);
else
upd(pos, v * 2 + 1, tm + 1, tr);
merge(v, v * 2, v * 2 + 1);
}
} t;
int main() {
speed;
cin >> n >> k >> q;
for (int i = 1; i <= n; ++i)
cin >> a[i], a[i]--;
t.build();
while (q--) {
int tp, p, x;
cin >> tp;
if (tp == 1) {
cin >> p >> x;
a[p] = x - 1;
t.upd(p);
}
else {
cout << (t.t[1] == inf ? -1 : t.t[1]) << '\n';
}
}
}
Compilation message
nekameleoni.cpp: In function 'int mul(int, int)':
nekameleoni.cpp:74:21: warning: division by zero [-Wdiv-by-zero]
74 | return a * 1LL * b % mod;
| ~~~~~~~~~~~~^~~~~
nekameleoni.cpp: In member function 'void tree::build(int, int, int)':
nekameleoni.cpp:139:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
139 | int tm = tl + tr >> 1;
| ~~~^~~~
nekameleoni.cpp: In member function 'void tree::upd(int, int, int, int)':
nekameleoni.cpp:154:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
154 | int tm = tl + tr >> 1;
| ~~~^~~~
nekameleoni.cpp: In function 'void files(std::string)':
nekameleoni.cpp:62:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
62 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nekameleoni.cpp:63:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
1504 KB |
Output is correct |
| 2 |
Correct |
11 ms |
1624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
5048 KB |
Output is correct |
| 2 |
Correct |
35 ms |
4940 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
75 ms |
7688 KB |
Output is correct |
| 2 |
Correct |
75 ms |
7676 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
854 ms |
27648 KB |
Output is correct |
| 2 |
Correct |
2797 ms |
106340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1361 ms |
53860 KB |
Output is correct |
| 2 |
Correct |
2967 ms |
106388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1870 ms |
53980 KB |
Output is correct |
| 2 |
Execution timed out |
3092 ms |
106268 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2306 ms |
54204 KB |
Output is correct |
| 2 |
Execution timed out |
3098 ms |
106296 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2250 ms |
54260 KB |
Output is correct |
| 2 |
Execution timed out |
3076 ms |
106328 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2779 ms |
106184 KB |
Output is correct |
| 2 |
Execution timed out |
3081 ms |
106288 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2868 ms |
106188 KB |
Output is correct |
| 2 |
Execution timed out |
3073 ms |
106396 KB |
Time limit exceeded |
