******************************* *** The hack uses generator *** ******************************* ** Command line arguments ** no arguments ** Generated test ** 10000 20 200000 2 2 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 20 200000 2 2 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 20 200000 2 2 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 199998 20 200000 2 2 199998 199998 199998 199998 199998 199998 199998 199998 199998 ... ** Generator source ** #include using namespace std; template ostream& operator<<(ostream& os, const vector& t) { for(int i = 0; i < (int)t.size(); i++) { cout << t[i]; if(i != (int)t.size() - 1) cout << " "; } return os; } template void putSingle(A a) { cout << a; } void put() { cout << "\n"; } template void put(T t, V... v) { putSingle(t); if(sizeof...(v)) cout << " "; put(v...); } void putGraph(vector> g, bool dir = false) { for(int i = 0; i < (int)g.size(); i++) for(auto v: g[i]) if(dir || i < v) cout << i + 1 << " " << v + 1 << "\n"; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int genInt(int l, int r) { uniform_int_distribution d(l, r); return d(rng); } long long genLong(long long l, long long r) { uniform_int_distribution d(l, r); return d(rng); } vector> genTree(int n) { vector> ans(n); for(int i = 1; i < n; i++) { int r = genInt(0, i - 1); ans[r].push_back(i); ans[i].push_back(r); } return ans; } void genTest(int tc) { put(20, 200000); put(vector(2, 2), vector(18, 199998)); } int main() { const char* STRESS_PATH = "input.txt"; const int TESTS_COUNT = 10000; const bool MULTITEST = true; // freopen(STRESS_PATH, "w", stdout); if(!MULTITEST) { genTest(0); exit(0); } cout << TESTS_COUNT << "\n"; for(int i = 0; i < TESTS_COUNT; i++) genTest(i); }