QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #745303 | #5103. Fair Division | beidiaodajht | AC ✓ | 428ms | 3956kb | C++20 | 3.0kb | 2024-11-14 09:03:32 | 2024-11-14 09:03:38 |
Judging History
answer
// // #include<bits/stdc++.h>
// // #define M 200005
// // #define mod 998244353
// // using namespace std;
// // int T,n,mn[M],ans[M];
// // vector<int> e[M];
// // int mi(int a,int b=mod-2){
// // int ans=1;
// // while(b){
// // if(b&1) ans=1ll*ans*a%mod;
// // b>>=1;a=1ll*a*a%mod;
// // }
// // return ans;
// // }
// // void pre(int u,int fa){
// // if(e[u].size()==1&&u!=1) mn[u]=0;
// // else mn[u]=1<<30;
// // for(int v:e[u]) if(v!=fa){
// // pre(v,u);
// // mn[u]=min(mn[u],mn[v]+1);
// // }
// // }
// // void dfs(int u,int fa){
// // for(int v:e[u]) if(v!=fa){
// // ans[v]=1ll*ans[u]*mn[v]%mod*mi(mn[v]+1)%mod;
// // dfs(v,u);
// // }
// // }
// // int main(){
// // scanf("%d",&T);
// // while(T--){
// // scanf("%d",&n);
// // for(int i=1,u,v;i<n;++i) scanf("%d%d",&u,&v),e[u].emplace_back(v),e[v].emplace_back(u);
// // pre(1,0);ans[1]=1;dfs(1,0);
// // for(int i=1;i<=n;++i) printf("%d ",ans[i]);printf("\n");
// // for(int i=1;i<=n;++i) ans[i]=mn[i]=0,e[i].clear();
// // }
// // return 0;
// // }
// // #include<bits/stdc++.h>
// // using namespace std;
// // int T,n,ans1;
// // set<int> al;
// // map<int,int> q;
// // void add(int a){
// // for(int i=2;i*i<=a;++i){
// // int nw=0;
// // if(a%i!=0) continue;
// // while(a%i==0) a/=i,nw++;
// // ans1/=q[i]+1;
// // q[i]=max(q[i],nw);
// // ans1*=q[i]+1;
// // ans1=min(ans1,n+1);
// // }
// // if(a!=1)
// // ans1/=q[a]+1,
// // q[a]=max(q[a],1),
// // ans1*=q[a]+1,
// // ans1=min(ans1,n+1);
// // }
// // int main(){
// // scanf("%d",&T);
// // while(T--){
// // scanf("%d%*d",&n);ans1=1;
// // for(int i=1,a;i<=n;++i){
// // scanf("%d",&a);
// // add(a);al.insert(a);
// // printf("%d",al.size()==ans1);
// // }
// // printf("\n");
// // al.clear();q.clear();
// // }
// // return 0;
// // }
// #include<bits/stdc++.h>
// using namespace std;
// int T,n,m,gu[15],cnt;
// bitset<1005> a[14];
// void add(int x){
// if(x==0){
// for(int i=0;i<cnt;++i) a[0]|=a[i],a[0]|=a[i]<<gu[i];
// gu[0]=0;cnt=1;return ;
// }
// ++cnt;gu[cnt-1]=x;
// for(int i=0;i<cnt-1;++i) a[cnt-1]|=a[i]<<gu[i],gu[i]*=x;
// }
// int main(){
// scanf("%d",&T);
// while(T--){
// scanf("%d%d",&n,&m);
// scanf("%d",&A);
// a[0][0]=1;gu[0]=A;cnt=1;n--;
// while(n--){
// scanf("%d",&A);
// add(A);
// }
// }
// return 0;
// }
#include<bits/stdc++.h>
using namespace std;
long long m,n;
long long mul(__int128_t a,__int128_t b){return min(a*b,(__int128_t)m+1);}
__int128_t mi(long long a,long long b){
__int128_t ans=1;
while(b){
if(b&1) ans*=a,ans=min(ans,(__int128_t)m+1);
a=min((__int128_t)a*a,(__int128_t)m+1);b>>=1;
}
return ans;
}
int main(){
scanf("%lld%lld",&n,&m);
for(int r=1;mi(r,n-1)<=m;++r){
for(int q=1;q<r;++q){
long long nw=0;
for(int i=0;i<n;++i) nw+=mul(mi(r,i),mi(q,n-i-1)),nw=min(nw,m+1);
if(m%nw==0){
printf("%d %d\n",r-q,r);return 0;
}
}
}
printf("impossible");
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3956kb
input:
13 382475111752106101
output:
17 28
result:
ok single line: '17 28'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
15 227368755046033249
output:
13 14
result:
ok single line: '13 14'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
27 72027091647987988
output:
1 4
result:
ok single line: '1 4'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
12 817283057828223168
output:
10 17
result:
ok single line: '10 17'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
40 279103330129289325
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
9 200754090585004509
output:
27 31
result:
ok single line: '27 31'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
13 145272043713167318
output:
11 19
result:
ok single line: '11 19'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
13 330339892079732537
output:
3 5
result:
ok single line: '3 5'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3840kb
input:
8 518312274023062851
output:
35 81
result:
ok single line: '35 81'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
8 226575677743060500
output:
3 37
result:
ok single line: '3 37'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
22 947676267664323372
output:
5 6
result:
ok single line: '5 6'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3904kb
input:
8 884152939068009488
output:
32 87
result:
ok single line: '32 87'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
10 334992255296783634
output:
1 2
result:
ok single line: '1 2'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3912kb
input:
9 387165762000719100
output:
9 26
result:
ok single line: '9 26'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
13 966426794141592430
output:
5 23
result:
ok single line: '5 23'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
30 3882204456
output:
impossible
result:
ok single line: 'impossible'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
17 388292937745500
output:
impossible
result:
ok single line: 'impossible'
Test #19:
score: 0
Accepted
time: 15ms
memory: 3696kb
input:
7 77777777777777777
output:
impossible
result:
ok single line: 'impossible'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
6 1
output:
impossible
result:
ok single line: 'impossible'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
6 6
output:
impossible
result:
ok single line: 'impossible'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
6 666666666
output:
impossible
result:
ok single line: 'impossible'
Test #23:
score: 0
Accepted
time: 423ms
memory: 3948kb
input:
6 982698952174251648
output:
3966 3967
result:
ok single line: '3966 3967'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
6 998905704529596381
output:
1 2
result:
ok single line: '1 2'
Test #25:
score: 0
Accepted
time: 426ms
memory: 3772kb
input:
6 1000000000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #26:
score: 0
Accepted
time: 30ms
memory: 3768kb
input:
7 983120539989861547
output:
996 997
result:
ok single line: '996 997'
Test #27:
score: 0
Accepted
time: 2ms
memory: 3828kb
input:
9 999999999999999998
output:
impossible
result:
ok single line: 'impossible'
Test #28:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
9 999999999999999999
output:
9 10
result:
ok single line: '9 10'
Test #29:
score: 0
Accepted
time: 2ms
memory: 3832kb
input:
9 1000000000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #30:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
10 983231815060933795
output:
75 97
result:
ok single line: '75 97'
Test #31:
score: 0
Accepted
time: 1ms
memory: 3908kb
input:
11 725231960190597311
output:
60 61
result:
ok single line: '60 61'
Test #32:
score: 0
Accepted
time: 0ms
memory: 3892kb
input:
12 897612484786617600
output:
1 2
result:
ok single line: '1 2'
Test #33:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
14 897612484786617600
output:
impossible
result:
ok single line: 'impossible'
Test #34:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #35:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
100 100000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #36:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
8888 888888888888888888
output:
impossible
result:
ok single line: 'impossible'
Test #37:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
1000000 1
output:
impossible
result:
ok single line: 'impossible'
Test #38:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
1000000 1000000000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #39:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
8 8170370
output:
1 7
result:
ok single line: '1 7'
Test #40:
score: 0
Accepted
time: 0ms
memory: 3912kb
input:
6 5386591
output:
1 16
result:
ok single line: '1 16'
Test #41:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
6 9874655
output:
1 18
result:
ok single line: '1 18'
Test #42:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
6 206896
output:
2 9
result:
ok single line: '2 9'
Test #43:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
7 7352101
output:
2 11
result:
ok single line: '2 11'
Test #44:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
6 6373472
output:
2 17
result:
ok single line: '2 17'
Test #45:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
6 1365
output:
3 4
result:
ok single line: '3 4'
Test #46:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
8 5462197
output:
3 8
result:
ok single line: '3 8'
Test #47:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
6 5757975
output:
3 14
result:
ok single line: '3 14'
Test #48:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
6 8913814
output:
4 19
result:
ok single line: '4 19'
Test #49:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
7 19531
output:
4 5
result:
ok single line: '4 5'
Test #50:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
7 7001653
output:
5 12
result:
ok single line: '5 12'
Test #51:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
6 9331
output:
5 6
result:
ok single line: '5 6'
Test #52:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
6 7036512
output:
6 19
result:
ok single line: '6 19'
Test #53:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
6 142753
output:
7 10
result:
ok single line: '7 10'
Test #54:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
6 8453313
output:
7 20
result:
ok single line: '7 20'
Test #55:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
6 8852298
output:
8 17
result:
ok single line: '8 17'
Test #56:
score: 0
Accepted
time: 0ms
memory: 3944kb
input:
6 1851063
output:
9 16
result:
ok single line: '9 16'
Test #57:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
6 8399456
output:
10 21
result:
ok single line: '10 21'
Test #58:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
6 7706011
output:
11 21
result:
ok single line: '11 21'
Test #59:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
6 402234
output:
12 13
result:
ok single line: '12 13'
Test #60:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
6 8680651
output:
13 22
result:
ok single line: '13 22'
Test #61:
score: 0
Accepted
time: 0ms
memory: 3920kb
input:
6 813616
output:
14 15
result:
ok single line: '14 15'
Test #62:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
6 9851583
output:
15 23
result:
ok single line: '15 23'
Test #63:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
6 9244890
output:
16 23
result:
ok single line: '16 23'
Test #64:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
6 8705249
output:
17 23
result:
ok single line: '17 23'
Test #65:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
6 8223348
output:
18 23
result:
ok single line: '18 23'
Test #66:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
6 5967325
output:
19 22
result:
ok single line: '19 22'
Test #67:
score: 0
Accepted
time: 1ms
memory: 3804kb
input:
6 7401758
output:
20 23
result:
ok single line: '20 23'
Test #68:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
6 7049325
output:
21 23
result:
ok single line: '21 23'
Test #69:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
6 8308825
output:
23 24
result:
ok single line: '23 24'
Test #70:
score: 0
Accepted
time: 428ms
memory: 3956kb
input:
6 999408045844421423
output:
3977 3980
result:
ok single line: '3977 3980'
Extra Test:
score: 0
Extra Test Passed