QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #707683 | #6434. Paimon Sorting | sw7777# | WA | 82ms | 4520kb | C++20 | 875b | 2024-11-03 17:02:00 | 2024-11-03 17:02:01 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
#define int long long
#define endl "\n"
int a[N];
signed main (){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;cin>>t;
while(t--){
int n;cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int de=0;
int ans=0;
for(int i=1;i<=n;i++){
if(i==1) cout<<ans;
else{
if(a[i]==a[i-1]){
ans+=de;
cout<<ans;
}else if(a[i]<a[i-1]){
de++;
ans+=de;
cout<<ans;
}else{
ans+=2;
cout<<ans;
}
}
if(i!=n) cout<<" ";
}
cout<<endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3728kb
input:
3 5 2 3 2 1 5 3 1 2 3 1 1
output:
0 2 3 5 7 0 2 4 0
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 82ms
memory: 4520kb
input:
6107 19 10 13 8 8 11 18 12 9 15 19 6 13 11 11 17 9 14 2 18 12 1 8 10 2 10 2 6 1 5 9 5 7 16 14 4 2 15 12 14 10 3 2 9 15 4 12 9 5 15 10 3 2 5 6 7 8 6 1 6 4 18 6 5 12 12 11 2 10 10 5 10 13 15 13 10 17 7 11 2 1 1 2 1 1 3 2 1 2 17 11 15 3 10 7 15 15 10 5 17 3 3 14 13 11 11 2 3 2 2 3 7 6 1 7 5 3 5 1 7 2 1...
output:
0 2 3 4 6 8 10 13 15 17 21 23 28 33 35 41 43 50 52 0 2 4 5 7 9 11 14 16 18 22 24 0 1 3 5 8 10 14 19 25 27 29 36 38 46 55 57 0 1 3 5 7 9 11 14 16 20 0 1 3 4 6 9 11 14 18 20 22 24 29 35 37 44 46 54 0 0 0 0 1 3 0 2 3 5 7 9 11 14 18 20 25 30 32 38 45 52 60 0 0 2 0 1 3 5 8 10 14 0 1 3 5 7 10 12 0 1 3 5 7...
result:
wrong answer 1st lines differ - expected: '0 2 4 6 7 9 11 16 17 19 28 31 36 41 43 51 55 67 68', found: '0 2 3 4 6 8 10 13 15 17 21 23 28 33 35 41 43 50 52'