| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346581 | nezuko2410 | Curtains (NOI23_curtains) | C++20 | 1 ms | 836 KiB |
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=5e5+10;
int n,m,q,s[N],e[N],a[2005][2005],x,i,j;
vector<pair<int,int>>v;
int main() {
cin>>n>>m>>q;
v.resize(m);
for (i=0; i<m; i++)
cin>>v[i].fi>>v[i].se;
sort(v.begin(),v.end());
for (i=0; i<q; i++) {
cin>>s[i]>>e[i];
}
for (i=0; i<m; i++) {
x=v[i].se;
a[v[i].fi][x]=1;
for (j=i+1; j<m; j++) {
if (v[j].fi<=x+1) {
x=max(x,v[j].se);
a[v[i].fi][x]=1;
}
else break;
}
}
for (i=0; i<q; i++)
if (a[s[i]][e[i]]==1)
cout<<"YES\n";
else
cout<<"NO\n";
}| # | 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... | ||||
