Iwara 的题解在 for(auto X:point[now]){ 的时间复杂度是错误的。可以使用如下 GEN 来 Hack。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <chrono>
#include <random>
#include <algorithm>

using namespace std;

typedef long long num;

inline num rand(num l, num r){
	static unsigned seed = chrono::system_clock::now().time_since_epoch().count();
	static mt19937 rand_num(seed);
	uniform_int_distribution<num> dist(l, r);
	return dist(rand_num);
}

const int n = 100000, q = 100000, t = 32;

#define xym(Expr) do { Expr; if (++done == n) goto OK; } while (false)

signed main(){
	freopen("xym", "w", stdout);
	cout << n << ' ' << q << endl;
	for (int done = 0, term = 1; ; ++term){
		string str = "1";
		for (int i = 1; i <= t; ++i, str += "1"){
			xym(cout << "ADD" << ' ' << str << endl);
			xym(cout << "DEL" << ' ' << str << endl);
		}
	}
	OK:
	for (int i = 1; i <= q; ++i){
		cout << "11111111111111111111111111111111" << ' ' << 1 << ' ' << n << endl;
	}
	return 0;
}

所以，现在题解区没人强制在线了。