牛客多校第十场 Han Xin and His Troops（扩展中国剩余）

链接：https://ac.nowcoder.com/acm/contest/890/D
来源：牛客网

题目描述

His majesty chatted with Han Xin about the capabilities of the generals. Each had their shortcomings. His majesty asked, “How many troops could I lead?" Han Xin replied, Your highness should not lead more than 100000." His majesty said, ``And what about you? `For your humble servant, the more the merrier!" said Han Xin.

—Records of the Grand Historian

Han Xin was a military general who served Liu Bang during the Chu-Han contention and contributed greatly to the founding of the Han dynasty. Your friend, in a strange coincidence, also named Han Xin, is a military general as well.

One day you asked him how many troops he led. He was reluctant to tell you the exact number, but he told you some clues in certain form, for example:

if we count the troops by threes, we have two left over;
if we count by fives, we have three left over;
if we count by sevens, two are left over;
…
You wonder the number of his troops, or he was simply lying. More specifically, you would like to know the minimum possible number of troops he leads, and if the minimum number is too large, then you suspect he was lying.

输入描述:

The first line of input contains two integers n, m (1≤n≤100,1≤m≤1018)(1 \leq n \leq 100, 1 \leq m \leq 10^{18})(1≤n≤100,1≤m≤1018), the number of clues he told you and the threshold that you think he was probably lying.

The remaining part of the input are n lines, specifying the clues, Each line consists of two integers a, b (0≤b<a<105)(0 \leq b < a < 10^5)(0≤b<a<105), representing a clue that b troops are left over if we count them by a’s.

输出描述:

If there does not exist a non-negative number of troops satisfying all clues, print he was definitely lying\texttt{he was definitely lying}he was definitely lying; otherwise, if the minimum non-negative possible number of troops is greater than m, print he was probably lying\texttt{he was probably lying}he was probably lying; otherwise, print the minimum non-negative number.

示例1
输入

3 100
3 2
5 3
7 2

输出

示例2
输入

4 10000
12 7
15 2
30 5
8 6

输出

he was definitely lying

示例3
输入

2 10
11 3
19 7

输出

he was probably lying

思路：看起来像是excrt的模板题，但是它的范围很大，会爆long long，所以使用__int128，，，一个很玄学的东西，我fo了。

#include<bits/stdc++.h>
using namespace std;
#define ll __int128
ll n,m,a1,a2,m1,m2;
ll exgcd(ll a,ll b,ll &x,ll &y)
{if(!b){x=1;y=0;return a;}ll d=exgcd(b,a%b,y,x);y-=a/b*x;return d;
}
void print(__int128 x){if(x<0){putchar('-');x=-x;}if(x>9)print(x/10);putchar(x%10+'0');
}
int main()
{scanf("%lld%lld",&n,&m);scanf("%lld%lld",&a1,&m1);int flag=1;for(ll i=0;i<n-1;i++){scanf("%lld%lld",&a2,&m2);ll k1,k2,d,t;d=exgcd(a1,a2,k1,k2);if((m2-m1)%d){flag=0;break;}k1*=(m2-m1)/d;t=a2/d;k1=(k1%t+t)%t;m1=a1*k1+m1;a1=a1/d*a2;if(a1<0)a1=-a1;}ll ans=(m1%a1+a1)%a1;if(!flag)puts("he was definitely lying");else if(ans>m)puts("he was probably lying");else print(ans);
}

牛客多校第十场 Han Xin and His Troops（扩展中国剩余）相关推荐

牛客多校第十场F-Popping Balloons
题目连接牛客多校F-PoppingBalloons 题意: 用枪打气球,可以横着打三次,竖着打三次,横着打可以把那一行的气球全打下来,竖着打可以把那一列的气球全打下来,但是,每两次相邻的横着打或者竖 ...
【牛客多校第十场】Coffee Chicken
题目描述 Dr. JYY has just created the Coffee Chicken strings, denoted as S(n). They are quite similar to ...
2019牛客多校第十场 F.Popping Balloons
使用线段树,将(1,1+r,1+2r),(2,2+r,2+2r),(3,3+r,3+2r)以此类推,每个看成一个节点,对y进行建树,然后枚举x,维护最大值即可. 代码如下: #include<c ...
24dian(牛客多校第三场)
24dian(牛客多校第三场) 题意: 给你n张牌,每张牌的大小为1 ~ 13,问这些牌与加减乘除任意组合(可以使用括号),且但所有的有效解在计算过程中都涉及到分数,即非整数,能否组成答案m,如果可以 ...
2019牛客多校第四场 I题后缀自动机_后缀数组_求两个串de公共子串的种类数
目录求若干个串的公共子串个数相关变形题对一个串建后缀自动机,另一个串在上面跑同时计数广义后缀自动机后缀数组其他:POJ 3415 求两个串长度至少为k的公共子串数量 @(牛客多校第四场 I题 ...
2022牛客多校（十）
2022牛客多校(十) 一.比赛小结比赛链接:"蔚来杯"2022牛客暑期多校训练营10 二.题目分析及解法(基础题) F.Shannon Switching Game? 题目链接 ...
牛客多校第四场【B-Basic Gcd Problem】
牛客多校第四场[B-Basic Gcd Problem] 题目链接:https://ac.nowcoder.com/acm/contest/5669/B 思路:先要理解公式,多看几个数据基本就会有点想 ...
牛客多校第三场 B【Classical String Problem】
牛客多校第三场 B[Classical String Problem] 链接:https://ac.nowcoder.com/acm/contest/5668/B 来源:牛客网题目描述 Given ...
2019年牛客多校第1场赛后总结
A题 :Equivalent Prefixes 题意:就是给你两个有n个不同数的串,然后保证1-p区间内任选一个区间,使得区间中最小值的下标相同,找到最大的p值思路:我的思路是设置两个单调栈,然 ...

牛客多校第十场 Han Xin and His Troops（扩展中国剩余）

牛客多校第十场 Han Xin and His Troops（扩展中国剩余）相关推荐

最新文章

热门文章