7-5 个人赛补题-Gym - 102263D D - Meeting Bahosain

最新推荐文章于 2024-07-27 21:23:43 发布

LiYunLongYYDS

最新推荐文章于 2024-07-27 21:23:43 发布

阅读量127

点赞数 1

文章标签： c++ 算法

本文链接：https://blog.csdn.net/CSDN_LiYunLong/article/details/125626164

版权

Gym - 102263D D - Meeting Bahosain

Essa wanted to meet the most powerful number theorist of all time: Bahosain, but Bahosain does not waste his precious time, so he gave Essa this puzzle in order to test his abilities.

Given two arrays, the second array only has distinct elements, Essa can do the following as many times as he wants to make all numbers in first array equal.

Choose a number from the first array
Add or subtract from it a number in the second array
Replace the number in the first array with the result

Of course, Essa is unworthy of meeting the almighty Bahosain, and he can't solve this puzzle on his own, so can you help him?

Input

The first line containing two space separated integers n,mn,m (1≤n,k≤ $10^{6}$ ) represent the length of the first and second array

the second line contains n integers represent the first array (1≤a[i]≤ ${10^{9}}$ )

the third line contains m integers represent the second array (1≤b[i]≤ ${10^{9}}$ )

Output

Print Yes, if it's possible to make all numbers in first array equal; and No in the opposite case.

题意：给你两个数组，让你判断能否让第一个数组（a数组）中的数通过加减第二个数组（b数组）的数，让第一个数组中的数全部相等。

（比赛的时候想法已经很接近了，但是没有去深究一下）

思路：这是一道思维题，首先当然要读懂题意，因为他们是通过第一个数组加减第二个数组去实现，“抹平”他们直间的差值，也就是a[i]-a[i-1] 可以用b数组来表示。就可以写成a[i]-a[i-1] = b[1]* $n_{1}$ +b[2]* $n_{2}$ +b[3]* $n_{3}$ +……+b[n-1]* $n_{n-1}$ +b[n]* $n_{n}$ ; 这样就可以转换为a[i]-a[i-1]%（b数组的最打公约数)==0，从而判断是否可以。

同样你也可以分别求一下两个数组的最大公约数，看第一个数组能否整除第二个数组。（特判n==1的情况）1e5以上输入卡cin和cout。

样例：

5 2
3 6 7 2 5
2 4

不多说了，上代码，自己悟。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <bitset>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e6+10;
const int mod=1e9+7;
typedef pair<char,char> PII;
int n,m;
string s;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll a[N],b[N];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    ll sum;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=m;i++){
        cin>>b[i];
        if(i==1) sum=b[i];
        else sum=gcd(sum,b[i]);
    }
    int f=0;
    for (int i=2;i<=n;i++) {
        if ((a[i]-a[i-1])%sum!=0){
            f=1;break;
        }
    }
    if (!f)
        printf("Yes\n");
    else
        printf("No\n");
    return 0;
}

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <bitset>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e6+10;
const int mod=1e9+7;
typedef pair<char,char> PII;
int n,m;
string s;
ll gcd(ll a,ll b){//最大公因数模板
    return b?gcd(b,a%b):a;
}
ll a[N],b[N];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    ll sum1,sum2;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(i==1) sum1=a[i];
        else sum1=gcd(sum1,a[i]);
    }
    for(int i=1;i<=m;i++){
        cin>>b[i];
        if(i==1) sum2=b[i];
        else sum2=gcd(sum2,b[i]);
    }
    if(sum1%sum2==0||n==1){
        printf("Yes\n");
    }else printf("No\n");
    //printf("%d\n%d\n",sum1,sum2);
    return 0;
}