# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155630 | Akashi | The Forest of Fangorn (CEOI14_fangorn) | C++14 | 1402 ms | 65048 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;
const long double pi = 3.1415926535897;
int w, h;
int n, c, xG, yG;
int x[2005], y[2005], x2[10005], y2[10005];
long double ang[10005];
vector <long double> v[2005];
vector <int> sol;
inline long double angle(long double x, long double y){
long double r = sqrt(x * x + y * y);
x = x / r; y = y / r;
long double alpha = acos(x);
if(y < 0) alpha = 2.0 * pi - alpha;
return alpha;
}
inline bool check(int j, long double alpha1, long double alpha2){
vector <long double> :: iterator it = lower_bound(v[j].begin(), v[j].end(), alpha1);
if(it == v[j].end()) return 1;
if(*it <= alpha2) return 0;
return 1;
}
int main()
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... |