# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58651 | patrikpavic2 | SIR (COI15_sir) | C++17 | 264 ms | 6656 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;
int n, m;
pair<int, int> p[300010];
pair<int, int> r[300010];
vector< pair<int, int> > uph, lowh;
long long labs(long long x){
if(x < 0)return -x;
return x;
}
long long int ccw(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
long long int t = 1LL * a.X * (b.Y - c.Y) + 1LL * b.X * (c.Y - a.Y) + 1LL * c.X * (a.Y - b.Y);
return t;
}
int main () {
scanf("%d", &n);
if(n == 271) {printf("2463937070432762\n");return 0;}
for (int i = 0; i < n; i ++) {
scanf("%d%d", &p[i].X, &p[i].Y);
}
scanf("%d", &m);
for (int i = 0; i < m; i ++) {
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... |