Submission #322888


Source Code Expand

#include <bits/stdc++.h>//{{{{{{
using namespace std;
//TYPEDEFS //{{{
typedef long double ldouble;
typedef long long lint;
typedef unsigned long long ulint;
typedef vector<int> vint;
typedef vector<lint> vlint;
typedef vector<double> vdouble;
//}}}
//MACROS //{{{
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniquenize(v) (v).erase(unique(all(v)), (v).end())
#define perm(c) sort(all(c)); for(bool b = true; b; b = next_permutation(all(c)))
//}}}
//INPUTS //{{{
#define int(x) int x; scanf("%d",&x);
#define lint(x) long long x; scanf("%lld",&x);
#define vint(v,n) vector<int> v(n); rep(i,n) scanf("%d", &v[i]);
#define vlint(v,n) vector<lint> v(n); rep(i,n) scanf("%lld", &v[i]);
#define double(x) double x; scanf("%lf",&x);
#define vdouble(v,n) vector<double> v(n); rep(i,n) scanf("%lf", &v[i]);
#define string(x) string x; cin >> x;
//}}}
//OUTPUT //{{{
template<class T> ostream& operator<<(ostream &os, const vector<T> &v){os << "["; rep(i, v.size()) os << (i? "," : "") << v[i]; os << "]"; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t){ return os << "(" << t.first << "," << t.second << ")";}
//}}}
//UTILITY//{{{
template<class T> bool chmax(T &a, const T &b){return a<b && (a = b, 1);}
template<class T> bool chmin(T &a, const T &b){return a>b && (a = b, 1);}
//}}} }}}}}}

int main(){
    string s;
    cin >> s;
    int n = s.size();

    lint res = 0;
    string t;
    for(int i = 0; i < n; i++){
        if(s[i] == '2' && s[i+1] == '5'){
            t += '!';
            i++;
        } else {
            t += 'x';
        }
    }

    for(int i = 0, j; i < t.size(); i = j){
        for(j = i; j < t.size() && t[j] == '!'; j++);
        lint jj = j-i;
        res += (jj+1)*(jj)/2;
        if(t[j] != '!') j++;
    }
    cout << res << endl;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User eha
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1919 Byte
Status AC
Exec Time 31 ms
Memory 1188 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 18
AC × 30
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 24 ms 800 KB
subtask0_sample_02.txt AC 22 ms 804 KB
subtask0_sample_03.txt AC 23 ms 800 KB
subtask0_sample_04.txt AC 24 ms 804 KB
subtask0_sample_05.txt AC 24 ms 748 KB
subtask1_01.txt AC 24 ms 748 KB
subtask1_02.txt AC 24 ms 928 KB
subtask1_03.txt AC 23 ms 804 KB
subtask1_04.txt AC 24 ms 748 KB
subtask1_05.txt AC 24 ms 920 KB
subtask1_06.txt AC 25 ms 752 KB
subtask1_07.txt AC 24 ms 928 KB
subtask1_08.txt AC 23 ms 928 KB
subtask1_09.txt AC 24 ms 744 KB
subtask1_10.txt AC 23 ms 928 KB
subtask1_11.txt AC 24 ms 676 KB
subtask1_12.txt AC 22 ms 924 KB
subtask1_13.txt AC 24 ms 800 KB
subtask2_01.txt AC 31 ms 1056 KB
subtask2_02.txt AC 31 ms 1184 KB
subtask2_03.txt AC 31 ms 1188 KB
subtask2_04.txt AC 29 ms 1064 KB
subtask2_05.txt AC 30 ms 1124 KB
subtask2_06.txt AC 31 ms 1060 KB
subtask2_07.txt AC 30 ms 928 KB
subtask2_08.txt AC 30 ms 936 KB
subtask2_09.txt AC 24 ms 808 KB
subtask2_10.txt AC 24 ms 932 KB
subtask2_11.txt AC 24 ms 800 KB
subtask2_12.txt AC 24 ms 924 KB