# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64772 | bazsi700 | The Forest of Fangorn (CEOI14_fangorn) | C++14 | 3050 ms | 968 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;
#define ll long long
#define C complex<ll>
#define X real()
#define Y imag()
ll w,h,n,c;
C g;
C camp[2005];
C tree[10005];
bool can[15];
int sign(ll x) {
if(x > 0) {
return 1;
} else if(x == 0) {
return 0;
} else {
return -1;
}
}
ll cross(C a, C b) { //-1 bal, 0 egyenes, 1 jobb A hoz képest a B
return sign(((a*conj(b)).Y));
}
int main()
{
# | 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... |