AtCoder Grand Contest 019

Submission #1540296

Source codeソースコード

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <algorithm>
#include <ctime>
#include <cassert>
#include <memory.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define ford(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define sz(c) int((c).size())
#define all(c) (c).begin(), (c).end()
#define mp(x, y) make_pair(x, y)
#define fst first
#define snd second

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvi = vector<vi>;

#define FILE_NAME ""

string s;

bool read() {
  if (!(cin >> s)) {
    return 0;
  }
  return 1;
}

void solve() {
  const int let = 26;
  vi cnt(let);
  forn (i, sz(s))
    cnt[s[i] - 'a']++;

  ll ans = 1;
  forn (i, let) forn (j, i)
    ans += (ll)cnt[i] * cnt[j];
  cout << ans << endl;
}

int main() {
#ifdef LOCAL
  freopen(FILE_NAME ".in", "r", stdin);
  freopen(FILE_NAME ".out", "w", stdout);
#endif

  ios_base::sync_with_stdio(false);

  while (read()) {
    solve();
  }

#ifdef LOCAL
  cerr << "Time: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
#endif
  return 0;
}

Submission

Task問題 B - Reverse and Compare
User nameユーザ名 Kaban5
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 500
Source lengthソースコード長 1264 Byte
File nameファイル名
Exec time実行時間 2 ms
Memory usageメモリ使用量 720 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_01.txt,sample_02.txt,sample_03.txt
All 500 / 500 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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