Submission #1540583
Source Code Expand
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } //--------------------------------------------------------------------------------------------------- vector<int> manacher(string s) { // res[i] := 要素iを中心とする回文の半径((回文長+1)/2)を返す vector<int> R(s.length()); int i = 0, j = 0; while (i < s.size()) { while (i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j]) ++j; R[i] = j; int k = 1; while (i - k >= 0 && i + k < s.size() && k + R[i - k] < j) R[i + k] = R[i - k], ++k; i += k; j -= k; } return R; } /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ typedef long long ll; string A; //--------------------------------------------------------------------------------------------------- void _main() { cin >> A; int N = A.length(); vector<int> cnt(26); ll ans = 1; rrep(i, N - 1, 0) { rep(j, 0, 26) if (j != (A[i] - 'a')) ans += cnt[j]; cnt[A[i] - 'a']++; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | hamayanhamayan |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1786 Byte |
Status | AC |
Exec Time | 11 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 | 9 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 | 11 ms | 720 KB |
subtask_1_09.txt | AC | 10 ms | 720 KB |
subtask_1_10.txt | AC | 10 ms | 720 KB |
subtask_1_11.txt | AC | 11 ms | 720 KB |
subtask_1_12.txt | AC | 10 ms | 720 KB |
subtask_1_13.txt | AC | 10 ms | 720 KB |
subtask_1_14.txt | AC | 9 ms | 720 KB |
subtask_1_15.txt | AC | 9 ms | 720 KB |
subtask_1_16.txt | AC | 10 ms | 720 KB |
subtask_1_17.txt | AC | 9 ms | 720 KB |