QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#391811 | #5117. Find Maximum | Hqwq | WA | 1ms | 3868kb | C++20 | 938b | 2024-04-16 20:08:45 | 2024-04-16 20:08:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long t,l,r;
long long qmi(long long a,long long p){
long long res=1;
while(p){
if (p&1) res*=a;
p>>=1;
a*=a;
}
return res;
}
int main(){
scanf("%lld",&t);
while(t--){
scanf("%lld %lld",&l,&r);
long long a=l,b=r;
long long x=1,y=1;
while(a/3){
a/=3;
x++;
}
while(b/3){
b/=3;
y++;
}
long long ans=0;
if (x!=y){
if (qmi(3,y)-1==r) ans=y*3;
else if (qmi(3,y)-qmi(3,y-1)-1<=r) ans=y*3-1;
else if (qmi(3,y)-qmi(3,y-1)-qmi(3,y-2)-1<=r) ans=y*3-2;
else ans=y*3-3;
}
else{
long long p=1,q,k=l,temp=l;
while(k<=r){
if (temp%3!=2){
k+=p;
temp+=p;
}
else{
temp/=3;
p*=3;
}
//cout<<k<<'\n';
}
k-=p;
//cout<<k<<'\n';
while(k){
ans+=k%3;
k/=3;
ans++;
//cout<<ans<<'\n';
}
}
printf("%lld\n",ans);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5
output:
3 3 4 5 3 4 5 4 5 5
result:
ok 10 numbers
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3800kb
input:
5050 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61...
output:
2 3 3 4 5 5 5 6 6 6 6 6 6 7 7 7 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 3 3 4 5 5 5 6 6 6 6 6 6 7 7 7 8 8 8 8 8 8 8...
result:
wrong answer 784th numbers differ - expected: '8', found: '7'