Submission #1612367
Source Code Expand
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii pair<ll,ll>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
if(Bufferhead==Buffertail){
int l=fread(buffer,1,BufferSize,stdin);
if(!l){Terminal=1;return 0;}
Buffertail=(Bufferhead=buffer)+l;
}
return *Bufferhead++;
}
template<class T>inline bool read(T &x){
x=0;char c=Getchar(),rev=0;
while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
if(c=='.'){
c=Getchar();double t=0.1;
while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
}
x=rev?-x:x;
return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
char c=Getchar();
while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
while(c>=33&&c<=126) (*x++)=c,c=Getchar();
*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
if(!x){putchar('0');putchar(c);return;}
if(x<0) putchar('-'),x=-x;
int m=0,a[20];
while(x) a[m++]=x%10,x/=10;
while(m--) putchar(a[m]+'0');
putchar(c);
}
//--------------------------------head---------------------------------------------
const int inf=0x3f3f3f3f;
const int N=100005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
int ans=1;
while(y){
if(y&1) ans=(ll)ans*x%mod;
x=(ll)x*x%mod;y>>=1;
}return ans;
}
int m,Q;
set<pii> a[200];
ll f[200];
inline int calc(ll X,ll Y,int k){
int ans=0;
for(auto j:a[k-1]){
ll x=j.FF,y=j.SS;
ch(ans,max(0ll,(y<=X)*((Y-x)/y-(x+y<f[k+2]))));
}
for(auto j:a[k])
if(j.FF<=X&&j.SS<=Y) ch(ans,1);
return ans;
}
int main(){
#ifdef rqgao2014
freopen("input.txt","r",stdin);
#endif
// a[1].insert(mp(1,1));
a[1].insert(mp(1,2));
a[1].insert(mp(1,3));
f[0]=f[1]=1;
for(int i=2;;i++){
f[i]=f[i-1]+f[i-2];
if(f[i]>1e18){m=i-2;break;}
}
for(int i=2;i<=m;i++){
// debug(i);
for(auto j:a[i-1]){
ll x=j.FF,y=j.SS;
// if(x==y) continue;
for(int k=1;;k++)
if(x+k*y<=f[i+2]) a[i].insert(mp(y,x+k*y)); else break;
}
}
for(int i=1;i<=m;i++){
vector<pii> del(0);
for(auto j:a[i])
if(j.SS>=f[i+2]) del.pb(j);
for(auto j:del) a[i].erase(j);
}
// for(auto j:a[3])dprintf("%d %d\n",j.FF,j.SS);
// return 0;
read(Q);
while(Q--){
ll X,Y;read(X,Y);
int k=1;
if(X>Y) swap(X,Y);
for(int i=1;i<=m;i++)
if(f[i]<=X&&f[i+1]<=Y) k=i;
if(k==1){
printf("1 %lld\n",X*Y%mod);
continue;
}
printf("%d %d\n",k,(calc(X,Y,k)+calc(Y,X,k))%mod);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Kenus the Ancient Greek |
User |
rqgao2014 |
Language |
C++14 (GCC 5.4.1) |
Score |
1700 |
Code Size |
3818 Byte |
Status |
AC |
Exec Time |
1254 ms |
Memory |
4352 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
1700 / 1700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
537 ms |
3456 KB |
02.txt |
AC |
535 ms |
3456 KB |
03.txt |
AC |
536 ms |
3456 KB |
04.txt |
AC |
535 ms |
3456 KB |
05.txt |
AC |
543 ms |
3456 KB |
06.txt |
AC |
534 ms |
3456 KB |
07.txt |
AC |
535 ms |
3456 KB |
08.txt |
AC |
536 ms |
3456 KB |
09.txt |
AC |
539 ms |
3456 KB |
10.txt |
AC |
537 ms |
3456 KB |
11.txt |
AC |
1251 ms |
2176 KB |
12.txt |
AC |
1254 ms |
2176 KB |
13.txt |
AC |
338 ms |
2176 KB |
14.txt |
AC |
338 ms |
2176 KB |
15.txt |
AC |
354 ms |
4352 KB |
16.txt |
AC |
355 ms |
4352 KB |
17.txt |
AC |
96 ms |
3968 KB |
18.txt |
AC |
96 ms |
3968 KB |
19.txt |
AC |
855 ms |
3840 KB |
20.txt |
AC |
849 ms |
3840 KB |
21.txt |
AC |
2 ms |
512 KB |
22.txt |
AC |
2 ms |
512 KB |
23.txt |
AC |
2 ms |
512 KB |
24.txt |
AC |
2 ms |
512 KB |
s1.txt |
AC |
2 ms |
512 KB |
s2.txt |
AC |
2 ms |
512 KB |