#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of nodes int N = rnd.next(1, 10); // Define generation modes for diversity vector modes = {"full", "chain", "star", "forest", "random"}; string mode = rnd.any(modes); if(rnd.next() < 0.1) { mode = "empty"; } else { mode = rnd.any(modes); } vector> edges; // Helper: list of all nodes vector nodes; for (int i = 1; i <= N; i++) nodes.push_back(i); if (mode == "empty") { // No edges } else if (mode == "full") { // Complete graph for (int i = 1; i <= N; i++) for (int j = i + 1; j <= N; j++) edges.emplace_back(i, j); } else if (mode == "chain") { // Random chain over all nodes shuffle(nodes.begin(), nodes.end()); for (int i = 1; i < N; i++) edges.emplace_back(nodes[i-1], nodes[i]); } else if (mode == "star") { // One center connected to all others int center = rnd.next(1, N); for (int v = 1; v <= N; v++) { if (v == center) continue; edges.emplace_back(center, v); } } else if (mode == "forest") { // Random forest: pick number of components c int c = rnd.next(1, N); shuffle(nodes.begin(), nodes.end()); // Initialize components, give each comp one node vector> comps(c); for (int i = 0; i < c; i++) { comps[i].push_back(nodes[i]); } // Assign remaining nodes for (int i = c; i < N; i++) { int id = rnd.next(0, c-1); comps[id].push_back(nodes[i]); } // Within each component, connect as a chain for (auto &comp : comps) { if (comp.size() > 1) { shuffle(comp.begin(), comp.end()); for (int i = 1; i < (int)comp.size(); i++) edges.emplace_back(comp[i-1], comp[i]); } } } else if (mode == "random") { // Fully random selection of edges vector> all; for (int i = 1; i <= N; i++) for (int j = i + 1; j <= N; j++) all.emplace_back(i, j); shuffle(all.begin(), all.end()); int M = rnd.next(0, (int)all.size()); edges.assign(all.begin(), all.begin() + M); } // Final shuffle for diversity shuffle(edges.begin(), edges.end()); // Output println(N, (int)edges.size()); for (auto &e : edges) { println(e.first, e.second); } return 0; }

코드 #5478