| Task: | Anagrams |
| Sender: | Naila |
| Submission time: | 2020-09-26 15:35:33 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.11 s | details |
| #2 | ACCEPTED | 0.65 s | details |
| #3 | ACCEPTED | 0.20 s | details |
| #4 | ACCEPTED | 0.57 s | details |
| #5 | ACCEPTED | 0.75 s | details |
| #6 | ACCEPTED | 0.75 s | details |
| #7 | ACCEPTED | 0.01 s | details |
| #8 | ACCEPTED | 0.01 s | details |
| #9 | ACCEPTED | 0.01 s | details |
Compiler report
input/code.cpp: In function 'void Anagrams(std::vector<std::__cxx11::basic_string<char> >, std::vector<std::__cxx11::basic_string<char> >, int)':
input/code.cpp:39:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < Count.size(); i++)
~~^~~~~~~~~~~~~~Code
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
void Anagrams(vector<string> v, vector<string>v1, int n)
{
int cnt = 0;
vector<string>s;
vector<int>Count;
unordered_map<string, vector<int>> map;
for (int i = 0; i < n; i++)
map[v1[i]].push_back(i);
for (auto itr : map)
{
if (itr.second.size() != 1)
{
for (int index : itr.second)
{
cnt++;
s.push_back(v[index]);
}
Count.push_back(cnt);
cnt = 0;
}
}
cout << Count.size() << endl;
int k = 0;
for (int i = 0; i < Count.size(); i++)
{
cout << Count[i] << endl;
for (int j = 0; j < Count[i]; j++)
{
cout << s[k] << endl;
k++;
}
}
}
int main()
{
long long n;
vector<string>v, v1;
string s;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> s;
v.push_back(s);
sort(s.begin(), s.end());
v1.push_back(s);
}
Anagrams(v,v1, n);
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 68760 aakkonen aakkosellinen aakkosellisesti aakkosellisuus ... |
| correct output |
|---|
| 3076 2 haaraantua raahaantua 2 ... |
| user output |
|---|
| 3076 2 yliset ylitse 2 ... Truncated |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 370099 a aa aaa aah ... |
| correct output |
|---|
| 30178 2 basiparachromatin marsipobranchiata 2 ... |
| user output |
|---|
| 30178 2 zoography zoogrpahy 2 ... Truncated |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 100000 cnhmuewgnum dxkmhzhetnmxadtcy hfjqwavsiguwpludsketibe xwxolrmvkz ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 400000 vlcsa eltwde wdcwwkubs tmuxbirj ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 400000 ebhfigdacjlk aecfdijlhkgb jfekhbidacgl cehajbidfklg ... |
| correct output |
|---|
| 1 400000 abcdeighjlfk abcdeiglhfjk abcdfkilejgh ... |
| user output |
|---|
| 1 400000 ebhfigdacjlk aecfdijlhkgb jfekhbidacgl ... Truncated |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 400000 cbaabghadefb hbbgfaeabdac abaedcbgfbha hcfadbbbeaag ... |
| correct output |
|---|
| 1 400000 aaabbbcfegdh aaabbbcfghed aaabbbdcgfhe ... |
| user output |
|---|
| 1 400000 cbaabghadefb hbbgfaeabdac abaedcbgfbha ... Truncated |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1 a |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 2 ab ba |
| correct output |
|---|
| 1 2 ab ba |
| user output |
|---|
| 1 2 ab ba |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 2 aa ab |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
