Conversation Log

#include <iostream>
#include <string>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;
int main(){
	int m;
	cin>>m;
	unordered_map<string,int> wrd;
	unordered_map<string,int> ucnt;
	unordered_map<string,unordered_set<string>> usr;
	while(m--){
		string line;
		string user;
		cin>>user;
		getline(cin,line);
		istringstream ss(line);
		string w;
		if(usr.count(user)==0)usr.insert({user,unordered_set<string>()});
		while(ss>>w){
			if(ucnt.count(w)==0)ucnt[w]=0;
			if(wrd.count(w)==0)wrd[w]=0;
			if(usr[user].count(w)==0)usr[user].insert(w),++ucnt[w];
			++wrd[w];
		}
	}
	int uc=usr.size();
	vector<pair<int,string>> cnts;
	for(auto& it:wrd){
		if(ucnt[it.first]<uc)continue;
		cnts.push_back({-it.second,it.first});
	}
	if(cnts.size()){
		sort(cnts.begin(),cnts.end());
		for(auto& it:cnts){
			cout<<it.second<<'\n';
		}
	}else cout<<"ALL CLEAR\n";
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED