QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#574111 | #2519. Number with Bachelors | cqbztzl | AC ✓ | 214ms | 111636kb | C++14 | 2.3kb | 2024-09-18 20:48:55 | 2024-09-18 20:48:55 |
Judging History
answer
//
#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
int T,tp,cnt,num[105];
ull dp[105][(1<<16)+5][2];
ull dfs(int x,bool lim,int now){
if(!x)return 1;
if(!lim&&dp[x][now][(tp==10)?0:1]!=-1)return dp[x][now][(tp==10)?0:1];
ull res=0;
for(int i=0;i<=(lim?num[x]:tp-1);i++){
if((now>>i)&1)continue;
if(now==0&&i==0)res+=dfs(x-1,lim&&i==num[x],now);
else res+=dfs(x-1,lim&&i==num[x],now|(1<<i));
}
if(!lim)dp[x][now][(tp==10)?0:1]=res;
return res;
}
ull Get(ull x){
cnt=0;
while(x)num[++cnt]=x%tp,x/=tp;
return dfs(cnt,1,0);
}
ull read(){
ull x=0;
char s[22];
scanf("%s",s+1);
int len=strlen(s+1);
for(int i=1;i<=len;i++) {
if(s[i]<='9'&&s[i]>='0')x=x*tp+s[i]-'0';
else x=x*tp+s[i]-'a'+10;
}
return x;
}
void print(ull x){
if(x==0){
printf("0\n");
return ;
}
if(tp==10)printf("%llu\n", x);
else{
vector<int>ans;
while(x){
ans.push_back(x%tp);
x/=tp;
}
for(int i=ans.size()-1;i>=0;i--){
if(ans[i]>=10)printf("%c",ans[i]-10+'a');
else printf("%c",ans[i]+'0');
}
printf("\n");
}
}
signed main()
{
memset(dp,-1,sizeof(dp));
scanf("%lld",&T);
while(T--){
char op[10];
scanf("%s",op);
if(op[0]=='d')tp=10;
else tp=16;
int fff;
scanf("%lld",&fff);
if(!fff){
ull a=read(),b=read();
ull ans=Get(b);
if(a>0)ans-=Get(a-1);
print(ans);
}
else{
ull x=read();
if(x<10){
printf("%llu\n",x-1);
continue;
}
ull l=0,r=0,ans=0;
r--;
if(Get(r)<x){
printf("-\n");
continue;
}
while(l<=r){
ull mid=(l+r)>>1;
if(Get(mid)>=x){
ans=mid;
r=mid-1;
}
else l=mid+1;
}
print(ans);
}
}
}
/*
6
d 0 10 20
h 0 10 1f
d 1 10
h 1 f
d 1 1000000000
h 1 ffffffffffffffff
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 44ms
memory: 111344kb
input:
6 d 0 10 20 h 0 10 1f d 1 10 h 1 f d 1 1000000000 h 1 ffffffffffffffff
output:
10 f 9 e - -
result:
ok 6 lines
Test #2:
score: 0
Accepted
time: 214ms
memory: 111636kb
input:
50000 h 1 147a d 0 25 71 d 1 3587 d 0 26922 51887 d 1 711 d 0 3 5 h 0 7bf2defab442a0b1 f299a4cf1d4d9bed d 0 6961 91018 d 1 4 d 1 876 h 1 12cc5d3370f99120 d 1 161315 h 0 25f 6959 d 0 467 516 d 1 298 h 1 70260cdc2da73281 h 1 928e17d65d764ca2 h 1 c8ec8a7b67605e51 d 1 91697 d 0 4941925161850941148 89850...
output:
1b36 43 6587 7710 953 3 8daab378500 26054 3 1356 - 946307 4681 40 387 - - - 491850 0 1 29 - 4605298 1 1 - 15b4 175f 9b944134000 124b7 6279 9 6257 - 39be22a900 5c636b59300 146ce 2a55 - 0 - 7 d 6 2041 - 1c94afe7300 0 5 9149 16540973 1389 125 0 - 3bc31189480 424 66800 7 - - 1e6 0 0 48b6 9 - 2b0 5019 14...
result:
ok 50000 lines