Submission #1365488
Source Code Expand
#include <iostream> #include <algorithm> int LOGN = 20; int v[100009], a[100009]; int main(){ int n; std::cin >> n; for(int i = 1; i <= n; i ++) std::cin >> v[i]; for(int i = 1; i <= n; i ++) a[i] = v[i]; std::sort(a+1, a+n+1); int ans=0; for(int i = 1; i <= n; i ++){ int rez = 0; for(int pas = 1 << LOGN; pas; pas >>= 1) if(rez + pas <= n && a[rez + pas] <= v[i]) rez += pas; if((rez + i) % 2) ans ++; } std::cout << ans/2; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - BBuBBBlesort! |
User | alexpetrescu |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 600 Byte |
Status | AC |
Exec Time | 69 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 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 | AC | 68 ms | 1024 KB |
02.txt | AC | 68 ms | 1024 KB |
03.txt | AC | 68 ms | 1024 KB |
04.txt | AC | 69 ms | 1024 KB |
05.txt | AC | 52 ms | 1024 KB |
06.txt | AC | 52 ms | 1024 KB |
07.txt | AC | 51 ms | 1024 KB |
08.txt | AC | 44 ms | 1024 KB |
09.txt | AC | 42 ms | 1024 KB |
10.txt | AC | 42 ms | 1024 KB |
11.txt | AC | 41 ms | 1024 KB |
12.txt | AC | 44 ms | 1024 KB |
13.txt | AC | 43 ms | 1024 KB |
14.txt | AC | 51 ms | 1024 KB |
15.txt | AC | 51 ms | 1024 KB |
16.txt | AC | 53 ms | 1024 KB |
17.txt | AC | 51 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 |