# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63153 | khsoo01 | 공룡 발자국 (KOI18_footprint) | C++11 | 1911 ms | 84672 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>
#define X first
#define Y second
using namespace std;
typedef pair<int,int> pii;
const int N = 3005, inf = 1e9;
int n;
pii a[N], dt[N][N][2], piv;
vector<int> ans;
long long ccw (pii &A, pii &B, pii &C) {
return (1ll*A.X*B.Y+1ll*B.X*C.Y+1ll*C.X*A.Y) - (1ll*A.Y*B.X+1ll*B.Y*C.X+1ll*C.Y*A.X);
}
bool cmp (pii &A, pii &B) {
return ccw(piv, A, B) > 0;
}
bool cmp2 (int A, int B) {
return ccw(piv, a[A], a[B]) > 0;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) {
scanf("%d%d",&a[i].X,&a[i].Y);
Compilation message (stderr)
# | 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... |