QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#34490#4239. MSTyzhangWA 33ms3748kbC++171.0kb2022-06-10 08:24:492022-06-10 08:24:52

Judging History

This is the latest submission verdict.

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-06-10 08:24:52]
  • Judged
  • Verdict: WA
  • Time: 33ms
  • Memory: 3748kb
  • [2022-06-10 08:24:49]
  • Submitted

answer

//μ's forever
#include <bits/stdc++.h>
#define N 300005
#define ll long long
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int T,n,a[N];
ll ans=0;
int main()
{
    T=read();
    while(T--){
        n=read();
        for(int i=1;i<=n;++i) a[i]=read();
        ans=0;
        int mn=a[n];
        for(int i=n-1;i>=1;--i){
            ans+=mn-a[i];
            mn=min(mn,a[i]);
        }
        printf("%lld\n",ans);
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3656kb

input:

2
5
1 2 3 4 5
3
10 45 10

output:

4
-35

result:

ok 2 number(s): "4 -35"

Test #2:

score: 0
Accepted
time: 28ms
memory: 3748kb

input:

300000
1
-167586
1
45048
1
-218274
1
-39107
1
-15880
1
33014
1
217559
1
-208936
1
-260570
1
-83353
1
-39868
1
-253159
1
-26640
1
-114610
1
-244464
1
-7217
1
-196817
1
168691
1
146930
1
284612
1
-93130
1
-186071
1
-31746
1
37800
1
-255791
1
-237603
1
81359
1
201796
1
106965
1
-8371
1
-85871
1
-270622...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

ok 300000 numbers

Test #3:

score: 0
Accepted
time: 33ms
memory: 3680kb

input:

150000
2
-13258 -22375
2
-54993 -139278
2
-190454 190904
2
-167856 -255749
2
-4278 -217960
2
-267607 -152069
2
232717 199468
2
-154968 -171972
2
-166963 -274452
2
78459 -235523
2
-243695 163707
2
37498 -80301
2
196137 -251909
2
-77332 -82651
2
236076 250081
2
-139194 8035
2
256129 185906
2
72175 -17...

output:

-9117
-84285
381358
-87893
-213682
115538
-33249
-17004
-107489
-313982
407402
-117799
-448046
-5319
14005
147229
-70223
-242776
531933
251314
-377509
-258596
-210071
480133
-27044
110616
213370
6298
-370703
-118888
-103653
-346212
54848
-39115
-22654
-90525
-90204
345598
-96264
854
-433346
-187189
...

result:

ok 150000 numbers

Test #4:

score: -100
Wrong Answer
time: 14ms
memory: 3688kb

input:

100000
3
99677 -229948 68140
3
-54211 -95409 260502
3
151289 -78245 141319
3
44080 -120949 108082
3
-146874 -144493 251966
3
198672 5102 103967
3
165781 237071 101294
3
-236562 72879 -77125
3
233711 286742 253192
3
15202 98416 187853
3
-12416 -267937 -283250
3
-137083 -73845 139482
3
260645 202901 -...

output:

-31537
314713
-9970
64002
398840
-94705
-200264
9433
-14069
172651
-286147
276565
-538432
76522
348200
-788400
-139085
-668356
-30025
-892127
-174159
132420
217221
-78679
-306280
-837781
-119004
-124846
36563
321809
-11225
-436944
-309052
-538331
-279352
-595584
-360199
-390572
84683
-125272
-200262...

result:

wrong answer 1st numbers differ - expected: '-361162', found: '-31537'