# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466723 | palilo | 먼 별 (KOI16_dist) | C++17 | 67 ms | 1956 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmin(T& _old, T _new) { return _old > _new && (_old = _new, true); }
template <class T>
bool chmax(T& _old, T _new) { return _old < _new && (_old = _new, true); }
struct star_t {
int x, y, dx, dy;
};
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
#ifdef palilo
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
int n, t;
cin >> n >> t;
vector<star_t> a(n);
for (auto& [x, y, dx, dy] : a) {
cin >> x >> y >> dx >> dy;
}
auto cross2 = [&](const pair<int, int>& u, const pair<int, int>& v) {
return int64_t(u.first) * (v.second) - int64_t(u.second) * (v.first);
};
auto cross3 = [&](const pair<int, int>& o, const pair<int, int>& u, const pair<int, int>& v) {
return int64_t(u.first - o.first) * (v.second - o.second) -
int64_t(u.second - o.second) * (v.first - o.first);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |