oj.uz

Submission #151479

# Submission time Handle Problem Language Result Execution time Memory
151479 2019-09-03T11:28:09 Z edenooo Organizing the Best Squad (FXCUP4_squad) C++17
19 / 100
 330 ms 37080 KB 
#include "squad.h"
#include<vector>
#include<algorithm>
using namespace std;

#define INF 1234567890
#define ll long long

struct Line {
	ll a, b;
	double s;
	int idx;

	bool operator< (const Line &n) const
	{
		if (a != n.a) return a < n.a;
		return b > n.b;
	}
};

int N;
vector<Line> v, re;

double Cross(Line &A, Line &B)
{
	return (double)(B.b - A.b) / (A.a - B.a);
}

struct CHT {
	vector<Line> cht;
	void insert(Line n)
	{
		while (!cht.empty())
		{
			if (cht.back().a == n.a)
			{
				if (cht.back().b <= n.b)
				{
					re.push_back(cht.back());
					cht.pop_back();
				}
				else return;
			}
			else
			{
				n.s = Cross(cht.back(), n);
				if (n.s <= cht.back().s) //틀린 이유
				{
					re.push_back(cht.back());
					cht.pop_back();
				}
				else break;
			}
		}
		cht.push_back(n);
	}
	int query(double x)
	{
		if (cht.empty()) return -1;

		int lo = 0, hi = (int)cht.size();
		for (int i = 0; i < 20; i++)
		{
			int mid = lo + hi >> 1;
			if (x < cht[mid].s) hi = mid;
			else lo = mid;
		}
		return lo;
	}
} x, xx, y, yy;

void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	v.reserve(300301); re.reserve(300301);
	x.cht.reserve(300301); xx.cht.reserve(300301); y.cht.reserve(300301); yy.cht.reserve(300301);
	N = A.size();
	for (int i = 0; i < N; i++)
	{
		Line n = { (ll)A[i], (ll)P[i], 0.0, i };
		v.push_back(n);
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < v.size(); i++)
		x.insert(v[i]);

	sort(re.begin(), re.end());
	int M = (int)re.size();
	for (int i = 0; i < M; i++) //틀린 이유
		re[i].s = 0;
	for (int i = 0; i < M; i++)
		xx.insert(re[i]);
	v.clear(); re.clear();

	for (int i = 0; i < N; i++)
	{
		Line n = { (ll)D[i], (ll)P[i], 0.0, i };
		v.push_back(n);
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < v.size(); i++)
		y.insert(v[i]);
	sort(re.begin(), re.end());
	M = (int)re.size();
	for (int i = 0; i < M; i++)
		re[i].s = 0;
	for (int i = 0; i < M; i++)
		yy.insert(re[i]);
	v.clear(); re.clear();
}

long long BestSquad(int X, int Y){
	double pos = (double)X / Y;
	int i = x.query(pos);
	int j = y.query(pos);

	if (x.cht[i].idx != y.cht[j].idx)
		return x.cht[i].a*X + x.cht[i].b*Y + y.cht[j].a*X + y.cht[j].b*Y;
	else
	{
		ll res = 0;
		int ii = xx.query(pos);
		if (ii != -1)
			res = max(res, xx.cht[ii].a*X + xx.cht[ii].b*Y + y.cht[j].a*X + y.cht[j].b*Y);

		int jj = yy.query(pos);
		if (jj != -1)
			res = max(res, x.cht[i].a*X + x.cht[i].b*Y + yy.cht[jj].a*X + yy.cht[jj].b*Y);

		if (i - 1 >= 0)
			res = max(res, x.cht[i - 1].a*X + x.cht[i - 1].b*Y + y.cht[j].a*X + y.cht[j].b*Y);
		if (i + 1 < (int)x.cht.size())
			res = max(res, x.cht[i + 1].a*X + x.cht[i + 1].b*Y + y.cht[j].a*X + y.cht[j].b*Y);
		if (j - 1 >= 0)
			res = max(res, x.cht[i].a*X + x.cht[i].b*Y + y.cht[j - 1].a*X + y.cht[j - 1].b*Y);
		if (j + 1 < (int)y.cht.size())
			res = max(res, x.cht[i].a*X + x.cht[i].b*Y + y.cht[j + 1].a*X + y.cht[j + 1].b*Y);
		return res;
	}
	return -1;
}

Compilation message

squad.cpp: In member function 'int CHT::query(double)':
squad.cpp:64:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = lo + hi >> 1;
              ~~~^~~~
squad.cpp: In function 'void Init(std::vector<int>, std::vector<int>, std::vector<int>)':
squad.cpp:82:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++)
                  ~~^~~~~~~~~~
squad.cpp:99:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++)
                  ~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 330 ms 37080 KB Output is correct
4 Correct 325 ms 36600 KB Output is correct
5 Correct 17 ms 3192 KB Output is correct
6 Correct 260 ms 36420 KB Output is correct
7 Correct 266 ms 36604 KB Output is correct
8 Correct 261 ms 36408 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 330 ms 37080 KB Output is correct
4 Correct 325 ms 36600 KB Output is correct
5 Correct 17 ms 3192 KB Output is correct
6 Correct 260 ms 36420 KB Output is correct
7 Correct 266 ms 36604 KB Output is correct
8 Correct 261 ms 36408 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -