Submission #2927481

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair



vector<pair<int, int>> rle(string& s) {
    vector<pair<int, int>> work;
    char last = -1;
    int count = 0;
    for (char c : s) {
        if (c == last) {
            ++count;
        } else {
            if (count > 0) {
                work.push_back(make_pair(last, count));
            }
            last = c; count = 1;
        }
    }
    if (count > 0) {
        work.push_back(make_pair(last, count));
    }
    return work;
}

inline ll T(ll x) {
    return x*(x+1)/2;
}

ll solve(int N, string& s) {
    vector<ii> r = rle(s);
    if (r.size() == 1) {
        if (r[0].first == 'A') {
            ll w = r[0].second;
            return T(w * N);
        } else {
            return 0LL;
        }
    }

    vector<int> b;
    for (ii p: r) {
        if (p.first == 'A') b.pb(p.second);
    }
    if (r.back().first == 'B') b.pb(0);
    if (r[0].first == 'B') b.insert(b.begin(), 0);


    vector<int> b2 = b;
    b2[0] += b.back();

    int L = b.size();

    ll C1=0, C2=0, C3=0;
    rep(i, L-1) {
        C1 += T(b[i]);
        C2 += T(b2[i]);
    }
    C3 = C2 + T(b2.back());

    // printf("%lld %lld %lld\n", C1,C2,C3);
    ll total = C1;
    if (N == 1) {
        total += T(b.back());
    } else {
        total += C2*(N-2) + C3;
    }
    return total;
}

int main() {
    int N; cin >> N;
    string S; cin >> S;
    cout << solve(N,S) << endl;
    return 0;
}

Submission Info

Submission Time
Task A - ファイティング・タカハシ
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2681 Byte
Status
Exec Time 5 ms
Memory 1020 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 5 ms 1020 KB
02.txt 5 ms 1020 KB
03.txt 5 ms 768 KB
04.txt 4 ms 512 KB
05.txt 4 ms 512 KB
06.txt 4 ms 512 KB
07.txt 4 ms 512 KB
08.txt 4 ms 512 KB
09.txt 4 ms 512 KB
10.txt 4 ms 512 KB
11.txt 4 ms 512 KB
12.txt 4 ms 512 KB
13.txt 4 ms 512 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 1 ms 256 KB
17.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB