Submission #3559950
Source Code Expand
#if 0
cat <<EOF >mistaken-paste
#endif
// thanks for @rsk0315_h4x
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>
#define BIG 2000000007
#define VERYBIG 2000000000000007LL
#define MOD 1000000007
#define FOD 998244353
typedef uint64_t ull;
typedef int64_t sll;
#define N_MAX 1000000
#ifdef __cplusplus
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <functional>
#include <array>
using std::queue;
using std::priority_queue;
using std::stack;
using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
template <typename T, typename U>
pair<T, U> operator+(pair<T, U> l, pair<T, U> r) {
return pair<T, U>(l.first + r.first, l.second + r.second);
}
#endif
typedef struct {
int32_t a;
int32_t b;
} hw;
typedef struct {
sll a;
sll b;
} hwll;
typedef struct {
sll a;
sll b;
sll c;
} hwllc;
typedef struct {
hwll a;
hwll b;
} linell;
ull n, m;
ull h, w;
ull k;
ull q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;
ull umin (ull x, ull y) {
return (x < y) ? x : y;
}
ull umax (ull x, ull y) {
return (x > y) ? x : y;
}
sll smin (sll x, sll y) {
return (x < y) ? x : y;
}
sll smax (sll x, sll y) {
return (x > y) ? x : y;
}
ull gcd (ull x, ull y) {
if (x < y) {
return gcd(y, x);
} else if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
ull bitpow (ull a, ull x, ull modulo) {
ull result = 1;
while (x) {
if (x & 1) {
result *= a;
result %= modulo;
}
x /= 2;
a = (a * a) % modulo;
}
return result;
}
ull divide (ull a, ull b, ull modulo) {
return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}
ull udiff (ull a, ull b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
sll sdiff (sll a, sll b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
int bitcount (ull n) {
int result = 0;
while (n) {
if (n & 1) result++;
n /= 2;
}
return result;
}
#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)
#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right
#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1
// int32_t pullcomp (const void *left, const void *right) {
// ull l = *(ull*)left;
// ull r = *(ull*)right;
// if (l < r) {
// return -1;
// }
// if (l > r) {
// return +1;
// }
// return 0;
// }
BEGCMP(pullcomp){
DEFLR(ull);
CMPRET(l, r);
return 0;
}
BEGCMP(prevcomp){
DEFLR(ull);
CMPRET(r, l);
return 0;
}
BEGCMP(psllcomp){
DEFLR(sll);
CMPRET(l, r);
return 0;
}
BEGCMP(pcharcomp){
DEFLR(char);
CMPRET(l, r);
return 0;
}
BEGCMP(pdoublecomp){
DEFLR(double);
CMPRET(l, r);
return 0;
}
int32_t pstrcomp (const void *left, const void *right) {
char* l = *(char**)left;
char* r = *(char**)right;
return strcmp(l, r);
}
BEGCMP(phwllABcomp){
DEFLR(hwll);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
return 0;
}
BEGCMP(phwllREVcomp){
DEFLR(hwll);
CMPRET(l.b, r.b);
CMPRET(l.a, r.a);
return 0;
}
BEGCMP(ptriplecomp){
DEFLR(hwllc);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
CMPRET(l.c, r.c);
return 0;
}
BEGCMP(ptripleREVcomp){
DEFLR(hwllc);
CMPRET(l.b, r.b);
CMPRET(l.a, r.a);
CMPRET(l.c, r.c);
return 0;
}
int32_t pquadcomp (const void *left, const void *right) {
linell l = *(linell*)left;
linell r = *(linell*)right;
sll ac = phwllABcomp(&(l.a), &(r.a));
if (ac) return ac;
sll bc = phwllABcomp(&(l.b), &(r.b));
if (bc) return bc;
return 0;
}
bool isinrange (sll left, sll x, sll right) {
return (left <= x && x <= right);
}
bool isinrange_soft (sll left, sll x, sll right) {
return (left <= x && x <= right) || (left >= x && x >= right);
}
sll a[N_MAX + 5];
// ull a[N_MAX];
// sll a[3001][3001];
sll b[N_MAX + 5];
// sll b[3001][3001];
sll c[N_MAX + 5];
sll d[N_MAX + 5];
// sll e[N_MAX];
char s[N_MAX + 1];
// char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
hwll xy[N_MAX];
hwllc tup[N_MAX];
sll table[3000][3000];
// here we go
ull dp[260][260][260];
ull dsum[260][260][2];
ull solve () {
sll i, j, ki, li;
// ull result = 0;
sll result = 0;
double dresult = 0;
// ull maybe = 0;
sll maybe = 0;
// ull sum = 0;
sll sum = 0;
sll item;
ull *dpcell;
dp[0][k][0] = 1;
result = 1;
for (i = 0; i < n; i++) {
if (s[i] == '?') {
result = (result * 10) % MOD;
}
for (j = 1; j <= k; j++) {
ull even = 0, odd = 0;
for (ki = 0; ki <= i; ki++) {
if (ki % 2) {
odd = (odd + dp[i][j][ki]) % MOD;
} else {
even = (even + dp[i][j][ki]) % MOD;
}
}
ull cnleven = ((s[i] == '2') ? 0 : ((s[i] == '?') ? 9 : 1));
dp[i + 1][j][0] = (dp[i + 1][j][0] + even * cnleven % MOD) % MOD;
ull cnlodd = ((s[i] == '2' || s[i] == '5') ? 0 : (s[i] == '?' ? 8 : 1));
dp[i + 1][j][0] = (dp[i + 1][j][0] + odd * cnlodd % MOD) % MOD;
for (ki = 0; ki <= i; ki++) {
// printf("%llu:%llu:%llu: %llu\n", i, j, ki, dp[i][j][ki]);
if (ki % 2 == 0) {
if (s[i] == '2' || s[i] == '?') {
dpcell = &dp[i + 1][j][ki + 1];
*dpcell = (*dpcell + (ki == 0 ? odd + dp[i][j][ki] : dp[i][j][ki])) % MOD;
}
} else {
ull x = (ki + 1) / 2;
if (j > x && (s[i] == '5' || s[i] == '?')) {
dpcell = &dp[i + 1][j - x][ki + 1];
*dpcell = (*dpcell + dp[i][j][ki]) % MOD;
}
}
}
}
}
for (j = 1; j <= k; j++) {
for (ki = 0; ki <= n; ki++) {
result = (MOD + result - dp[n][j][ki]) % MOD;
}
}
printf("%lld\n", result);
// printf("%.15lf\n", dresult);
// puts(s);
return 0;
success:
// puts("YES");
// puts("Yes");
printf("%llu\n", result);
// puts("0");
// puts("Yay!");
return 0;
fail:
// puts("NO");
// puts("No");
puts("0");
// puts("-1");
// puts("-1 -1 -1");
// puts("Impossible");
return 1;
}
int32_t main (void) {
int32_t i, j;
int32_t x, y;
// scanf("%llu%llu", &h, &w);
scanf("%llu", &n, &m);
scanf("%llu", &k, &n, &m);
// scanf("%llu%llu", &h, &w);
// scanf("%llu", &q);
scanf("%s", s);
// scanf("%lld%lld", &va, &vb, &vc, &vd);
// scanf("%llu%llu", &ua, &ub, &uc, &ud);
// scanf("%s", t);
// for (i = 0; i < n; i++) {
// // scanf("%lld%lld", &xy[i].a, &xy[i].b);
// // scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
// scanf("%lld", &a[i]);
// // scanf("%lld", &b[i]);
// // scanf("%lld", &c[i]);
// // scanf("%lld", &d[i]);
// a[i]--;
// // b[i]--;
// // c[i]--;
// // d[i]--;
// // tup[i].a--;
// // tup[i].b--;
// }
// scanf("%llu", &m, &k);
// scanf("%llu", &q);
// scanf("%s", s);
// for (i = 0; i < n; i++) {
// scanf("%lld", &b[i]);
// // b[i]--;
// }
// scanf("%llu", &q);
// for (i = 0; i < h; i++) {
// for (j = 0; j < w; j++) {
// scanf("%llu", &table[i][j]);
// }
// }
// for (i = 0; i < h; i++) {
// scanf("%s", &s[i]);
// }
solve();
return 0;
}
Submission Info
Submission Time
2018-11-07 22:42:09+0900
Task
A - ニコニコ文字列2
User
sheyasutaka
Language
C (GCC 5.4.1)
Score
20
Code Size
7452 Byte
Status
AC
Exec Time
66 ms
Memory
139392 KB
Compile Error
./Main.c: In function ‘solve’:
./Main.c:327:9: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘sll {aka long int}’ [-Wformat=]
printf("%lld\n", result);
^
./Main.c:336:9: warning: format ‘%llu’ expects argument of type ‘long long unsigned int’, but argument 2 has type ‘sll {aka long int}’ [-Wformat=]
printf("%llu\n", result);
^
./Main.c: In function ‘main’:
./Main.c:358:8: warning: format ‘%llu’ expects argument of type ‘long long unsigned int *’, but argument 2 has type ‘ull * {aka long unsigned int *}’ [-Wformat=]
scanf("%llu", &n, &m);
^
./Main.c:358:8: warning: too many arguments for format [-Wformat-extra-args]
./Main.c:359:8: warning: format ‘%llu’ expects argument of type ‘long long unsigned int *’, but argument 2 has type ‘ull * {aka long unsigned int *}’ [-Wformat=]
scanf("%llu", &k, &n, &m);
^
./Main.c:359:8: warning: too many arguments for format [-Wformat-extra-args]
./Main.c:358:2: warning: ignoring return val...
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
20 / 20
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
sample_01.txt, sample_02.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, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
2 ms
6272 KB
sample_02.txt
AC
3 ms
14464 KB
subtask1_01.txt
AC
2 ms
6272 KB
subtask1_02.txt
AC
2 ms
6272 KB
subtask1_03.txt
AC
2 ms
6272 KB
subtask1_04.txt
AC
2 ms
6272 KB
subtask1_05.txt
AC
20 ms
100480 KB
subtask1_06.txt
AC
19 ms
80000 KB
subtask1_07.txt
AC
16 ms
73856 KB
subtask1_08.txt
AC
11 ms
39040 KB
subtask1_09.txt
AC
9 ms
39040 KB
subtask1_10.txt
AC
6 ms
24704 KB
subtask1_11.txt
AC
29 ms
139392 KB
subtask1_12.txt
AC
61 ms
139392 KB
subtask1_13.txt
AC
29 ms
139392 KB
subtask1_14.txt
AC
63 ms
139392 KB
subtask1_15.txt
AC
62 ms
139392 KB
subtask1_16.txt
AC
62 ms
139392 KB
subtask1_17.txt
AC
66 ms
139392 KB
subtask1_18.txt
AC
59 ms
139392 KB
subtask1_19.txt
AC
66 ms
139392 KB
subtask1_20.txt
AC
63 ms
139392 KB
subtask1_21.txt
AC
2 ms
6272 KB
subtask1_22.txt
AC
2 ms
6272 KB