Submission #1071529


Source Code Expand

#include "bits/stdc++.h"

#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=n-1;i>=m;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };

typedef long long ll;
using namespace std;

ll piyo(ll a) {
	if (a < 4) return a;
	else if (a == 4)return 4;
	else return a-1;
}

ll fuga(ll a) {
	if (a == 4 || a == 9) return 0;
	else return 1;
}
ll hoge(ll a) {
	if (a == 0) return -1;
	ll n = log10(a);
	ll dp[19][2];
	ll tmp = a;
	vector<ll> v(n + 1);
	RREP(i, n+1) {
		v[i] = tmp % 10;
		tmp /= 10;
	}
	dp[0][0] = fuga(v[0]);
	dp[0][1] = piyo(v[0]) ;
	REP(i, n) {
		dp[i + 1][0] = dp[i][0] * fuga(v[i+1]);
		dp[i + 1][1] = dp[i][0] * piyo(v[i+1]) + dp[i][1] * 8;
	}
	return a - dp[n][0] - dp[n][1];

}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll a, b;
	cin >> a >> b;
	cout << hoge(b) << " " << hoge(a - 1) << endl;
	return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User etonagisa
Language C++11 (GCC 4.8.1)
Score 0
Code Size 1155 Byte
Status WA
Exec Time 21 ms
Memory 1048 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 4
WA × 16
WA × 39
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 WA 18 ms 1044 KB
subtask0_sample02.txt WA 19 ms 1044 KB
subtask0_sample03.txt WA 21 ms 1044 KB
subtask0_sample04.txt WA 20 ms 1048 KB
subtask1_01.txt WA 19 ms 1044 KB
subtask1_02.txt WA 20 ms 924 KB
subtask1_03.txt WA 21 ms 968 KB
subtask1_04.txt WA 20 ms 1044 KB
subtask1_05.txt WA 19 ms 1048 KB
subtask1_06.txt WA 19 ms 1036 KB
subtask1_07.txt WA 20 ms 924 KB
subtask1_08.txt WA 18 ms 924 KB
subtask1_09.txt WA 21 ms 888 KB
subtask1_10.txt WA 20 ms 1048 KB
subtask1_11.txt WA 18 ms 920 KB
subtask1_12.txt WA 20 ms 924 KB
subtask1_13.txt WA 20 ms 908 KB
subtask2_01.txt WA 21 ms 860 KB
subtask2_02.txt WA 20 ms 924 KB
subtask2_03.txt WA 20 ms 924 KB
subtask2_04.txt WA 20 ms 1044 KB
subtask2_05.txt WA 20 ms 924 KB
subtask2_06.txt WA 18 ms 920 KB
subtask2_07.txt WA 18 ms 920 KB
subtask2_08.txt WA 20 ms 920 KB
subtask2_09.txt WA 20 ms 1044 KB
subtask2_10.txt WA 19 ms 1048 KB
subtask2_11.txt WA 20 ms 1048 KB
subtask2_12.txt WA 20 ms 1044 KB
subtask2_13.txt WA 20 ms 920 KB
subtask2_14.txt WA 19 ms 920 KB
subtask2_15.txt WA 20 ms 1044 KB
subtask2_16.txt WA 19 ms 916 KB
subtask2_17.txt WA 19 ms 924 KB
subtask2_18.txt WA 20 ms 924 KB
subtask2_19.txt WA 20 ms 924 KB
subtask2_20.txt WA 20 ms 1044 KB
subtask2_21.txt WA 20 ms 920 KB
subtask2_22.txt WA 20 ms 1044 KB