# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104948 | Shtef | SIR (COI15_sir) | C++14 | 1062 ms | 17720 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 <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pll;
#define x first
#define y second
#define mp make_pair
int n, m;
pll a[300005], b[300005];
int ccw(pll x, pll y, pll z){
ll ret = x.x * (y.y - z.y) + y.x * (z.y - x.y) + z.x * (x.y - y.y);
if(ret > 0)
return 1;
if(ret < 0)
return -1;
return 0;
}
bool jedobar(pll x, pll y, int kolko){
for(int i = 0 ; i < m ; ++i){
if(ccw(x, y, b[i]) != kolko)
return 0;
}
return 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |