Submission #629539

#	Time	Username	Problem	Language	Result	Execution time	Memory
629539		vovamr	Radio (COCI22_radio)	C++17	110 / 110	724 ms	144864 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 1e6 + 100;
ve<int> pr; int lp[N];

ve<int> fact[N];
set<int> occ[N];

int cl[N];

int t[2 * N];
inline void build() { fill(t, t + 2 * N, -iinf); }
inline void upd(int i, int x) {
	t[i += N] = x;
	while (i > 1) { t[i >> 1] = max(t[i], t[i ^ 1]); i >>= 1; }
}
inline int get(int l, int r) {
	int res = -iinf;
	l += N, r += N + 1;
	while (l < r) {
		if (l & 1) chmax(res, t[l++]);
		if (r & 1) chmax(res, t[--r]);
		l >>= 1, r >>= 1;
	} return res;
}

inline void solve() {
	for (int i = 2; i < N; ++i) {
		if (!lp[i]) lp[i] = i, pr.pb(i);
		for (int j = 0; j < sz(pr) && i * pr[j] < N && pr[j] <= lp[i]; ++j) {
			lp[i * pr[j]] = pr[j];
		}
	}
//	for (int i = 2; i < N; ++i) {
//		if (lp[i] < i) continue;
//		for (int j = i; j < N; j += i) fact[j].pb(i);
//	}
	for (int i = 2; i < N; ++i) {
		int x = i;
		while (x > 1) {
			int d = lp[x]; fact[i].pb(d);
			while (x % d == 0) x /= d;
		}
	}

	int n, q;
	cin >> n >> q;

	ve<int> active(n + 1);
	for (int i = 1; i <= n; ++i) cl[i] = -iinf;
	build();

	while (q--) {
		char te;
		cin >> te;
		if (te == 'S') {
			int x;
			cin >> x;
			active[x] ^= 1;

			if (active[x]) {
				cl[x] = -iinf;
				for (int &d : fact[x]) {
					auto it = occ[d].lower_bound(x);
					int right = it != occ[d].end() ? *it : iinf;
					int left = it != occ[d].begin() ? *--it : -iinf;

					chmax(cl[x], left);
					if (right != iinf) {
						if (cl[right] < x) {
							cl[right] = x;
							upd(right, cl[right]);
						}
					}
				}
				for (int &d : fact[x]) occ[d].insert(x);
				upd(x, cl[x]);
			}
			else {
				upd(x, -iinf); cl[x] = -iinf;
				for (int &d : fact[x]) occ[d].erase(x);
				for (int &d : fact[x]) {
					auto it = occ[d].lower_bound(x);
					int right = it != occ[d].end() ? *it : iinf;

					if (right != iinf) {
						cl[right] = -iinf;
						for (int &f : fact[right]) {
							auto it1 = occ[f].lower_bound(right);
							if (it1 != occ[f].begin()) chmax(cl[right], *--it1);
						}
						upd(right, cl[right]);
					}
				}
			}

//			for (int i = 1; i <= n; ++i) {
//				if (!active[i]) continue;
//				cout << i << " -> (" << cl[i] << ", " << cr[i] << ")" << '\n';
//			}
//			cout << '\n';
		}
		else {
			int l, r;
			cin >> l >> r;
			if (get(l, r) >= l) cout << "DA" << '\n';
			else cout << "NE" << '\n';
		}
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 70 / 70