Submission #1386446


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll maxx = 1e5 + 20;

ll ans = 0, n, a[maxx], b[maxx];
map<ll, ll> m;
vector<ll> v1, v2;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	for(ll i = 0; i < n; i++) cin >> a[i], b[i] = a[i];
	sort(b, b + n);
	for(ll i = 0; i < n; i++)	m[b[i]] = i;
	for(ll i = 0; i < n; i++) a[i] = m[a[i]];//, cout << a[i] << " " ;
	for(ll i = 0; i < n; i += 2) v1.push_back(a[i]), v2.push_back(i);
	sort(v1.begin(), v1.end());
	for(ll i = 0; i < v1.size(); i++) ans += (abs(v1[i] - v2[i]));
	cout << ans;
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User Behnood
Language C++14 (GCC 5.4.1)
Score 0
Code Size 634 Byte
Status WA
Exec Time 92 ms
Memory 9084 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 17
WA × 7
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 91 ms 9084 KB
02.txt WA 92 ms 9084 KB
03.txt WA 91 ms 9084 KB
04.txt WA 91 ms 9084 KB
05.txt WA 89 ms 9084 KB
06.txt WA 90 ms 9084 KB
07.txt WA 90 ms 9084 KB
08.txt AC 60 ms 9084 KB
09.txt AC 62 ms 9084 KB
10.txt AC 62 ms 9084 KB
11.txt AC 61 ms 9084 KB
12.txt AC 61 ms 9084 KB
13.txt AC 61 ms 9084 KB
14.txt AC 92 ms 9084 KB
15.txt AC 90 ms 9084 KB
16.txt AC 92 ms 9084 KB
17.txt AC 89 ms 9084 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