QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#751120 | #5117. Find Maximum | nahida_qaq | WA | 3ms | 3656kb | C++23 | 1.0kb | 2024-11-15 17:10:20 | 2024-11-15 17:10:21 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353,inf=1e18;
typedef pair<int,int> pi;
int ll[100],rr[100];
void solve()
{
int l,r;
cin>>l>>r;
int cnt=0;
while(l)
{
int x=l%3;
ll[cnt++]=x;
l/=3;
}
cnt=0;
while(r)
{
int x=r%3;
rr[cnt++]=x;
r/=3;
}
vector<int>q(cnt);
int res=0;
int ans=0;
int tmp=0;
for(int i=cnt-1;i>=0;i--)
{
if(rr[i]>ll[i]||tmp)
{
tmp=1;
q[i]=max(0ll,rr[i]-1);
int num=cnt;
while(q[num-1]==0&&num)num--;
ans=max(ans,2*i+res+q[i]+num);
}
res+=rr[i];
q[i]=rr[i];
}
cout<<max(cnt+res,ans)<<'\n';
}
signed main()
{
io;
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: 3556kb
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: 0
Accepted
time: 1ms
memory: 3656kb
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:
ok 5050 numbers
Test #3:
score: -100
Wrong Answer
time: 3ms
memory: 3480kb
input:
10000 2924776299390853 348932224550662831 638290869233943020 897334616745111026 210780034220004669 279345354637770906 20574264013277469 387573622060864735 39441497975868873 806211034038773415 19845198891021950 243636832211738144 298454268109304380 988142879006387197 613847475002049291 86666797163210...
output:
110 112 109 110 112 108 113 112 110 107 109 113 110 110 111 111 109 106 111 113 107 107 113 112 111 110 99 96 104 110 107 111 108 111 113 109 111 110 108 102 106 113 110 110 110 111 110 107 111 111 109 107 112 110 110 107 112 109 104 112 110 105 109 101 107 110 110 108 113 107 113 112 112 110 110 11...
result:
wrong answer 14th numbers differ - expected: '111', found: '110'