QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#65163	#5117. Find Maximum	JWChen^#	WA	4ms	3472kb	C++14	3.6kb	2022-11-27 21:25:17	2022-11-27 21:25:18

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-11-27 21:25:18]
评测

测评结果：WA
用时：4ms
内存：3472kb

查看

[2022-11-27 21:25:17]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int T;
ll l,r,a[101],b[101],sa,sb,ans;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld%lld",&l,&r);
        ll tmp;
        sa=0;
        sb=0;
        ans=0;
        tmp=l;
        while(tmp)
        {
            sa++;
            a[sa]=tmp%3;
            tmp/=3;
        }
        tmp=r;
        while(tmp)
        {
            sb++;
            b[sb]=tmp%3;
            tmp/=3;
        }
    //    printf("sa=%lld sb=%lld\n",sa,sb);
        if(sa==sb)//sa<=sb
        {
            ans=sa;
            ll wz=-1,tmpa;
            for(int i=sa;i>=1;--i)
                if(a[i]!=b[i])
                {
                    wz=i;
                    break;
                }
                else ans+=a[i];
            //l<=r a[wz]<b[wz]
            if(b[wz]==2) 
            {
                bool f=true;
                for(int i=wz;i>=1;--i)
                    if(b[i]!=2)
                    {
                        f=false;
                        break;
                    }
                if(f) tmpa=(wz-1)*2+2;
                else tmpa=(wz-1)*2+1;
            }
            else if(b[wz]==1)
            {
                bool f=true;
                for(int i=wz-1;i>=1;--i)
                    if(b[i]!=2)
                    {
                        f=false;
                        break;
                    }
                if(f) tmpa=(wz-1)*2+1;
                else tmpa=(wz-1)*2+0;
            }
            ans+=tmpa;
        }
        else if(sa<sb)
        {
            ll tmpa,tmpaa,wz;
            tmpa=0;
            tmpaa=sb;
            for(int i=sb;i>=1;i--)
                if(b[i]!=2)
                {
                    wz=i;
                    break;
                }
            if(wz!=sb) 
            {
                tmpaa+=wz*2+1+(sb-wz-1)*2;
            //    printf("wz=%lld tmpaa=%lld\n",wz,tmpaa);
            }
            else//最高位是1
            {
                tmpaa+=b[sb];
                wz=-1;
                for(int i=sb-1;i>=1;i--)
                    if(b[i]!=0)
                    {
                        wz=i;
                        break;
                    }
                if(wz!=-1)
                {
                    if(b[wz]==1)
                    {
                        bool f=true;
                        for(int i=wz-1;i>=1;--i)
                            if(b[i]!=2)
                            {
                                f=false;
                                break;
                            }
                        if(f) tmpaa+=1+2*(wz-1);
                        else tmpaa+=0+2*(wz-1);
                    }
                    else if(b[wz]==2)
                    {
                        bool f=true;
                        for(int i=wz-1;i>=1;--i)
                            if(b[i]!=2)
                            {
                                f=false;
                                break;
                            }
                        if(f) tmpaa+=2+2*(wz-1);
                        else tmpaa+=1+2*(wz-1);
                    }
                } 
            }
            tmpa=max(tmpa,tmpaa);
            tmpaa=sa+sa*2;
        //    printf("tmpaa=%lld\n",tmpaa);
            tmpa=max(tmpa,tmpaa);
            if(sa<sb-1)
            {
                tmpaa=sb-1+2*(sb-1);    
                tmpa=max(tmpa,tmpaa);
            }
            ans=tmpa;
        }
        printf("%lld\n",ans);
    }
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 3ms

memory: 3452kb

input:

output:

result:

ok 10 numbers

Test #2:

score: -100

Wrong Answer

time: 4ms

memory: 3472kb

input:

output:

93988576029759
3
3
4
5
5
5
5
6
6
6
6
6
7
7
7
8
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
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
11
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
5
3
4
5
5
5
5
6
6
6
6
6
7
7
7
...

result:

wrong answer 1st numbers differ - expected: '2', found: '93988576029759'