oj.uz

Submission #914234

# Submission time Handle Problem Language Result Execution time Memory
914234 2024-01-21T12:01:04 Z Litusiano Curtains (NOI23_curtains) C++17
0 / 100
 2 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;

bool cmp(pair<int,int> a, pair<int,int> b){
	return a.second < b.second;
}

bool intersect(pair<int,int> a, pair<int,int> b){
	return (b.first == a.second+1 || b.first<=a.second); 
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,m,q; cin>>n>>m>>q;
	vector<pair<int,int>> v;
	set<pair<int,int>> sgs;
	for(int i = 0; i<m; i++){
		int l,r; cin>>l>>r;
		sgs.insert({l,r}); v.push_back({l,r});
	}
	sort(v.begin(),v.end(),cmp);
	for(int i = 0; i<m; i++){
		for(int j = i+1; j<m; j++){
			if(intersect(v[i],v[j])){
				sgs.insert({min(v[i].first,v[j].first), max(v[i].second,v[j].second)});
			}
		}
	}
	while(q--){
		int l,r; cin>>l>>r;
		pair<int,int> p = {l,r};
		if(sgs.count(p)) cout<<"YES\n";
		else cout<<"NO\n"<<endl;
	}
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -