QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#391976 | #5117. Find Maximum | wdw | WA | 0ms | 3676kb | C++20 | 1.1kb | 2024-04-16 23:27:18 | 2024-04-16 23:27:18 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
using ld = double;
using i64 = int64_t;
const int N = 3e5+5;
const ll mod = 998244353;
const ll inf = 1e18+5;
#define endl '\n'
vector<int>px;
vector<int>a(10000);
void solve()
{
int l,r;
cin>>l>>r;
vector<int>a(40),b(40);
int x=r;
int num1=0,num2=0;
int ans=0;
while(x){
a[++num1]=x%3;
ans+=x%3;
x/=3;
}
x=l;
ans+=num1;
while(x){
b[++num2]=x%3;
x/=3;
}
int tmp=0;
for(int i=num1;i>=1;i--){
if(a[i]>b[i]){
tmp+=(i-1)*2+a[i]-1;
break;
}else{
tmp+=a[i];
}
}
if(a[num1]==1&&b[num1]==0){
// num1--;
}
cout<<max(tmp+num1,ans)<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// cout<<fixed<<setprecision(12);
// srand(time(NULL));
int T=1;
cin >> T;
while(T--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3676kb
input:
10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5
output:
3 4 4 5 4 4 5 4 5 5
result:
wrong answer 2nd numbers differ - expected: '3', found: '4'