Submission #38051293

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const double PI = acos(-1);



int main() {
    string s;
    cin >> s;
    ll id = 0;
    int n = s.size();
    for (ll i = 1; i < n; i++) {
        id += pow(26ll, i);
    }
    vector<ll> x(30);
    x[0] = 1;
    rep(i,12) {
        x[i+1] = x[i] * 26; 
    }
    rep(i,n) {
        ll y = s[i] - 'A';
        id += x[n - i - 1] * y;
    }
    cout << id + 1 << endl;
    return 0;
}

Submission Info

Submission Time
Task C - abc285_brutmhyhiizp
User taki0711
Language C++ (GCC 9.2.1)
Score 300
Code Size 807 Byte
Status AC
Exec Time 12 ms
Memory 4056 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 50
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt
Case Name Status Exec Time Memory
sample_01.txt AC 12 ms 3636 KiB
sample_02.txt AC 2 ms 3464 KiB
sample_03.txt AC 2 ms 3736 KiB
test_01.txt AC 2 ms 3380 KiB
test_02.txt AC 2 ms 3400 KiB
test_03.txt AC 3 ms 3468 KiB
test_04.txt AC 2 ms 3612 KiB
test_05.txt AC 3 ms 3484 KiB
test_06.txt AC 4 ms 3544 KiB
test_07.txt AC 2 ms 3728 KiB
test_08.txt AC 2 ms 3764 KiB
test_09.txt AC 2 ms 4040 KiB
test_10.txt AC 2 ms 3912 KiB
test_11.txt AC 4 ms 3736 KiB
test_12.txt AC 1 ms 3732 KiB
test_13.txt AC 3 ms 3804 KiB
test_14.txt AC 2 ms 3764 KiB
test_15.txt AC 2 ms 4036 KiB
test_16.txt AC 2 ms 3928 KiB
test_17.txt AC 2 ms 3860 KiB
test_18.txt AC 2 ms 3740 KiB
test_19.txt AC 2 ms 4040 KiB
test_20.txt AC 2 ms 3848 KiB
test_21.txt AC 2 ms 3800 KiB
test_22.txt AC 2 ms 4056 KiB
test_23.txt AC 2 ms 3852 KiB
test_24.txt AC 2 ms 3932 KiB
test_25.txt AC 2 ms 3724 KiB
test_26.txt AC 3 ms 3932 KiB
test_27.txt AC 2 ms 3768 KiB
test_28.txt AC 2 ms 3460 KiB
test_29.txt AC 2 ms 3648 KiB
test_30.txt AC 2 ms 3648 KiB
test_31.txt AC 2 ms 3972 KiB
test_32.txt AC 2 ms 3732 KiB
test_33.txt AC 2 ms 4040 KiB
test_34.txt AC 2 ms 3800 KiB
test_35.txt AC 3 ms 3828 KiB
test_36.txt AC 2 ms 4040 KiB
test_37.txt AC 3 ms 4040 KiB
test_38.txt AC 3 ms 3724 KiB
test_39.txt AC 2 ms 3908 KiB
test_40.txt AC 2 ms 3804 KiB
test_41.txt AC 2 ms 3904 KiB
test_42.txt AC 2 ms 3904 KiB
test_43.txt AC 2 ms 3888 KiB
test_44.txt AC 2 ms 3940 KiB
test_45.txt AC 2 ms 3912 KiB
test_46.txt AC 2 ms 3848 KiB
test_47.txt AC 2 ms 3848 KiB