CSES - Datatähti Open 2021 - Results
Submission details
Task:Sorting
Sender:MKopchev
Submission time:2021-01-29 18:30:28 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.87 s2details
#3ACCEPTED0.29 s1, 2details
#4--1, 2details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
input/code.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&inp[i]);
         ~~~~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&t);
     ~~~~~^~~~~~~~~

Code

#include<bits/stdc++.h>
using namespace std;

const int nmax=100+5;

int n,inp[nmax];

map< vector<int>, int> seen;

bool go()
{
    bool ok=1;

    for(int i=1;i<=n;i++)
        if(inp[i]!=i)ok=0;

    if(ok)return 1;

    vector<int> v={};
    for(int i=1;i<=n;i++)v.push_back(inp[i]);

    if(seen.count(v))return 0;
    seen[v]=1;

    for(int i=1;i<n;i++)
        for(int j=i+2;j<n;j++)
        {
            swap(inp[i],inp[j]);
            swap(inp[i+1],inp[j+1]);

            if(go())return 1;

            swap(inp[i],inp[j]);
            swap(inp[i+1],inp[j+1]);
        }
    return 0;
}

bool brute()
{
    seen={};

    return go();
}

void solve()
{
    scanf("%i",&n);

    for(int i=1;i<=n;i++)
    {
        scanf("%i",&inp[i]);
    }

    if(n<=8)
    {
        if(brute())
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }

        return;
    }

    int inv=0;

    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
            if(inp[i]>inp[j])inv++;

    if(inv%2==0)
    {
        printf("YES\n");
    }
    else
    {
        printf("NO\n");
    }
}

int main()
{
    int t;
    scanf("%i",&t);

    while(t)
    {
        t--;
        solve();
    }
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
153
1
1
2
1 2
...

correct output
YES
YES
NO
NO
NO
...

user output
YES
YES
NO
NO
NO
...
Truncated

Test 2

Group: 2

Verdict: ACCEPTED

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:

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
(empty)