Submission #4262083


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
struct node{
	int val;
	int index;
	int b;
}a[200000];
bool comp1(node a,node b){
	return a.val < b.val;
}
bool comp2(node a,node b){
	return a.index < b.index;
}
int main(){
	scanf("%d",&n);
	for(int i = 1;i <= n;i ++){
		scanf("%d",&a[i].val);
		a[i].index = i;
	}
	sort(a+1,a+n+1,comp1);
	for(int i = 1;i <= n;i ++){
		a[i].b = i;
	}
	sort(a+1,a+n,comp2);
	int cnt[2] = {0,0};
	for(int i = 1;i <= n;i ++){
		if((a[i].index & 1) == (a[i].b & 1)){
			continue;
		}
		else {
			cnt[(a[i].index & 1)] ++;
		}
	}
	printf("%d",max(cnt[0],cnt[1]));
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User vjudge4
Language C++14 (GCC 5.4.1)
Score 600
Code Size 641 Byte
Status AC
Exec Time 32 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:20:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i].val);
                        ^

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 32 ms 1408 KB
02.txt AC 32 ms 1408 KB
03.txt AC 32 ms 1408 KB
04.txt AC 32 ms 1408 KB
05.txt AC 30 ms 1408 KB
06.txt AC 30 ms 1408 KB
07.txt AC 30 ms 1408 KB
08.txt AC 21 ms 1408 KB
09.txt AC 21 ms 1408 KB
10.txt AC 18 ms 1408 KB
11.txt AC 18 ms 1408 KB
12.txt AC 20 ms 1408 KB
13.txt AC 20 ms 1408 KB
14.txt AC 30 ms 1408 KB
15.txt AC 30 ms 1408 KB
16.txt AC 30 ms 1408 KB
17.txt AC 30 ms 1408 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