Submission #3440171


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int n,l,r,a[100001],s[100001],c[200001];

int lowbit(int x){
	return x&(-x);
}

int query(int x){
	int i,sum=0;
	for(i=x;i>=1;i-=lowbit(i))
		sum+=c[i];
	return sum;
}

void add(int x){
	for(int i=x;i<=2*n;i+=lowbit(i))
		c[i]++;
}

bool check(int x){
	int i;
	long long sum=0;
	for(i=1;i<=2*n;i++)
		c[i]=0;
	for(i=1;i<=n;i++)
		s[i]=s[i-1]+(a[i]>=x);
	for(i=1;i<=n;i++){
		sum+=query(s[i]+n);
		add(s[i]+n);
	}
	return sum>=1ll*n*(n+1)/4;
}

int main(){
	int mid,i;
	cin >> n;
	for(i=1;i<=n;i++){
		cin >> a[i];
		r=max(r,a[i]);
	}
	while(l<=r){
		mid=(l+r)/2;
		if(check(mid))
			l=mid+1;
		else
			r=mid-1;
	}
	cout << r;
	return 0;
}

Submission Info

Submission Time
Task D - Median of Medians
User tzr000
Language C++14 (GCC 5.4.1)
Score 0
Code Size 769 Byte
Status WA
Exec Time 123 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
WA × 1
AC × 6
WA × 13
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt WA 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 23 ms 1792 KB
1_03.txt AC 122 ms 1792 KB
1_04.txt WA 68 ms 1792 KB
1_05.txt WA 73 ms 1792 KB
1_06.txt WA 68 ms 1792 KB
1_07.txt WA 71 ms 1792 KB
1_08.txt WA 123 ms 1792 KB
1_09.txt WA 120 ms 1792 KB
1_10.txt WA 113 ms 1792 KB
1_11.txt WA 113 ms 1792 KB
1_12.txt WA 116 ms 1792 KB
1_13.txt WA 118 ms 1792 KB
1_14.txt WA 118 ms 1792 KB
1_15.txt WA 121 ms 1792 KB