Submission #846055


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
int main() {
	
	int N;
	cin >> N;
	vector<int> A;
	vector<int> B;
	for(int i=0; i<N; i++) {
		int a;
		cin >> a;
		if(i%2==0) A.push_back(a);
		else B.push_back(a);
		
	}
	int maxim = 1002000000;
	A.push_back(maxim);
	B.push_back(maxim);
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());
	
	LL left = 0;
	LL right = 0;
	LL sum = 0;
	for(int i=0; i<N; i++) {
		LL pos;
		if(A[left] < B[right]) {pos = left * 2; left++;}
		else {pos = right*2+1; right++; }
//		cout << pos << endl;
//		cout << pos << " " << i << endl; 
		sum += max((LL)0, pos - i);
	}
	
	cout << sum << endl;
	
	
	return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User tokoharu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 732 Byte
Status WA
Exec Time 90 ms
Memory 892 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 86 ms 892 KB
02.txt WA 84 ms 892 KB
03.txt WA 84 ms 892 KB
04.txt WA 90 ms 892 KB
05.txt WA 65 ms 892 KB
06.txt WA 65 ms 892 KB
07.txt WA 65 ms 892 KB
08.txt AC 57 ms 892 KB
09.txt AC 57 ms 892 KB
10.txt AC 69 ms 892 KB
11.txt AC 69 ms 892 KB
12.txt AC 57 ms 892 KB
13.txt AC 57 ms 892 KB
14.txt AC 64 ms 892 KB
15.txt AC 64 ms 892 KB
16.txt AC 65 ms 892 KB
17.txt AC 65 ms 892 KB
18.txt AC 4 ms 256 KB
19.txt AC 4 ms 256 KB
20.txt AC 4 ms 256 KB
21.txt AC 4 ms 256 KB
22.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB