#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Generate a pool of unique employee names int MaxNames = rnd.next(3, 10); const string letters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"; set used; vector pool; while ((int)pool.size() < MaxNames) { int len = rnd.next(1, 5); string s; for (int i = 0; i < len; i++) { s += rnd.any(letters); } if (used.insert(s).second) { pool.push_back(s); } } // Decide number of log records int n = rnd.next(2, 20); vector> logs; set inside; for (int i = 1; i <= n; i++) { bool isLast = (i == n); if (isLast && inside.empty()) { // Force an enter to ensure someone remains inside vector canEnter; for (auto &name : pool) { if (!inside.count(name)) canEnter.push_back(name); } string who = rnd.any(canEnter); inside.insert(who); logs.emplace_back(who, "enter"); continue; } if (inside.empty()) { // Must enter vector canEnter; for (auto &name : pool) { if (!inside.count(name)) canEnter.push_back(name); } string who = rnd.any(canEnter); inside.insert(who); logs.emplace_back(who, "enter"); } else if ((int)inside.size() == (int)pool.size()) { // Everyone is inside, must leave vector vinside(inside.begin(), inside.end()); string who = rnd.any(vinside); inside.erase(who); logs.emplace_back(who, "leave"); } else { // Mixed: choose enter or leave if (rnd.next(0,1) == 0) { // enter someone not inside vector canEnter; for (auto &name : pool) { if (!inside.count(name)) canEnter.push_back(name); } string who = rnd.any(canEnter); inside.insert(who); logs.emplace_back(who, "enter"); } else { // leave someone inside vector vinside(inside.begin(), inside.end()); string who = rnd.any(vinside); inside.erase(who); logs.emplace_back(who, "leave"); } } } // Output println(n); for (auto &rec : logs) { println(rec.first, rec.second); } return 0; }

코드 #2422