oj.uz

Submission #422028

# Submission time Handle Problem Language Result Execution time Memory
422028 2021-06-09T15:02:03 Z _fractal Nekameleoni (COCI15_nekameleoni) C++14
140 / 140
 1609 ms 210636 KB 
/**
 *	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];
pii ls[N], cn;
bitset<50> is;

struct tree {
	int R[50][N << 2], L[50][N << 2], t[N << 2];
	vector<pii> ls[N << 2];
	int sz = 1;

	void merge(int v, int l, int r) {
		int x = 0, y = 0;
		ls[v].clear();
		is.reset();
		for (auto it : ls[r])
			is[it.S] = 1;
		for (auto it : ls[l]) {
			if (is[it.S] == 0)
				ls[v].pb(it);
		}
		for (auto it : ls[r])
			ls[v].pb(it);
		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]);
		int ansr = 0;
		if (!sz(ls[l])) return;
		is.reset();
		for (int i = 0; i < sz(ls[l]); ++i)
			is[ls[l][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[l][0].F + 1);
		for (int i = 0; i + 1 < sz(ls[l]); ++i) {
			ansr = max(ansr, L[ls[l][i].S][r]);
			if (ansr == inf)
				return;
			t[v] = min(t[v], ansr - ls[l][i + 1].F + 1);
		}
		return;
	}

	void build() {
		int v = 0;
		for (int pos = 1; pos <= sz; ++pos) {
			v = pos + sz - 1;
			t[v] = (k == 1 && pos <= n ? 1 : inf);
			ls[v].clear();
			for (int i = 0; i < k; ++i) {
				if (i == a[pos] && pos <= n)
					ls[v].pb({pos, i});
				R[i][v] = (i == a[pos] && pos <= n ? pos : -inf);
				L[i][v] = (i == a[pos] && pos <= n ? pos : +inf);
			}
		}
		int z = 2;
		while (z <= sz) {
			for (int pos = 1; pos <= sz / z; ++pos) {
				v = pos + sz / z - 1;
				merge(v, v << 1, v << 1 | 1);
			}
			z <<= 1;
		}
	}

	void upd(int pos, int v = 0) {
		v = pos + sz - 1;
		t[v] = (k == 1 && pos <= n ? 1 : inf);
		ls[v].clear();
		for (int i = 0; i < k; ++i) {
			if (i == a[pos] && pos <= n)
				ls[v].pb({pos, i});
			R[i][v] = (i == a[pos] && pos <= n ? pos : -inf);
			L[i][v] = (i == a[pos] && pos <= n ? pos : +inf);
		}
		v >>= 1;
		while (v) {
			merge(v, v << 1, v << 1 | 1);
			v >>= 1;
		}
	}
} t;

int main() {
	speed;
	cin >> n >> k >> q;
	while (t.sz < n) t.sz <<= 1;
	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::merge(int, int, int)':
nekameleoni.cpp:98:7: warning: unused variable 'x' [-Wunused-variable]
   98 |   int x = 0, y = 0;
      |       ^
nekameleoni.cpp:98:14: warning: unused variable 'y' [-Wunused-variable]
   98 |   int x = 0, y = 0;
      |              ^
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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 95728 KB Output is correct
2 Correct 60 ms 95816 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 99400 KB Output is correct
2 Correct 69 ms 99396 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 102100 KB Output is correct
2 Correct 89 ms 102124 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 482 ms 123552 KB Output is correct
2 Correct 1465 ms 207224 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 740 ms 153248 KB Output is correct
2 Correct 1502 ms 209832 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1016 ms 152048 KB Output is correct
2 Correct 1575 ms 208572 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1198 ms 154876 KB Output is correct
2 Correct 1586 ms 209104 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1199 ms 154228 KB Output is correct
2 Correct 1549 ms 209472 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1553 ms 210480 KB Output is correct
2 Correct 1595 ms 210636 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1574 ms 210412 KB Output is correct
2 Correct 1609 ms 210632 KB Output is correct