Submission #4260515
Source Code Expand
#include<cstdio> #include<algorithm> using namespace std; const int maxn = 100000; int num[maxn + 1]; int ji[maxn + 1]; int ou[maxn + 1]; int n; int main() { scanf("%d",&n); for(int i = 1;i <= n;++i) { scanf("%d",&num[i]); if(i & 1) { ji[(i + 1) / 2] = num[i]; } else { ou[i / 2] = num[i]; } } sort(ji + 1,ji + 1 + (n + 1) / 2); sort(ou + 1,ou + 1 + n / 2); sort(num + 1,num + 1 + n); int ans = 0; int maxa = 0; if(n & 1) { int p = 1; for(int i = 1;i <= n;i += 2) { if(ji[p] == num[i]) { ++p; continue; } else { if(num[i] < ji[p]) { ++ans; } else { while(ji[p] < num[i] && p <= n / 2) { ++ans; ++p; } } } } maxa = ans; } else { int p = 1; for(int i = 1;i < n;i += 2) { if(ji[p] == num[i]) { ++p; continue; } else { if(num[i] < ji[p]) { ++ans; } else { while(ji[p] < num[i] && p <= n / 2) { ++ans; ++p; } } } } maxa = ans; ans = 0; p = 1; for(int i = 1;i < n;i += 2) { if(ou[p] == num[i]) { ++p; continue; } else { if(num[i] < ou[p]) { ++ans; } else { while(ou[p] < num[i] && p <= n / 2) { ++ans; ++p; } } } } if(maxa > ans) maxa = ans; } printf("%d",maxa); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - BBuBBBlesort! |
User | vjudge4 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1386 Byte |
Status | WA |
Exec Time | 24 ms |
Memory | 896 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:14:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&num[i]); ^
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 | WA | 24 ms | 896 KB |
02.txt | WA | 24 ms | 896 KB |
03.txt | WA | 24 ms | 896 KB |
04.txt | WA | 24 ms | 896 KB |
05.txt | WA | 22 ms | 896 KB |
06.txt | WA | 23 ms | 896 KB |
07.txt | WA | 22 ms | 896 KB |
08.txt | AC | 13 ms | 896 KB |
09.txt | AC | 13 ms | 896 KB |
10.txt | WA | 12 ms | 896 KB |
11.txt | AC | 12 ms | 896 KB |
12.txt | WA | 13 ms | 896 KB |
13.txt | WA | 13 ms | 896 KB |
14.txt | AC | 22 ms | 896 KB |
15.txt | AC | 22 ms | 896 KB |
16.txt | WA | 22 ms | 896 KB |
17.txt | WA | 22 ms | 896 KB |
18.txt | AC | 1 ms | 128 KB |
19.txt | WA | 1 ms | 128 KB |
20.txt | AC | 1 ms | 128 KB |
21.txt | AC | 1 ms | 128 KB |
22.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 1 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |