Files
Roman Pytkov e154890897
Some checks failed
Build and Push Docker Images / build (src/LiquidCode.Tester.Gateway/Dockerfile, git.nullptr.top/liquidcode/liquidcode-tester-gateway-roman, gateway) (push) Successful in 1m12s
Build and Push Docker Images / build (src/LiquidCode.Tester.Worker/Dockerfile, git.nullptr.top/liquidcode/liquidcode-tester-worker-roman, worker) (push) Has been cancelled
Штуки
2025-11-02 19:31:34 +03:00

87 lines
2.2 KiB
C++

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include "testlib.h"
using namespace std;
int main(int argc, char* argv[]) {
registerGen(argc, argv, 1);
int t = opt<int>(1);
vector<int> a;
vector<vector<int>> b;
if (t == 1) {
a.push_back(1);
b.push_back({ 1, 2, 1 });
}
if (t == 2) {
a.push_back(1);
for (int i = 0; i < 100000; i += 2) {
b.push_back({ 1, 2, 1 });
b.push_back({ 3, 2 });
}
}
if (t == 3) {
a.push_back(1e9);
for (int i = 0; i < 50000; i++)
b.push_back({ 2, i + 1 });
for (int i = 0; i < 50000; i++)
b.push_back({ 3, i + 1 });
}
if (t == 4) {
for (int i = 0; i < 100000; i++)
a.push_back(i + 1);
for (int i = 0; i < 100000; i++)
b.push_back({ 3, i + 1 });
}
if (t == 5) {
for (int i = 0; i < 100000; i++)
a.push_back(i + 1);
for (int i = 0; i < 100000; i++)
b.push_back({ 1, 100000 + i + 1, i + 1 });
}
if (t == 6) {
for (int i = 0; i < 100000; i++)
a.push_back(1e9 - i);
for (int i = 0; i < 50000; i++) {
b.push_back({ 1, i + 1, (int)1e9 - i });
b.push_back({ 3, (int)1e9 - i });
}
}
if (t == 7) {
for (int i = 0; i < 100000; i++)
a.push_back(1e9 - i);
for (int i = 0; i < 100000; i++)
b.push_back({ 3, (int)1e9 - i });
}
if (t == 8) {
for (int i = 0; i < 100000 && b.size() < 100000; i++)
a.push_back(i + 1);
for (int i = 0; i < 100000 && b.size() < 100000; i++)
b.push_back({ 3, (int)1e5 - i });
}
if (t == 9) {
for (int i = 0; i < 100000; i++)
a.push_back(i + 1);
for (int i = 0; i < 100000 && b.size() < 100000; i += 2)
b.push_back({ 3, i + 1 });
for (int i = 0; i < 100000 && b.size() < 100000; i += 2)
b.push_back({ 2, i + 1 });
}
if (t == 10) {
for (int i = 100000; i > 0; i--)
a.push_back(i);
for (int i = 0; i < 100000 && b.size() < 100000; i += 2)
b.push_back({ 3, i + 1 });
for (int i = 0; i < 100000 && b.size() < 100000; i += 2)
b.push_back({ 2, i + 1 });
}
cout << a.size() << ' ' << b.size() << '\n';
for (int i = 0; i < a.size(); i++)
cout << a[i] << " \n"[i + 1 == a.size()];
for (auto i : b) {
for (int j = 0; j < i.size(); j++)
cout << i[j] << " \n"[j + 1 == i.size()];
}
}