「hdu6646」A + B = C【哈希】

A + B = C

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1192 Accepted Submission(s): 262 Special Judge

Problem Description

Hi everyone! Welcome to the Stage $7$ of this series of training contests. Cuber QQ is the problem settler of this contest; he has prepared $11$ problems for you and wishes you to enjoy it. Good luck!

As the first problem of this contest, Cuber QQ thought that it’s reasonable to start with an easy one, so he modified the famous $A+B$ problem by a little bit, so that it’s easy enough but not that trivial.

Given $a,b,c$ , find an arbitrary set of $x,y,z$ such that $a\times 10^x+b\times 10^y=c\times 10^z$ and $0\le x,y,z\le 10^6$.

Input

The input consists of multiple test cases, starting with an integer $t(1\le t\le 100)$, denoting the number of test cases.

For each test case, there are three space-separated integers, $a,b,c$ respectively $(1\le a,b,c\le 10^{100000})$.

Output

For each test case, please output three space-separated integers $x,y,z$. If there are multiple solutions, print any of them.

In case there are no solutions, please output $-1$ as a single line.

Sample Input

3
23 39 62
2 31 51
1 1 1

Sample Output

0 0 0
1 0 0
-1

Hint

HDOJ may give ambiguous feedback due to the compatibility issue of our checker. If you see “System Error”, please think of it as “Wrong Answer”.

Source

2019 Multi-University Training Contest 7

题意

• 就是给你三个长度为$10^5$的数$a,b,c$,让你求三个数$x,y,z$,且$0\le x,y,z\le 10^6$,使得 $a\times 10^x+b\times 10^y=c\times 10^z$

题解

• 首先根据常识可知，两个数$a,b$相加等于另外一个数$c$，记三个数长度分别为$le{n}_a,le{n}_b,le{n}_c$那么$le{n}_c$的长度要么是$max(le{n}_a,le{n}_b)$，要么是$max(le{n}_a,le{n}_b)+1$，所以考虑将$a$或者$b$高位与c高位或c第二高位处对其，然后去$check$ $a+b$可不可能等于$c$【因为枚举a对齐的时候b也可能需要左移使等式成立】所以就是枚举四种情况去$check$就行了
• 然后$c$最开始需要处理一下，使得他最够长，然后才能$c-a$是个正数，所以很容易想到使得c的长度变为$max(le{n}_c,max(le{n}_a,le{n}_b)+1)$，但是注意c的初始值也有可能是这种情况：$a+b$的值后面有很多$0$，去掉这些$0$得到$c$，比如说$a=1111,b=100,c=1112$这种情况下你不能仅仅在$c$后面加一个$0$，你需要加两个$0$，换句话说，假设$a,b$的后缀$0$的数量分别为$zer{o}_a,zer{o}_b$，$c$的长度应该初始化为$max(le{n}_c,max(le{n}_a-zer{o}_a,le{n}_b-zer{o}_b)+max(zer{o}_a,zer{o}_b)+1)$，如图所示。
  
• 然后检查$a+b$是否等于$c$可以使用哈希，就不需要用高精模拟啦，由于这题好像有点卡常，所以没用三哈希，用的双哈希，也有可能是我的哈希不够优秀

代码

#pragma GCC optimize(3)
#include<bits/stdc++.h>

using namespace std;
const int maxn=2e5+10;

struct Hash{
    int base[4],mod[4];
    int tot,hash[4][maxn],pw[4][maxn]; 
    Hash() {
        tot=0;
        for(int i=1;i<=3;i++) pw[i][0]=1;
        base[1]=10;base[2]=10;base[3]=10;
        mod[1]=1e9+7;mod[2]=998244353;mod[3]=1e9+9;
    }
    void init() {tot=0;}
    void insert(int c) {
        tot++;
        for(int i=1;i<=2;i++) hash[i][tot]=(1LL*hash[i][tot-1]*base[i]+c)%mod[i];
        for(int i=1;i<=2;i++) pw[i][tot]=(1LL*pw[i][tot-1]*base[i])%mod[i];
    }
    int query(int l,int r,int type) { 
        if(l==1) return hash[type][r];
        return (hash[type][r]-(1LL*hash[type][l-1]*pw[type][r-l+1]%mod[type])+mod[type])%mod[type];
    }

    friend bool check(Hash &a,int l1,int r1,Hash &b,int l2,int r2,Hash &c,int l3,int r3) {
        for(int i=1;i<=2;i++) if((a.query(l1,r1,i)+b.query(l2,r2,i))%a.mod[i]!=c.query(l3,r3,i)) return false;
        return true;
    }

}h[4];

char s[4][maxn];
int prel[4]; //记录字符串长度

int main()
{
    int t;scanf("%d",&t);
    for(int cas=1;cas<=t;cas++) {
        int suf=0,pre=0;
        for(int i=1;i<=3;i++) scanf("%s",s[i]+1),prel[i]=strlen(s[i]+1),h[i].init();
        for(int i=1;i<=2;i++) {
            int cnt=0;
            for(int j=prel[i];s[i][j]=='0';j--) cnt++;
            suf=max(suf,cnt); //0
            pre=max(pre,prel[i]-suf); //非0
        }
        int des=max(prel[3],pre+suf+1);  //初始化长度
        for(int i=1;i<=3;i++) for(int j=1;j<=des;j++) h[i].insert(j<=prel[i]?s[i][j]-'0':0);
        int x,y,z=des-prel[3];bool ok=false;
        for(int i=prel[2];i<=des;i++) { //将a与c对齐，枚举b的长度
            if(check(h[1],1,h[1].tot,h[2],1,i,h[3],1,h[3].tot)) { 
                x=des-prel[1],y=i-prel[2],ok=true;
                break;
            }
            if(check(h[1],1,h[1].tot-1,h[2],1,i,h[3],1,h[3].tot)) {
                x=des-prel[1]-1,y=i-prel[2],ok=true;
                break;
            }
        }
        if(ok) {printf("%d %d %d\n",x,y,z);continue;}
        for(int i=prel[1];i<=des;i++) {  //将b与c对齐，枚举a的长度
            if(check(h[1],1,i,h[2],1,h[2].tot,h[3],1,h[3].tot)) {
                x=i-prel[1],y=des-prel[2],ok=true;
                break;
            }
            if(check(h[1],1,i,h[2],1,h[2].tot-1,h[3],1,h[3].tot)) {
                x=i-prel[1],y=des-prel[2]-1,ok=true;
                break;
            }
        }
        if(ok) printf("%d %d %d\n",x,y,z);
        else printf("-1\n");
    }
}