Submission #4260907
Source Code Expand
#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
const int N=1e5+5;
inline int read(){
int x=0,w=0;char ch=0;
while(!isdigit(ch)) w|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return w?-x:x;
}
struct Node{
int data,id;
inline bool operator <(const Node &x)const{return data<x.data;}
}a[N];
int n,ans,b[N];
int main(){
freopen("F.in","r",stdin);
n=read();
for(int i=1;i<=n;++i) a[i].data=read(),a[i].id=i;
// bool fg=0;
// for(int t=1;t<=500000;++t){
// fg=0;
// for(int i=2;i<=n-1;++i)
// if(a[i-1].data>a[i+1].data){
// swap(a[i-1].data,a[i+1].data);
// fg=1;
// }
// if(!fg) break;
// }
// //for(int i=1;i<=n;++i) printf("%d ",a[i]);
// //puts("");
// for(int i=n;i>=2;--i){
// fg=0;
// for(int j=1;j<=i-1;++j)
// if(a[j].data>a[j+1].data){
// swap(a[j].data,a[j+1].data);++ans;
// fg=1;
// }
// if(!fg) break;
// }
sort(a+1,a+n+1);
for(int i=1;i<=n;++i) b[a[i].id]=i;
for(int i=1;i<=n;++i) if((a[i].id&1)!=(i&1)){
++ans;
++a[b[i]].id;
//b[i+1]=b[i];
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2019-02-14 18:49:44+0900
Task
C - BBuBBBlesort!
User
vjudge4
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1100 Byte
Status
TLE
Exec Time
2103 ms
Memory
128 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:27: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("F.in","r",stdin);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 600
Status
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
TLE
2103 ms
128 KB
02.txt
TLE
2103 ms
128 KB
03.txt
TLE
2103 ms
128 KB
04.txt
TLE
2103 ms
128 KB
05.txt
TLE
2103 ms
128 KB
06.txt
TLE
2103 ms
128 KB
07.txt
TLE
2103 ms
128 KB
08.txt
TLE
2103 ms
128 KB
09.txt
TLE
2103 ms
128 KB
10.txt
TLE
2103 ms
128 KB
11.txt
TLE
2103 ms
128 KB
12.txt
TLE
2103 ms
128 KB
13.txt
TLE
2103 ms
128 KB
14.txt
TLE
2103 ms
128 KB
15.txt
TLE
2103 ms
128 KB
16.txt
TLE
2103 ms
128 KB
17.txt
TLE
2103 ms
128 KB
18.txt
TLE
2103 ms
128 KB
19.txt
TLE
2103 ms
128 KB
20.txt
TLE
2103 ms
128 KB
21.txt
TLE
2103 ms
128 KB
22.txt
TLE
2103 ms
128 KB
s1.txt
TLE
2103 ms
128 KB
s2.txt
TLE
2103 ms
128 KB