Task: | Ruudukko |
Sender: | ph |
Submission time: | 2019-10-04 10:33:44 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | details |
#2 | WRONG ANSWER | 0.01 s | details |
#3 | WRONG ANSWER | 0.01 s | details |
#4 | WRONG ANSWER | 0.01 s | details |
#5 | WRONG ANSWER | 0.01 s | details |
#6 | WRONG ANSWER | 0.01 s | details |
Code
#include<bits/stdc++.h> using namespace std; int main() { long int n; cin >> n; string s; string* l = new string[n]; map<string, int> e; long int a = 0; for (int i = 0; i < n; i++) { cin >> l[i]; } for (int i = 0; i < n; i++) { map<char, string> s; int d = 1; string t = ""; for (string::size_type j = 0; j < l[i].size(); j++) { if (s.find(l[i][j]) == s.end()) { s.insert(pair<char, string>(l[i][j],to_string(d))); d++; } t += s.find(l[i][j])->second + " "; } if (e.find(t) == e.end()) { e.insert(pair<string, int>(t,1)); } else { auto it = e.find(t); a += it->second; it->second++; } } cout << a; }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
0 |
Test 2
Verdict: WRONG ANSWER
input |
---|
2 |
correct output |
---|
1 2 2 1 |
user output |
---|
1 |
Test 3
Verdict: WRONG ANSWER
input |
---|
5 |
correct output |
---|
1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
user output |
---|
10 |
Test 4
Verdict: WRONG ANSWER
input |
---|
42 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
861 |
Test 5
Verdict: WRONG ANSWER
input |
---|
99 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
4851 |
Test 6
Verdict: WRONG ANSWER
input |
---|
100 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
4950 |