oj.uz

답안 #930069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930069 2024-02-18T11:54:05 Z ono_de206 Curtains (NOI23_curtains) C++14
0 / 100
 7 ms 29020 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 5e5, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int l[mxn], r[mxn], ans[mxn];
vector<int> qry[mxn], add[mxn];

int d[mxn * 4], lz[mxn * 4];

void pro(int i, int l, int r) {
	if(lz[i] == 0) return;
	mxx(d[i], lz[i]);
	if(l < r) {
		mxx(d[i * 2], lz[i]);
		mxx(d[i * 2 + 1], lz[i]);
	}
	lz[i] = 0;
} 

void update(int l, int r, int i, int x, int y, int val) {
	pro(i, l, r);
	if(l >= x && r <= y) {
		mxx(lz[i], val);
		pro(i, l, r);
		return;
	}
	if(l > y || r < x) return;
	int m = (l + r) / 2;
	update(l, m, i * 2, x, y, val);
	update(m + 1, r, i * 2 + 1, x, y, val);
	d[i] = min(d[i * 2], d[i * 2 + 1]);
}

int get(int l, int r, int i, int x, int y) {
	pro(i, l, r);
	if(l >= x && r <= y) return d[i];
	if(l > y || r < x) return inf;
	int m = (l + r) / 2;
	return min(get(l, m, i * 2, x, y), get(m + 1, r, i * 2 + 1, x, y));
}

void go() {
	int n, m, q;
	cin >> n >> m >> q;
	for(int i = 1; i <= m; i++) {
		int ll, rr;
		cin >> ll >> rr;
		add[rr].pb(ll);
	}
	for(int i = 1; i <= q; i++) {
		cin >> l[i] >> r[i];
		qry[r[i]].pb(i);
	}
	for(int i = 1; i <= n; i++) {
		for(int ll : add[i]) {
			update(1, n, 1, ll, i, ll);
		}
		for(int id : qry[i]) {
			if(get(1, n, 1, l[id], r[id]) == l[id]) ans[id] = 1;
		}
	}
	for(int i = 1; i <= q; i++) {
		if(ans[i]) cout << "YES\n";
		else cout << "NO\n";
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29016 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Incorrect 6 ms 29020 KB Output isn't correct
4 Halted 0 ms 0 KB -