Submission #1540555
Source Code Expand
#include <algorithm> #include <cstring> #include <ctime> #include <iostream> #include <map> #include <set> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> using namespace std; #ifdef __APPLE__ #define eprintf(...) fprintf(stderr, __VA_ARGS__) #else #define eprintf(...) #endif const int N = (int)1e6 + 123; const int MOD = (int)1e9 + 7; const int inf = (int)5e8; const long long infll = (long long)1e17; map<int, vector<int>> indeces; void solve() { string s; cin >> s; int n = s.size(); for (int i = 0; i < n; ++i) { indeces[s[i]].push_back(i); } long long ans = n * 1ll * (n - 1) / 2; for (auto i : indeces) { int cnt = i.second.size(); ans -= cnt * 1ll * (cnt - 1) / 2; } printf("%lld\n", ans + 1); } int main() { #ifdef __APPLE__ freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int t = 1; while (t--) { solve(); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | NikitaMikhaylov |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1065 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 2172 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 9 ms | 2168 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 2 ms | 384 KB |
subtask_1_08.txt | AC | 14 ms | 1412 KB |
subtask_1_09.txt | AC | 11 ms | 1740 KB |
subtask_1_10.txt | AC | 11 ms | 1600 KB |
subtask_1_11.txt | AC | 13 ms | 1668 KB |
subtask_1_12.txt | AC | 11 ms | 1836 KB |
subtask_1_13.txt | AC | 10 ms | 1908 KB |
subtask_1_14.txt | AC | 9 ms | 2168 KB |
subtask_1_15.txt | AC | 10 ms | 1788 KB |
subtask_1_16.txt | AC | 10 ms | 2172 KB |
subtask_1_17.txt | AC | 10 ms | 1284 KB |