# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135938 | onjo0127 | Tri (CEOI09_tri) | C++11 | 125 ms | 7928 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;
using ll = long long;
using pll = pair<ll, ll>;
#define X first
#define Y second
#define sz(V) ((int)V.size())
int CCW(pll A, pll B, pll C) {
long long tmp = A.X*B.Y + B.X*C.Y + C.X*A.Y - A.Y*B.X - B.Y*C.X - C.Y*A.X;
if(tmp < 0LL) return -1;
if(tmp == 0LL) return 0;
if(tmp > 0LL) return +1;
}
pll add(pll A, pll B, pll C) {
return {A.X + C.X - B.X, A.Y + C.Y - B.Y};
}
bool chk(vector<pll> &H, pll A, pll B) {
if(CCW({0, 0}, A, B) == 1) swap(A, B);
bool f = 0;
int l = 0, r = sz(H) - 1;
while(l <= r) {
int m = l+r >> 1;
if(CCW(A, B, H[m]) == -1) f = 1;
if(m+1 == sz(H) || CCW(A, B, add(B, H[m], H[m+1])) == 1) r = m-1;
else l = m+1;
}
return f;
}
pll P[100009];
int main() {
int K, M; scanf("%d%d",&K,&M);
for(int i=1; i<=K; i++) scanf("%lld%lld", &P[i].X, &P[i].Y);
sort(P+1, P+K+1);
vector<pll> H;
for(int i=1; i<=K; i++) {
while(sz(H) >= 2 && CCW(H[sz(H) - 2], H[sz(H) - 1], P[i]) <= 0) H.pop_back();
H.push_back(P[i]);
}
for(int i=1; i<=M; i++) {
pll A, B; scanf("%lld%lld%lld%lld", &A.X, &A.Y, &B.X, &B.Y);
if(chk(H, A, B)) puts("Y");
else puts("N");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |