QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#391975 | #5117. Find Maximum | wdw | WA | 1ms | 3956kb | C++20 | 1.1kb | 2024-04-16 23:26:36 | 2024-04-16 23:26:36 |
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: 100
Accepted
time: 0ms
memory: 3600kb
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: 3956kb
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 6 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 9 9 9 9 9 10 9 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 6 7 8 8 8 8 8 8 8 8 8 9...
result:
wrong answer 15th numbers differ - expected: '7', found: '6'