| Task: | Conversation Log |
| Sender: | Game of Nolife |
| Submission time: | 2015-11-25 17:32:01 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | details |
| #2 | ACCEPTED | 0.06 s | details |
| #3 | ACCEPTED | 0.06 s | details |
| #4 | ACCEPTED | 0.28 s | details |
| #5 | ACCEPTED | 0.20 s | details |
| #6 | ACCEPTED | 0.21 s | details |
| #7 | ACCEPTED | 0.05 s | details |
| #8 | ACCEPTED | 0.05 s | details |
| #9 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
map<string, int> t[10101];
map<string, int> id;
map<string, int> h;
map<string, int> c;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int m;
cin>>m;
string s;
getline(cin, s);
int i2=1;
for (int i=0;i<m;i++){
getline(cin, s);
vector<string> ss;
string tt;
for (int j=0;j<(int)s.size();j++){
if (s[j]==' '){
ss.push_back(tt);
tt="";
}
else{
tt+=s[j];
}
}
ss.push_back(tt);
int tid=0;
if (id[ss[0]]==0){
id[ss[0]]=i2++;
}
tid=id[ss[0]];
for (int j=1;j<(int)ss.size();j++){
t[tid][ss[j]]++;
}
}
for (int i=1;i<i2;i++){
for (auto a:t[i]){
h[a.F]++;
c[a.F]+=a.S;
}
}
vector<pair<int, string> > v;
for (auto a:h){
if (a.S==i2-1){
v.push_back({-c[a.F], a.F});
}
}
sort(v.begin(), v.end());
for (auto vv:v){
cout<<vv.S<<'\n';
}
if (v.size()==0){
cout<<"ALL CLEAR"<<endl;
}
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 4 user1 chomp chomp chomp chomp ... |
| correct output |
|---|
| chomp |
| user output |
|---|
| chomp |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 3 user1 doubledutch double doubl... |
| correct output |
|---|
| double doubledutch dutch |
| user output |
|---|
| double doubledutch dutch |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10000 jli double mthorpe tastic rjh pneumonoultramicroscopicsi... |
| correct output |
|---|
| pneumonoultramicroscopicsilico... |
| user output |
|---|
| pneumonoultramicroscopicsilico... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10000 dwsozemhmiupnsnisans s i u a y... |
| correct output |
|---|
| ALL CLEAR |
| user output |
|---|
| ALL CLEAR |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 100 ntgvyctezqvnefwcxhqj e o b r v... |
| correct output |
|---|
| k x g i l ... |
| user output |
|---|
| k x g i l ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 2 ukzoyurigzzhuxnssizv i m n r a... |
| correct output |
|---|
| m e f u n ... |
| user output |
|---|
| m e f u n ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 3 James gobble de gook Bill gobble james de gook |
| correct output |
|---|
| ALL CLEAR |
| user output |
|---|
| ALL CLEAR |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 5 user1 hello world user2 foo bar user3 baz quux user4 ear wig ... |
| correct output |
|---|
| ALL CLEAR |
| user output |
|---|
| ALL CLEAR |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 3 user1 jibble jibble tastic user2 tastic jibble jibble user3 jibble tastic jibble |
| correct output |
|---|
| jibble tastic |
| user output |
|---|
| jibble tastic |
