#include "squad.h"
#include<vector>
#include<algorithm>
using namespace std;
#define INF 1234567890
#define ll long long
struct Fraction {
ll a, b; // a/b
bool operator< (Fraction &n)
{
ll ta, tb, tc, td;
ta = a; tb = b; tc = n.a; td = n.b;
if (tb < 0) { ta *= -1; tb *= -1; }
if (td < 0) { tc *= -1; td *= -1; }
return ta * td < tb * tc;
}
bool operator<= (Fraction &n)
{
ll ta, tb, tc, td;
ta = a; tb = b; tc = n.a; td = n.b;
if (tb < 0) { ta *= -1; tb *= -1; }
if (td < 0) { tc *= -1; td *= -1; }
return ta * td <= tb * tc;
}
};
struct Line {
ll a, b;
Fraction 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;
Fraction Cross(Line &A, Line &B)
{
return { (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(Fraction 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, 1}, 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, 1 };
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, 1}, 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, 1 };
for (int i = 0; i < M; i++)
yy.insert(re[i]);
v.clear(); re.clear();
}
long long BestSquad(int X, int Y){
Fraction pos = { 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(Fraction)':
squad.cpp:84: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:102:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++)
~~^~~~~~~~~~
squad.cpp:119:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++)
~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
372 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
348 ms |
51472 KB |
Output is correct |
| 4 |
Correct |
348 ms |
51320 KB |
Output is correct |
| 5 |
Correct |
18 ms |
3576 KB |
Output is correct |
| 6 |
Correct |
288 ms |
51292 KB |
Output is correct |
| 7 |
Correct |
284 ms |
51192 KB |
Output is correct |
| 8 |
Correct |
279 ms |
49796 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
372 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
348 ms |
51472 KB |
Output is correct |
| 4 |
Correct |
348 ms |
51320 KB |
Output is correct |
| 5 |
Correct |
18 ms |
3576 KB |
Output is correct |
| 6 |
Correct |
288 ms |
51292 KB |
Output is correct |
| 7 |
Correct |
284 ms |
51192 KB |
Output is correct |
| 8 |
Correct |
279 ms |
49796 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
