19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"CodeViewer"] 1b:T62d,#include #include #include #include #include using namespace std; void solve() { int n; cin >> n; cin.ignore(); // To ignore the newline after reading n vector words(n); for (int i = 0; i < n; ++i) { getline(cin, words[i]); } int lastOverlap = 0; for (int l = 1; l <= 100; ++l) { set prefixSet; bool overlapped = false; for (const string& w : words) { if (w.length() < l) continue; string prefix = w.substr(0, l); if (prefixSet.find(prefix) != prefixSet.end()) { overlapped = true; lastOverlap = l; break; } prefixSet.insert(prefix); } if (!overlapped) { break; } } map> prefixMap; for (int i = 0; i < n; ++i) { const string& w = words[i]; if (w.length() < lastOverlap) continue; string prefix = w.substr(0, lastOverlap); prefixMap[prefix].push_back(i); } vector> prefixListSorted; for (const auto& pair : prefixMap) { if (pair.second.size() >= 2) { prefixListSorted.push_back(pair.second); } } sort(prefixListSorted.begin(), prefixListSorted.end(), [](const vecto

코드 #1128