# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916277 | PM1 | Constellation 3 (JOI20_constellation3) | C++17 | 3 ms | 16728 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 fr first
#define sc second
#define ll long long
const int mxn=2e5+5;
ll n,m,a[mxn],par[mxn],sz[mxn],rast[mxn],chap[mxn],mxr[mxn],mxl[mxn],mark[mxn],rb[mxn],lb[mxn];
ll dp[mxn],ans=0;
struct star{
int xx,yy,c;
}str[mxn];
vector<pair<int,int> >bld;
pair<ll,ll>pd[mxn];
bool cmp(star x,star y){
if(x.yy!=y.yy)
return x.yy<y.yy;
return x.xx<y.xx;
}
struct segment{
ll val[mxn*4];
void up(int id,int L,int R,int l,ll x){
if(L+1==R){
val[id]=x;
return;
}
int mid=(L+R)/2;
if(l<mid)
up(id*2,L,mid,l,x);
else
up(id*2+1,mid,R,l,x);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |