# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431506 | kai824 | Long Mansion (JOI17_long_mansion) | C++17 | 723 ms | 146220 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;
typedef pair<int,int> pii;
#define f first
#define s second
#define mp make_pair
int last[500005],L[500005],R[500005];
int c[500005];
vector<int> v[500005];
pii rng[500005];//range...
void aq(){//to be kept for later...
int q,a,b;
cin>>q;
while(q--){
cin>>a>>b;
a--;b--;
if(rng[a].f<=b && b<=rng[a].s){
cout<<"YES\n";
}else cout<<"NO\n";
}
}
int n;
struct st{
int s,e;
int ll,rr;
st *l,*r;
# | 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... |