Submission #1540659
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++) #define REP(i,n) FOR(i,0,n) #define ALL(a) a.begin(), a.end() #define MS(m,v) memset(m,v,sizeof(m)) typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<string> vs; typedef pair<int, int> pii; const int MOD = 1e9 + 7; template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); } template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); } template<class T> istream& operator >> (istream& is, vector<T>& v) { for (auto &i : v) is >> i; return is; } template<class T> ostream& operator<<(ostream& os, vector<T>& v) { const string delimiter = "\n"; REP(i, v.size()) { os << v[i]; if (i != v.size() - 1) os << delimiter; } return os; } /*--------------------template--------------------*/ int main() { cin.sync_with_stdio(false); cout << fixed << setprecision(10); string s; cin >> s; ll n = s.size(); vi cnt(26); for (auto c : s) cnt[c - 'a']++; ll ans = n * (n - 1) / 2 + 1; for (ll i : cnt) { if (i > 0) ans -= i * (i - 1) / 2; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | amano |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1192 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 720 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 | 2 ms | 720 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 | 1 ms | 256 KB |
subtask_1_08.txt | AC | 2 ms | 720 KB |
subtask_1_09.txt | AC | 2 ms | 720 KB |
subtask_1_10.txt | AC | 2 ms | 720 KB |
subtask_1_11.txt | AC | 2 ms | 720 KB |
subtask_1_12.txt | AC | 2 ms | 720 KB |
subtask_1_13.txt | AC | 2 ms | 720 KB |
subtask_1_14.txt | AC | 2 ms | 720 KB |
subtask_1_15.txt | AC | 2 ms | 720 KB |
subtask_1_16.txt | AC | 2 ms | 720 KB |
subtask_1_17.txt | AC | 2 ms | 720 KB |