QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#574052	#9313. Make Max	crush_jzh	WA	24ms	11252kb	C++14	2.5kb	2024-09-18 20:40:08	2024-09-18 20:40:09

Judging History

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

[2024-09-18 20:40:09]
评测

测评结果：WA
用时：24ms
内存：11252kb

查看

[2024-09-18 20:40:08]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define  int long long
const int N=2e5+9;
struct node{
    int num,times;
};
node arr[N];
int head[N];
int tail[N];
int sum[N];
signed main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n,ans=0;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>arr[i].num;
            arr[i].times=1;
            tail[i]=i+1;
            head[i]=i-1;
        }
        head[1]=-1;
        tail[n]=-1;
        int x=2;
        while(x!=-1&&x>0)
        {
            if(x==1)
            {
                x=tail[x];
                continue;
            }
            if(tail[x]==-1)
            {
                if(arr[head[x]].num>arr[x].num)
                {
                    arr[head[x]].times+=arr[x].times;
                    ans+=arr[x].times;
                    tail[head[x]]=-1;
                    x=head[x];
                    continue;
                }
                if(arr[head[x]].num==arr[x].num)
                {
                    arr[head[x]].times+=arr[x].times;
                    tail[head[x]]=-1;
                    x=head[x];
                    continue;
                }
            }
            if(arr[head[x]].num==arr[x].num)
            {
                arr[head[x]].times+=arr[x].times;
                tail[head[x]]=tail[x];
                head[tail[x]]=head[x];
                x=head[x];
            }
            if(arr[head[x]].num>arr[x].num&&arr[tail[x]].num>arr[x].num)
            {
                if(arr[head[x]].num>arr[tail[x]].num)
                {
                    arr[tail[x]].times+=arr[x].times;
                    ans+=arr[x].times;
                    head[tail[x]]=head[x];
                    tail[head[x]]=tail[x];
                    x=head[x];
                }
                else if(arr[head[x]].num<arr[tail[x]].num)
                {
                    arr[head[x]].times+=arr[x].times;
                    ans+=arr[x].times;
                    head[tail[x]]=head[x];
                    tail[head[x]]=tail[x];
                    x=head[x];
                }
            }
            x=tail[x];
        }
        x=1;
        while(tail[x]!=-1)
        {
            arr[x].times+=arr[head[x]].times;
            ans+=arr[x].times;
            x=tail[x];
        }
        cout<<ans<<'\n';
    }
    //system("pause");
    return 0 ;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 7768kb

input:

4
2
1 2
2
2 2
7
1 1 1 2 2 2 2
3
1 2 3

output:

result:

ok 4 number(s): "1 0 3 3"

Test #2:

score: -100

Wrong Answer

time: 24ms

memory: 11252kb

input:

2
198018
875421126 585870339 471894633 383529988 625397685 944061047 704695631 105113224 459022561 760848605 980735314 847376362 980571959 329939331 644635272 326439858 752879510 837384394 175179068 182094523 397239381 1199016 185143405 279638454 252374970 822030887 860312140 137248166 993229443 164...

output:

11014440020
10239827814

result:

wrong answer 1st numbers differ - expected: '4084978', found: '11014440020'