Submission #1444042


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<complex>
using namespace std;
int n,a[100010];
vector<int> v;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(i%2==0)v.push_back(a[i]);
	}
	sort(a,a+n);
	sort(v.begin(),v.end());
	long long ans=0;
	for(int i=0;i<v.size();i++){
		int k=lower_bound(a,a+n,v[i])-a;
		if(k%2==1)ans++;
	}cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User ynymxiaolongbao
Language C++14 (GCC 5.4.1)
Score 600
Code Size 414 Byte
Status AC
Exec Time 65 ms
Memory 1020 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 64 ms 896 KB
02.txt AC 65 ms 1020 KB
03.txt AC 64 ms 896 KB
04.txt AC 65 ms 896 KB
05.txt AC 48 ms 1020 KB
06.txt AC 48 ms 896 KB
07.txt AC 48 ms 896 KB
08.txt AC 42 ms 1020 KB
09.txt AC 41 ms 1020 KB
10.txt AC 40 ms 1020 KB
11.txt AC 41 ms 896 KB
12.txt AC 41 ms 896 KB
13.txt AC 41 ms 1020 KB
14.txt AC 49 ms 896 KB
15.txt AC 48 ms 896 KB
16.txt AC 49 ms 1020 KB
17.txt AC 48 ms 896 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