Submission #1368346


Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <map>
#include <string>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <algorithm> 
#include <ctime>

#define MaxN 100005
#define INF 2140000000
 
using namespace std;

FILE *IN,*OUT;

int v[MaxN],a[MaxN],N,ans=0;
int Search(int val)
{
	int lw=1,hi=N,mid;
	while(lw<=hi)
	{
		int mid=(lw+hi)>>1;
		if(v[mid]>val)
			hi=mid-1;
		else if(v[mid]<val)
			lw=mid+1;
		else return mid%2;
	}
}
int main()
{
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		cin>>a[i];
		v[i]=a[i];
	}
	sort(v+1,v+1+N);
	for(int i=1;i<=N;i++)
	{
		if((i%2)^Search(a[i]))
			ans++;
	}
	cout<<ans/2;
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User GabiTulba
Language C++14 (GCC 5.4.1)
Score 600
Code Size 747 Byte
Status AC
Exec Time 70 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 24
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 AC 69 ms 1024 KB
02.txt AC 70 ms 1024 KB
03.txt AC 69 ms 1024 KB
04.txt AC 70 ms 1024 KB
05.txt AC 53 ms 1024 KB
06.txt AC 53 ms 1024 KB
07.txt AC 53 ms 1024 KB
08.txt AC 42 ms 1024 KB
09.txt AC 41 ms 1024 KB
10.txt AC 42 ms 1024 KB
11.txt AC 42 ms 1024 KB
12.txt AC 41 ms 1024 KB
13.txt AC 44 ms 1024 KB
14.txt AC 52 ms 1024 KB
15.txt AC 54 ms 1024 KB
16.txt AC 53 ms 1024 KB
17.txt AC 53 ms 1024 KB
18.txt AC 1 ms 256 KB
19.txt AC 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