# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702992 | Hanksburger | Park (BOI16_park) | C++17 | 520 ms | 67648 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;
vector<pair<long double, pair<long long, long long> > > vec;
long long x[2005], y[2005], r[2005], par[4005];
pair<pair<long long, long long>, long long> a[100005];
bool ans[100005][5];
long long p(long long u)
{
return par[u]==u?u:(par[u]=p(par[u]));
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m, w, h, ind=0;
cin >> n >> m >> w >> h;
for (long long i=1; i<=n; i++)
{
cin >> x[i] >> y[i] >> r[i];
for (long long j=1; j<i; j++)
vec.push_back({sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))-r[i]-r[j], {i, j}});
vec.push_back({x[i]-r[i], {i, n*2}});
vec.push_back({y[i]-r[i], {i, n*2+1}});
vec.push_back({w-x[i]-r[i], {i, n*2+2}});
vec.push_back({h-y[i]-r[i], {i, n*2+3}});
}
for (long long i=1; i<=m; i++)
{
cin >> a[i].first.first >> a[i].first.second;
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... |