# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54465 | SpaimaCarpatilor | 원 고르기 (APIO18_circle_selection) | C++17 | 1938 ms | 447580 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;
int N, x[300009], y[300009], r[300009], id[300009], oldOrd[300009], ord[300009], ans[300009];
pair < int, int > h[300009];
bool cmp (int i, int j)
{
if (r[i] == r[j]) return (i < j);
return (r[i] > r[j]);
}
unsigned int K = 1 << 31;
void doubleGrid ()
{
memcpy (oldOrd, ord, sizeof (ord));
int M = 0;
for (int i=1; i<=N; i++)
{
int j = i;
while (j < N && h[j + 1].first == h[j].first) j++;
for (int k=0; k<2; k++)
for (int l=i; l<=j; l++)
{
int r = l;
while (r < j && h[r + 1].second == h[l].second) r ++;
///playing with [l, r]
for (int p=0; p<2; p++)
for (int pos=l; pos<=r; pos++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |