Submission #4260720


Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
struct Node{
	int value;
	int devid;
	int index;
} arr[100050];
bool comp1(const Node &A,const Node &B)
{
	return A.value<B.value;
}
bool comp2(const Node &A,const Node &B)
{
	return A.index < B.index;
}
int main()
{
	int N;
	scanf("%d",&N);
	for(int i=1;i<=N;++i)
	{
		scanf("%d",&arr[i].value);
		arr[i].index=i;
	}
	sort(arr+1,arr+N+1,comp1);
	for(int i=1;i<=N;++i)
	{
		arr[i].devid=i;
	}
	sort(arr+1,arr+N+1,comp2);
	int B[100050];
	for(int i=1;i<=N;++i)
	{
		B[i]=arr[i].devid;
	}
	int ans=0;
	for(int i=1;i<=N;++i)
	{
		if(B[i]%2!=i%2)
		{
			if(B[i]==i+1||B[i]==i-1)
			{
				ans--;
			}
			ans++;
		}
	}
	printf("%d",ans);
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User vjudge4
Language C++14 (Clang 3.8.0)
Score 0
Code Size 721 Byte
Status WA
Exec Time 39 ms
Memory 2424 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 11
WA × 13
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 39 ms 2424 KB
02.txt WA 33 ms 1792 KB
03.txt WA 32 ms 1792 KB
04.txt WA 32 ms 1792 KB
05.txt WA 31 ms 1792 KB
06.txt WA 31 ms 1792 KB
07.txt WA 30 ms 1792 KB
08.txt AC 13 ms 1792 KB
09.txt AC 14 ms 1792 KB
10.txt WA 14 ms 1792 KB
11.txt AC 14 ms 1792 KB
12.txt WA 19 ms 1792 KB
13.txt WA 19 ms 1792 KB
14.txt AC 30 ms 1792 KB
15.txt AC 30 ms 1792 KB
16.txt WA 30 ms 1792 KB
17.txt WA 30 ms 1792 KB
18.txt AC 1 ms 256 KB
19.txt WA 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB