QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #122585 | #3836. So I'll Max Out My Constructive Algorithm Skills | suyue | WA | 2ms | 3560kb | C++98 | 556b | 2023-07-10 19:35:11 | 2023-07-10 19:35:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T,n,a[70][70],m,b[10000],cnt1,cnt2;
signed main()
{
for(cin>>T;T--;)
{
cin>>n; m=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
cin>>a[i][j];
for(int i=1;i<=n;++i)
if(i&1) for(int j=1;j<=n;++j) b[++m]=a[i][j];
else for(int j=n;j>=1;--j) b[++m]=a[i][j];
for(int i=2;i<=m;++i)
if(b[i-1]>b[i]) ++cnt1;
else ++cnt2;
if(cnt1>=cnt2)
for(int i=1;i<=m;++i) cout<<b[i]<<" \n"[i==m];
else
for(int i=m;i>=1;--i) cout<<b[i]<<" \n"[i==1];
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3372kb
input:
1 2 4 3 2 1
output:
4 3 1 2
result:
ok correct
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3560kb
input:
100 9 30 75 35 51 25 19 76 65 62 11 56 63 60 77 48 28 26 74 16 44 46 41 17 8 66 61 42 29 7 43 38 40 31 27 10 39 52 23 58 80 50 20 33 69 47 79 1 5 49 22 37 71 18 70 54 72 4 64 55 34 12 6 15 14 53 45 13 32 59 73 57 81 36 3 78 24 2 68 9 67 21 7 11 28 2 19 9 41 24 17 34 5 10 42 18 47 33 35 22 8 49 1 29 ...
output:
30 75 35 51 25 19 76 65 62 74 26 28 48 77 60 63 56 11 16 44 46 41 17 8 66 61 42 39 10 27 31 40 38 43 7 29 52 23 58 80 50 20 33 69 47 70 18 71 37 22 49 5 1 79 54 72 4 64 55 34 12 6 15 81 57 73 59 32 13 45 53 14 36 3 78 24 2 68 9 67 21 11 28 2 19 9 41 24 47 18 42 10 5 34 17 33 35 22 8 49 1 29 26 7 44 ...
result:
wrong answer [case 4] Not lazy, up = 42, down = 38