oj.uz

답안 #150991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150991 2019-09-01T14:05:40 Z pichulia 십자가 놓기 (FXCUP4_cross) C++17
100 / 100
 247 ms 15868 KB 
#include "cross.h"
#include<algorithm>
#define I 262144
using namespace std;
typedef pair<long long, long long> pll;
int n;
pll a[200009];
long long int ax[200009];
long long int bx[200009];
int al;
int bl;
int ms[2 * I];
void update(int i, int v)
{
	i = i + I;
	ms[i] += v;
	i /= 2;
	while (i > 0) {
		ms[i] = ms[i * 2] + ms[i * 2 + 1];
		i /= 2;
	}
}
int find_min(int dep, int m, int ll, int rr) {
	if (dep >= I) return ll;
	if (ms[dep * 2 + 1] >= m) return find_min(dep * 2 + 1, m, (ll + rr) / 2 + 1, rr);
	return find_min(dep * 2, m - ms[dep * 2 + 1], ll, (ll + rr) / 2);
}
long long SelectCross(int m, std::vector<int> aa, std::vector<int> bb) {
	n = aa.size();
	al = bl = 0;
	int i, j, k;
	for (i = 0; i < n; i++) {
		a[i].first = aa[i];
		a[i].second = bb[i];
		ax[al++] = aa[i];
		bx[bl++] = bb[i];
	}
	bx[bl++] = -999999999;
	sort(ax, ax + al); al = unique(ax, ax + al) - ax;
	sort(bx, bx + bl); bl = unique(bx, bx + bl) - bx;
	for (i = 0; i < n; i++) {
		a[i].first = lower_bound(ax, ax + al, a[i].first) - ax;
		a[i].second = lower_bound(bx, bx + bl, a[i].second) - bx;
	}
	sort(a, a + n);
	for (i = 0; i < 2 * I; i++)ms[i] = 0;

	i = n - 1;
	j = 0;
	long long int res = 0;
	for (k = al - 1; k >= 0; k--)
	{
		//printf("%d %d -->\n", k, i);
		while (i >= 0 && a[i].first == k)
		{
			//printf("%lld , update %lld\n", ax[k], a[i].second);
			update(a[i].second, 1);
			i--;
		}
		if (ms[1] >= m)
		{
			j = find_min(1, m, 0, I - 1);
			//printf("%d , %d\n", ms[1], j);
			if (j > 0) {
				long long int x = ax[k];
				long long int y = bx[j];
				long long int cur = 2 * x * y - x * x;
				//printf("%lld %lld  %lld %lld\n", x, y, cur, res);
				res = max(res, cur);
			}
		}
	}

	return res;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 5 ms 2424 KB Output is correct
5 Correct 15 ms 3196 KB Output is correct
6 Correct 242 ms 14760 KB Output is correct
7 Correct 241 ms 15868 KB Output is correct
8 Correct 238 ms 15676 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 5 ms 2424 KB Output is correct
5 Correct 15 ms 3196 KB Output is correct
6 Correct 242 ms 14760 KB Output is correct
7 Correct 241 ms 15868 KB Output is correct
8 Correct 238 ms 15676 KB Output is correct
9 Correct 5 ms 2424 KB Output is correct
10 Correct 6 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 15 ms 3192 KB Output is correct
13 Correct 118 ms 9196 KB Output is correct
14 Correct 239 ms 14468 KB Output is correct
15 Correct 238 ms 15724 KB Output is correct
16 Correct 239 ms 15728 KB Output is correct

Subtask #3
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 5 ms 2424 KB Output is correct
5 Correct 15 ms 3196 KB Output is correct
6 Correct 242 ms 14760 KB Output is correct
7 Correct 241 ms 15868 KB Output is correct
8 Correct 238 ms 15676 KB Output is correct
9 Correct 5 ms 2424 KB Output is correct
10 Correct 6 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 15 ms 3192 KB Output is correct
13 Correct 118 ms 9196 KB Output is correct
14 Correct 239 ms 14468 KB Output is correct
15 Correct 238 ms 15724 KB Output is correct
16 Correct 239 ms 15728 KB Output is correct
17 Correct 4 ms 2424 KB Output is correct
18 Correct 4 ms 2452 KB Output is correct
19 Correct 16 ms 3320 KB Output is correct
20 Correct 120 ms 9312 KB Output is correct
21 Correct 189 ms 13004 KB Output is correct
22 Correct 247 ms 15716 KB Output is correct
23 Correct 243 ms 15792 KB Output is correct
24 Correct 245 ms 15672 KB Output is correct
25 Correct 233 ms 15852 KB Output is correct
26 Correct 236 ms 15848 KB Output is correct