제출 #5224

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
5224	2014-02-18 07:46:40	ainta	생일수 II (GA4_birthday2)	C++98	100 / 100	128 ms	10656 KiB

birthday2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N_ 200010
long long po[N_ * 2], D1[N_], S[N_], po2[N_], D2[N_], Mod=19980305, Res, R1;
char p[N_];
void Do(long long Sum, int Len){
  Res = (Res + D2[Len] + Sum * Sum % Mod * (po2[Len] - 1) % Mod + (Sum * S[Len] * 2) % Mod - Sum * D1[Len] * (8 + 3) % Mod + Mod) % Mod;
}
void Gap(){
  int i, n = strlen(p);
  Res = 0;
  long long Sum = 0, tp;
  for (i = 1; i < n; i++){
    Res = (Res + D2[i] + D1[i] * D1[i+1] * 24) % Mod;
  }
  for (i = 0; i < n; i++){
    Sum = (Sum + po[n - i - 1] * 3) % Mod;
    if (p[i] == '3')continue;
    Do(Sum, n - i - 1);
    Res = (Res + Sum * 3 * D1[n - i - 1]) % Mod;
    tp = (Sum + po[n - i - 1] * 2) % Mod;
    Res = (Res + tp * 8 * D1[n - i - 1] + Sum * tp % Mod + D1[n - i - 1] * D1[n - i - 1] * 24) % Mod;
    Sum = tp;
    if (p[i] == '5')continue;
    Do(Sum, n - i - 1);
    Res = (Res + Sum * 3 * D1[n - i - 1]) % Mod;
    tp = (Sum + po[n - i - 1] * 3) % Mod;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 30 / 30