Submission #4542277
Source Code Expand
//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに(特に二分探索とか)
//コーナーケースを考えて(特に場合分けとか)
//不可解すぎるバグは配列外参照(配列の長さ)を検討
#include "bits/stdc++.h"
#define YES "YES"
#define Yes "Yes"
#define NO "NO"
#define No "No"
#define YESNO(x) OUT(three(x,YES,NO))
#define YesNo(x) OUT(three(x,Yes,No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b) for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b-1,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB emplace_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define int long long
#define zero 0LL
#define all ALL
#define pb PB
using namespace std;
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef long long LL;
typedef LL ll;
typedef double ld;
typedef LL ut;
const LL INF = 1LL << 60;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
int dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };
const int SIZE1 =2e6 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 22;
const int SIZE = SIZE1;
const LL p = 7 + 1e9;const long double EPS = 1e-7;
ut N, M, K, X, L, Y,H,W,Q,D;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
VI edges[SIZE];
LL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;
LL A[SIZE], B[SIZE],I[SIZE];
LL solve() {
string s;
cin >> s;
REP(i, s.size()) {
A[s[i]]++;
}
N = s.size();
answer = N * (N - 1) / 2;
EFOR(i, 'a', 'z') {
answer -= A[i] * (A[i] - 1) / 2;
}
cout << answer+1 << endl;
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
// cin >> N;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Reverse and Compare |
User |
reew2n |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2760 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
52756 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 |
18 ms |
52480 KB |
sample_02.txt |
AC |
18 ms |
52480 KB |
sample_03.txt |
AC |
18 ms |
52480 KB |
subtask_1_01.txt |
AC |
18 ms |
52480 KB |
subtask_1_02.txt |
AC |
19 ms |
52756 KB |
subtask_1_03.txt |
AC |
18 ms |
52480 KB |
subtask_1_04.txt |
AC |
18 ms |
52480 KB |
subtask_1_05.txt |
AC |
18 ms |
52480 KB |
subtask_1_06.txt |
AC |
18 ms |
52480 KB |
subtask_1_07.txt |
AC |
18 ms |
52480 KB |
subtask_1_08.txt |
AC |
19 ms |
52756 KB |
subtask_1_09.txt |
AC |
19 ms |
52756 KB |
subtask_1_10.txt |
AC |
19 ms |
52756 KB |
subtask_1_11.txt |
AC |
19 ms |
52756 KB |
subtask_1_12.txt |
AC |
19 ms |
52756 KB |
subtask_1_13.txt |
AC |
18 ms |
52756 KB |
subtask_1_14.txt |
AC |
19 ms |
52756 KB |
subtask_1_15.txt |
AC |
19 ms |
52756 KB |
subtask_1_16.txt |
AC |
19 ms |
52756 KB |
subtask_1_17.txt |
AC |
19 ms |
52756 KB |