# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731976 | NemanjaSo2005 | Passport (JOI23_passport) | C++14 | 495 ms | 18596 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 ll long long
using namespace std;
int N,K,L[200005],R[200005],dist[200005],d1[200005],d2[200005];
bool ubacen[2505];
struct bfss{
int gde,kol;
}pp,tren;
bool cmp(bfss a,bfss b){
return a.kol<b.kol;
}
vector<bfss> V;
queue<bfss> Q,C;
struct slog{
int r,gde,l,pn;
} st[525000],niz[200005];
bool cmp2(slog a,slog b){
return a.l<b.l;
}
slog opr(slog a,slog b){
if(a.r>b.r)
return a;
return b;
}
void update(int gde,int sta,int gde2=-1,int pn=-1){
gde+=K-1;
st[gde].r=sta;
if(gde2!=-1)
st[gde].gde=gde2;
if(pn!=-1)
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... |