CSES - Datatähti Open 2021 - Results
Submission details
Task:Sorting
Sender:Pyqe
Submission time:2021-01-31 15:15:53 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&t);
  ~~~~~^~~~~~~~~~~
input/code.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&n);
   ~~~~~^~~~~~~~~~~
input/code.cpp:17:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",a+i);
    ~~~~~^~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
long long n,a[100069],pst[100069];
int main()
{
long long t,rr,i,ii,k,c,z;
scanf("%lld",&t);
for(rr=0;rr<t;rr++)
{
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",a+i);
pst[a[i]]=i;
}
if(i<4)
{
for(i=1;i<=n;i++)
{
if(a[i]!=i)
{
break;
}
}
z=i>n;
}
else if(i==4)
{
for(ii=0;ii<2;ii++)
{
for(i=1;i<=n;i++)
{
if(a[i]!=(i+ii*2-1)%n+1)
{
break;
}
}
if(i>n)
{
break;
}
}
z=ii<2;
}
else
{
c=0;
for(i=1;i<=n;i++)
{
if(a[i]!=i)
{
c++;
k=pst[i];
swap(a[i],a[k]);
swap(pst[a[i]],pst[a[k]]);
}
}
z=c%2==0;
}
if(z)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
}

Test details

Test 1

Group: 1, 2

Verdict:

input
153
1
1
2
1 2
...

correct output
YES
YES
NO
NO
NO
...

user output
YES
YES
NO
NO
YES
...
Truncated

Test 2

Group: 2

Verdict:

input
1000
59
35 29 32 50 11 15 9 21 19 45 2...

correct output
YES
NO
YES
NO
YES
...

user output
YES
NO
YES
NO
YES
...
Truncated

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
720
6
1 6 4 5 2 3
6
6 3 2 1 5 4
...

correct output
YES
NO
NO
NO
YES
...

user output
YES
NO
NO
NO
YES
...
Truncated

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
1000
8
7 4 2 8 6 3 5 1
8
3 8 2 7 5 4 6 1
...

correct output
NO
NO
YES
NO
YES
...

user output
NO
NO
YES
NO
YES
...
Truncated