# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244360 | MatesV13 | Relay (COI16_relay) | C++11 | 5 ms | 384 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;
bool v[100005]; int n, m;
struct point{
long long x;
long long y;
} br[100005], vr[100005];
struct nagib{
long long brojnik;
long long nazivnik;
} minnag, maxnag, nag;
inline bool jeveci(nagib a, nagib b){
return (a.brojnik * b.nazivnik) > (b.brojnik * a.nazivnik);
}
void donagib (int idx){
minnag.nazivnik = br[idx].x-vr[0].x;
minnag.brojnik = br[idx].y-vr[0].y;
maxnag.nazivnik = br[idx].x-vr[0].x;
maxnag.brojnik = br[idx].y-vr[0].y;
for (int i=1; i<m; i++){
nag.nazivnik = br[idx].x-vr[i].x;
nag.brojnik = br[idx].y-vr[i].y;
if (jeveci(nag, maxnag)) maxnag=nag;
if (jeveci(minnag, nag)) minnag=nag;
}
} queue<int> xxx;
void solve (int vrh){
donagib(vrh);
for (int i=0; i<n; i++){
if (i==vrh) continue;
# | 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... |