湖南多校对抗赛（2014.03.23）JAG Practice Contest 2013

     额。昨天把存档给覆盖掉了 = =!

     好吧，再小小的总结一下 -> 现场手抖，政神救场

1° 保持良好的思维习惯，熬夜不要太晚影响到第二天
2° 考虑每个细节，想好再Coding
3° 向政神学习代码熟练度
4° 保持好心态 Up ↑ 

A.

题意 ： 给定数列An，满足Ai | i 是奇数严格小于两侧，i 是偶数严格大于两侧，序列中某些位置是同一个未知数x，询问是否有单一解

思路 ： 维护答案的闭区间[ l，r ]，按位枚举，每一位可以得到一个限制条件，取答案的交集

              几个坑：1° 输入数据中有负数 2°连续俩x无解（严格）3°原序列不合法（无解）

Code：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
#define foru(i, a, b) for(int i=a; i<=b; i++)
#define N 1010
#define M 1000000000

int n, l, r;
int a[N], b[N];
char s[N];

int get(char s[N]){
    int k = 1;
    int tmp = 0;
    if (s[0] == '-') {
        k = -1;
        foru(i, 1, strlen(s)-1)
            tmp = tmp * 10 + (int)s[i] - 48;
    }
    else {
        foru(i, 0, strlen(s)-1)
            tmp = tmp * 10 + (int)s[i] - 48;
    }
    return tmp * k;
}

int main(){
    while (scanf("%d", &n) != EOF && n){

        memset(a, 0, sizeof(a));
        memset(b, 0 ,sizeof(b));

        foru(i, 1, n){
            scanf("%s", &s);
            if (s[0] == 'x') b[i] = 1;
                else a[i] = get(s);
        }

        int tmp = 1;
        foru(i, 2, n){
            if (b[i-1] && b[i]) tmp = 0;
            if (b[i-1] || b[i]) continue;
            if (i%2 == 0 && a[i] <= a[i-1]) tmp = 0;
            if (i%2 == 1 && a[i] >= a[i-1]) tmp = 0;
        }
        if (! tmp) {
            printf("none\n");
            continue;
        }

        l = -M-5; r = M+5; a[0] = r;
        if (n%2 == 0) a[n+1] = -M-5;
            else a[n+1] = M+5;
        foru(i, 1, n){
            if (! b[i]) continue;
            if (i%2 == 0) {
                tmp = max(a[i-1], a[i+1]);
                l = max(l, tmp+1);
                continue;
            }
            tmp = min(a[i-1], a[i+1]);
            r = min(r, tmp-1);
        }
        if (l > r) printf("none\n");
            else if (l < r) printf("ambiguous\n");
                else printf("%d\n", l);
    }

    return 0;
}

B.

题意 ： 给定长度不超过一百的位数相同的三个数A，B，C，某些位置上是?可取[ 0，9 ]，询问合法方案数。

思路 ： 从0到9枚举每个问号然后DP，用F[ i ]表示到第i位不进位的方案数，G[ i ]表示到第i位进位的情况

              那么一共有3种情况：

              1° A，B 都不是？ ，若C是？那么C可以确定，若不是则判断一下然后转移 

                         -> A[ i ] + B[ I ] == C[ I ]   F[ I ] += F[ I+1]

                         -> A[ i ] + B[ I ]  + 1 == C[ I ]   F[ I ] += G[ I+1]

                         -> A[ i ] + B[ I ] == C[ I ] + 10   G[ I ] += F[ I+1]

                         -> A[ i ] + B[ I ]  + 1 == C[ I ] + 10   G[ I ] += G[ I+1]

              2° A，B 中有一个 ？，枚举那一个 ?，再按1°中枚举

              3° A，B 都是？，枚举A，B，再按1°中枚举

              注意两个地方 1° 按低位从高位的顺序DP 2° 考虑没有前导0

Code:

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
#define foru(i, a, b) for(int i=a; i<=b; i++)
#define ford(i, a, b) for(int i=a; i>=b; i--)
#define N 110
#define M 1000000007
#define LL long long

int n;
int a[N], b[N], c[N];
char A[N], B[N], C[N];
LL f[N], g[N];
int tmp;

int main(){

    while (scanf("%s", &A) != EOF && A[0]!='0'){
        n = strlen(A);
        scanf("%s", &B);
        scanf("%s", &C);
        foru(i, 0, n-1){
            a[i+1] = A[i] == '?' ? -1 : (int)A[i] - 48;
            b[i+1] = B[i] == '?' ? -1 : (int)B[i] - 48;
            c[i+1] = C[i] == '?' ? -1 : (int)C[i] - 48;
        }

        memset(f, 0, sizeof(f));
        memset(g, 0, sizeof(g));
        f[n+1] = 1; g[n+1] = 0;
        ford(i, n, 1){
            int cas = (a[i] < 0) + (b[i] < 0);
            if (cas == 0){
                if (c[i] < 0) {
                    a[i] + b[i] < 10 ? f[i] = (f[i] + f[i+1])%M : g[i] = (g[i] + f[i+1])%M;
                    a[i] + b[i] + 1 < 10 ? f[i] = (f[i] + g[i+1])%M : g[i] = (g[i] + g[i+1])%M;
                    continue;
                }
                if (a[i] + b[i] == c[i]) f[i] = (f[i] + f[i+1])%M;
                if (a[i] + b[i] + 1 ==  c[i]) f[i] = (f[i] + g[i+1])%M;
                if (a[i] + b[i] == c[i] + 10) g[i] = (g[i] + f[i+1])%M;
                if (a[i] + b[i] + 1 ==  c[i] + 10) g[i] = (g[i] + g[i+1])%M;
                continue;
            }
            if (cas == 1){
                tmp = a[i] + b[i] + 1;
                foru(k, 0, 9){
                    if (i == 1 && !k) continue;
                    if (c[i] < 0) {
                        tmp + k  < 10 ? f[i] = (f[i] + f[i+1])%M : g[i] = (g[i] + f[i+1])%M;
                        tmp + k + 1 < 10 ? f[i] = (f[i] + g[i+1])%M : g[i] = (g[i] + g[i+1])%M;
                        continue;
                    }
                    if (tmp + k == c[i]) f[i] = (f[i] + f[i+1])%M;
                    if (tmp + k + 1 ==  c[i]) f[i] = (f[i] + g[i+1])%M;
                    if (tmp + k == c[i] + 10) g[i] = (g[i] + f[i+1])%M;
                    if (tmp + k + 1 ==  c[i] + 10) g[i] = (g[i] + g[i+1])%M;
                    continue;
                }
                continue;
            }
            foru(p, 0, 9)
                foru(q, 0, 9){
                    if (i == 1 && ! p) continue;
                    if (i == 1 && ! q) continue;
                    tmp = p + q;
                    if (c[i] < 0) {
                        tmp < 10 ? f[i] = (f[i] + f[i+1])%M : g[i] = (g[i] + f[i+1])%M;
                        tmp + 1 < 10 ? f[i] = (f[i] + g[i+1])%M : g[i] = (g[i] + g[i+1])%M;
                        continue;
                    }
                    if (tmp == c[i]) f[i] = (f[i] + f[i+1])%M;
                    if (tmp + 1 ==  c[i]) f[i] = (f[i] + g[i+1])%M;
                    if (tmp == c[i] + 10) g[i] = (g[i] + f[i+1])%M;
                    if (tmp + 1 ==  c[i] + 10) g[i] = (g[i] + g[i+1])%M;
                }
        }
        printf("%lld\n", f[1]);
    }

    return 0;
}