Submission #1540572
Source Code Expand
#include <bits/stdc++.h> using namespace std; using pii = pair<int,int>; using ll = long long; #define rep(i, j) for(int i=0; i < (int)(j); i++) #define repeat(i, j, k) for(int i = (j); i < (int)(k); i++) #define all(v) v.begin(),v.end() #define debug(x) cerr << #x << " : " << x << endl template<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; } template<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; } // vector template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; } template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; } // pair template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; } const int INF = 1 << 30; const ll INFL = 1LL << 60; class Solver { public: bool solve() { string A; cin >> A; ll N = A.size(); map<char, int> cnt; ll dec = 0; rep(i, N) { dec += cnt[A[i]]++; } ll ans = N * (N - 1) / 2; cout << ans - dec + 1 << endl; return 0; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); Solver s; s.solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | cormoran |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1393 Byte |
Status | AC |
Exec Time | 7 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 | 2 ms | 256 KB |
subtask_1_08.txt | AC | 7 ms | 720 KB |
subtask_1_09.txt | AC | 3 ms | 720 KB |
subtask_1_10.txt | AC | 4 ms | 720 KB |
subtask_1_11.txt | AC | 7 ms | 720 KB |
subtask_1_12.txt | AC | 3 ms | 720 KB |
subtask_1_13.txt | AC | 3 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 | 3 ms | 720 KB |
subtask_1_17.txt | AC | 3 ms | 720 KB |