Submission #6359164
Source Code Expand
#include<iostream> #include<iomanip> #include<cstdio> #include<string> #include<cstring> #include<climits> #include<algorithm> #include<vector> #include<cmath> #include<map> #include<set> #include<stack> #include<queue> #include<tuple> #include<list> #include<unordered_map> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define vii vector<int> #define vll vector<ll> #define lb lower_bound #define pb push_back #define mp make_pair #define rep(i,n) for(ll i=0;i<n;i++) #define rep2(i,a,b) for(ll i=a;i<b;i++) #define repr(i,n) for(ll i=n-1;i>=0;i--) #define all(x) x.begin(),x.end() #define INF (1 << 30) - 1 #define LLINF (1LL << 61) - 1 // #define int ll using namespace std; const int MOD = 1000000007; const int MAX = 510000; int main(){ cin.tie(0); ios::sync_with_stdio(false); string s; cin>>s; map<int,int> mp; ll n=s.size(); rep(i,n){ mp[s[i]-'a']++; } ll ans=n*(n-1)/2+1; for(auto i:mp){ if(i.second>1){ ans-=(i.second*(i.second-1)/2); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | t6is |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1147 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 720 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | 2 ms | 256 KB |
subtask_1_08.txt | AC | 6 ms | 720 KB |
subtask_1_09.txt | WA | 3 ms | 720 KB |
subtask_1_10.txt | WA | 4 ms | 720 KB |
subtask_1_11.txt | AC | 6 ms | 720 KB |
subtask_1_12.txt | WA | 3 ms | 720 KB |
subtask_1_13.txt | WA | 3 ms | 720 KB |
subtask_1_14.txt | WA | 2 ms | 720 KB |
subtask_1_15.txt | WA | 2 ms | 720 KB |
subtask_1_16.txt | WA | 3 ms | 720 KB |
subtask_1_17.txt | AC | 3 ms | 720 KB |