oj.uz

답안 #954535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954535 2024-03-28T06:16:55 Z ono_de206 Curtains (NOI23_curtains) C++14
60 / 100
 912 ms 79612 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> g[mxn], qr[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(lz[i * 2], lz[i]);
		mxx(lz[i * 2 + 1], lz[i]);
	}
	lz[i] = 0;
}

void update(int l, int r, int i, int x, int y, int c) {
	pro(i, l, r);
	if(l >= x && r <= y) {
		mxx(lz[i], c);
		pro(i, l, r);
		return;
	}
	if(l > y || r < x) return;
	int m = (l + r) / 2;
	update(l, m, i * 2, x, y, c);
	update(m + 1, r, i * 2 + 1, x, y, c);
	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 x, y;
		cin >> x >> y;
		g[y].pb(x);
	}
	for(int i = 1; i <= q; i++) {
		cin >> l[i] >> r[i];
		qr[r[i]].pb(i);
	}
	for(int i = 1; i <= n; i++) {
		for(int x : g[i]) {
			update(1, n, 1, x, i, x);
		}
		for(int id : qr[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
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 6 ms 29128 KB Output is correct
4 Correct 6 ms 29016 KB Output is correct
5 Correct 7 ms 29020 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 8 ms 29020 KB Output is correct
8 Correct 6 ms 29128 KB Output is correct
9 Correct 7 ms 29020 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 6 ms 29128 KB Output is correct
4 Correct 6 ms 29016 KB Output is correct
5 Correct 7 ms 29020 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 8 ms 29020 KB Output is correct
8 Correct 6 ms 29128 KB Output is correct
9 Correct 7 ms 29020 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 8 ms 29112 KB Output is correct
15 Correct 8 ms 29276 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29276 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 7 ms 29276 KB Output is correct
20 Correct 8 ms 29276 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 6 ms 29128 KB Output is correct
4 Correct 6 ms 29016 KB Output is correct
5 Correct 7 ms 29020 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 8 ms 29020 KB Output is correct
8 Correct 6 ms 29128 KB Output is correct
9 Correct 7 ms 29020 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 8 ms 29112 KB Output is correct
15 Correct 8 ms 29276 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29276 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 7 ms 29276 KB Output is correct
20 Correct 8 ms 29276 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 219 ms 43876 KB Output is correct
23 Correct 211 ms 44112 KB Output is correct
24 Correct 258 ms 45396 KB Output is correct
25 Correct 453 ms 49688 KB Output is correct
26 Correct 232 ms 44096 KB Output is correct
27 Correct 427 ms 49748 KB Output is correct
28 Correct 495 ms 49676 KB Output is correct
29 Correct 191 ms 43100 KB Output is correct
30 Correct 138 ms 44160 KB Output is correct
31 Correct 150 ms 45232 KB Output is correct
32 Correct 364 ms 49756 KB Output is correct
33 Correct 130 ms 44384 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 6 ms 29020 KB Output is correct
3 Correct 7 ms 29016 KB Output is correct
4 Correct 6 ms 29020 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 7 ms 29276 KB Output is correct
7 Correct 7 ms 29276 KB Output is correct
8 Correct 151 ms 44372 KB Output is correct
9 Correct 149 ms 44884 KB Output is correct
10 Correct 358 ms 49980 KB Output is correct
11 Correct 137 ms 44368 KB Output is correct
12 Correct 137 ms 38568 KB Output is correct
13 Correct 127 ms 38624 KB Output is correct
14 Correct 92 ms 38484 KB Output is correct
15 Correct 89 ms 38228 KB Output is correct
16 Correct 101 ms 38484 KB Output is correct
17 Correct 92 ms 38292 KB Output is correct
18 Correct 912 ms 79440 KB Output is correct
19 Incorrect 887 ms 79612 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 6 ms 29128 KB Output is correct
4 Correct 6 ms 29016 KB Output is correct
5 Correct 7 ms 29020 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 8 ms 29020 KB Output is correct
8 Correct 6 ms 29128 KB Output is correct
9 Correct 7 ms 29020 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 8 ms 29112 KB Output is correct
15 Correct 8 ms 29276 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29276 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 7 ms 29276 KB Output is correct
20 Correct 8 ms 29276 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 120 ms 32596 KB Output is correct
23 Correct 116 ms 32788 KB Output is correct
24 Correct 162 ms 37332 KB Output is correct
25 Correct 160 ms 37460 KB Output is correct
26 Correct 109 ms 39036 KB Output is correct
27 Correct 112 ms 38484 KB Output is correct
28 Correct 87 ms 37848 KB Output is correct
29 Correct 105 ms 38736 KB Output is correct
30 Correct 185 ms 37524 KB Output is correct
31 Correct 164 ms 37604 KB Output is correct
32 Correct 153 ms 38020 KB Output is correct
33 Correct 129 ms 37968 KB Output is correct
34 Correct 144 ms 37968 KB Output is correct
35 Correct 141 ms 37380 KB Output is correct
36 Correct 127 ms 37928 KB Output is correct
37 Correct 133 ms 38668 KB Output is correct
38 Correct 127 ms 38520 KB Output is correct
39 Correct 97 ms 38636 KB Output is correct
40 Correct 97 ms 38224 KB Output is correct
41 Correct 93 ms 38480 KB Output is correct
42 Correct 106 ms 38228 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 6 ms 29128 KB Output is correct
4 Correct 6 ms 29016 KB Output is correct
5 Correct 7 ms 29020 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 8 ms 29020 KB Output is correct
8 Correct 6 ms 29128 KB Output is correct
9 Correct 7 ms 29020 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 8 ms 29112 KB Output is correct
15 Correct 8 ms 29276 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29276 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 7 ms 29276 KB Output is correct
20 Correct 8 ms 29276 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 219 ms 43876 KB Output is correct
23 Correct 211 ms 44112 KB Output is correct
24 Correct 258 ms 45396 KB Output is correct
25 Correct 453 ms 49688 KB Output is correct
26 Correct 232 ms 44096 KB Output is correct
27 Correct 427 ms 49748 KB Output is correct
28 Correct 495 ms 49676 KB Output is correct
29 Correct 191 ms 43100 KB Output is correct
30 Correct 138 ms 44160 KB Output is correct
31 Correct 150 ms 45232 KB Output is correct
32 Correct 364 ms 49756 KB Output is correct
33 Correct 130 ms 44384 KB Output is correct
34 Correct 6 ms 29016 KB Output is correct
35 Correct 6 ms 29020 KB Output is correct
36 Correct 7 ms 29016 KB Output is correct
37 Correct 6 ms 29020 KB Output is correct
38 Correct 9 ms 29276 KB Output is correct
39 Correct 7 ms 29276 KB Output is correct
40 Correct 7 ms 29276 KB Output is correct
41 Correct 151 ms 44372 KB Output is correct
42 Correct 149 ms 44884 KB Output is correct
43 Correct 358 ms 49980 KB Output is correct
44 Correct 137 ms 44368 KB Output is correct
45 Correct 137 ms 38568 KB Output is correct
46 Correct 127 ms 38624 KB Output is correct
47 Correct 92 ms 38484 KB Output is correct
48 Correct 89 ms 38228 KB Output is correct
49 Correct 101 ms 38484 KB Output is correct
50 Correct 92 ms 38292 KB Output is correct
51 Correct 912 ms 79440 KB Output is correct
52 Incorrect 887 ms 79612 KB Output isn't correct
53 Halted 0 ms 0 KB -