Submission #1769967


Source Code Expand

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

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

string i2s(int a){
    stringstream ss;
    ss<<a;
    return ss.str();
}
string S;
int memo[22][2];

int dfs(int n,int f){
    if(n==S.size())return 1;
    int &ret=memo[n][f];

    ret=0;
    rep(i,10){
        if(!f&&i>S[n]-'0')continue;
        if(i==4||i==9)continue;
        ret+=dfs(n+1,f||(i<S[n]-'0'));
    }
    return ret;
}

signed main(){
    int a,b;
    cin>>a>>b;
    a--;

    memset(memo,-1,sizeof(memo));
    S=i2s(b);
    int ret=dfs(0,0);

    memset(memo,-1,sizeof(memo));
    S=i2s(a);
    ret-=dfs(0,0);

    cout<<b-a-ret<<endl;
}

Submission Info

Submission Time
Task D - 禁止された数字
User latte0119
Language C++14 (GCC 5.4.1)
Score 30
Code Size 1157 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
TLE × 1
AC × 16
AC × 16
TLE × 23
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.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_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.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, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 1 ms 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt AC 1 ms 256 KB
subtask0_sample04.txt TLE 2103 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask2_01.txt TLE 2103 ms 256 KB
subtask2_02.txt TLE 2103 ms 256 KB
subtask2_03.txt TLE 2103 ms 256 KB
subtask2_04.txt TLE 2103 ms 256 KB
subtask2_05.txt TLE 2103 ms 256 KB
subtask2_06.txt TLE 2103 ms 256 KB
subtask2_07.txt TLE 2103 ms 256 KB
subtask2_08.txt TLE 2103 ms 256 KB
subtask2_09.txt TLE 2103 ms 256 KB
subtask2_10.txt TLE 2103 ms 256 KB
subtask2_11.txt TLE 2103 ms 256 KB
subtask2_12.txt TLE 2103 ms 256 KB
subtask2_13.txt TLE 2103 ms 256 KB
subtask2_14.txt TLE 2103 ms 256 KB
subtask2_15.txt TLE 2103 ms 256 KB
subtask2_16.txt TLE 2103 ms 256 KB
subtask2_17.txt TLE 2103 ms 256 KB
subtask2_18.txt TLE 2103 ms 256 KB
subtask2_19.txt TLE 2103 ms 256 KB
subtask2_20.txt TLE 2103 ms 256 KB
subtask2_21.txt TLE 2103 ms 256 KB
subtask2_22.txt TLE 2103 ms 256 KB