Conversation Log

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

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED