QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#371321 | #8505. Almost Aligned | ucup-team3215 | WA | 0ms | 3896kb | C++20 | 1.7kb | 2024-03-30 04:56:56 | 2024-03-30 04:56:57 |
Judging History
answer
#include <algorithm>
#include <array>
#include <cstdint>
#include <iostream>
#include <vector>
//#pragma GCC optimize "no-fast-math"
using namespace std;
using point = array<int, 2>;
int64_t operator^(point a, point b) { return a[0] * (int64_t)b[1] - a[1] * (int64_t)b[0]; }
int64_t operator&(point a, point b) { return a[0] * (int64_t)b[0] + a[1] * (int64_t)b[1]; }
point operator-(point a) { return {-a[0], -a[1]}; }
point operator-(point a, point b) { return {a[0] - b[0], a[1] - b[1]}; }
vector<point> env(const vector<point>& v) {
vector<point> e;
for (auto& p: v) {
while (e.size() > 1 && (e.back() - e.end()[-2] ^ p - e.back()) >= 0) e.pop_back();
e.push_back(p);
}
return e;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
vector<point> v[2];
v[0].resize(n), v[1].resize(n);
for (int i = 0; i < n; ++i) cin >> v[0][i][1] >> v[1][i][1] >> v[0][i][0] >> v[1][i][0];
vector<point> e[4];
for (int c: {0, 1}) {
sort(v[c].begin(), v[c].end());
e[c * 2] = env(v[c]);
for (auto& p: v[c]) p = -p;
reverse(v[c].begin(), v[c].end());
e[c * 2 + 1] = env(v[c]);
}
auto ans = 0.L / 0;
int i[4]{};
while (1) {
int w = -1;
for (int j = 0; j < 4; ++j) if (i[j] + 1 < e[j].size() && (!~w || (e[j][i[j] + 1] - e[j][i[j]] ^ e[w][i[w] + 1] - e[w][i[w]]) < 0)) w = j;
auto a = e[0][i[0]] - -e[1][i[1]], b = e[2][i[2]] - -e[3][i[3]];
long double t;
if (~w) { auto d = e[w][i[w] + 1] - e[w][i[w]]; ++i[w]; t = -d[1] * 1. / d[0]; }
if ((!~w || t > 0) && ans != ans) ans = a[1] * 1.L * b[1];
if (!~w) break;
if (t > 0) ans = min(ans, (a[0] * t + a[1]) * (b[0] * t + b[1]));
}
cout.precision(9);
cout << fixed << ans;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3896kb
input:
4 0 0 10 10 0 0 10 10 10 10 -10 -10 10 0 -20 0
output:
nan
result:
wrong output format Expected double, but "nan" found