# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298900 | mhy908 | Circle selection (APIO18_circle_selection) | C++14 | 3084 ms | 391132 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>
#define mp make_pair
#define eb emplace_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(all(x))
#define press(x) x.erase(unique(all(x)), x.end());
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
typedef pair<LL, LL> pll;
const int INF=1e9;
const LL LLINF=1e18;
vector<int> vc;
//struct SEGMENT_TREE{
set<pii> ss[2400010];
void update(int point, int s, int e, int num, pii val, bool ad){
if(ad)ss[point].insert(val);
else ss[point].erase(val);
if(s==e)return;
if(num<=(s+e)/2)update(point*2, s, (s+e)/2, num, val, ad);
else update(point*2+1, (s+e)/2+1, e, num, val, ad);
}
void query(int point, int s, int e, int sx, int ex, int sy, int ey){
if(e<sx||s>ex)return;
if(sx<=s&&e<=ex){
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... |