oj.uz

답안 #954637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954637 2024-03-28T09:15:39 Z ono_de206 Curtains (NOI23_curtains) C++14
100 / 100
 1151 ms 92264 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 + 10, 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 6 ms 29016 KB Output is correct
2 Correct 7 ms 29020 KB Output is correct
3 Correct 7 ms 29132 KB Output is correct
4 Correct 7 ms 29020 KB Output is correct
5 Correct 7 ms 29180 KB Output is correct
6 Correct 7 ms 29020 KB Output is correct
7 Correct 6 ms 29020 KB Output is correct
8 Correct 7 ms 29020 KB Output is correct
9 Correct 7 ms 29016 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 7 ms 29020 KB Output is correct

Subtask #2
6.0 / 6.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 7 ms 29020 KB Output is correct
3 Correct 7 ms 29132 KB Output is correct
4 Correct 7 ms 29020 KB Output is correct
5 Correct 7 ms 29180 KB Output is correct
6 Correct 7 ms 29020 KB Output is correct
7 Correct 6 ms 29020 KB Output is correct
8 Correct 7 ms 29020 KB Output is correct
9 Correct 7 ms 29016 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 7 ms 29020 KB Output is correct
13 Correct 9 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 8 ms 29364 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29396 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 8 ms 29276 KB Output is correct
20 Correct 8 ms 29412 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 203 ms 48232 KB Output is correct
23 Correct 208 ms 48552 KB Output is correct
24 Correct 264 ms 50492 KB Output is correct
25 Correct 422 ms 58540 KB Output is correct
26 Correct 202 ms 48464 KB Output is correct
27 Correct 444 ms 58448 KB Output is correct
28 Correct 473 ms 58356 KB Output is correct
29 Correct 179 ms 47276 KB Output is correct
30 Correct 142 ms 47516 KB Output is correct
31 Correct 210 ms 48396 KB Output is correct
32 Correct 380 ms 57240 KB Output is correct
33 Correct 144 ms 47504 KB Output is correct

Subtask #4
20.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 8 ms 29388 KB Output is correct
6 Correct 8 ms 29276 KB Output is correct
7 Correct 8 ms 29276 KB Output is correct
8 Correct 132 ms 47448 KB Output is correct
9 Correct 163 ms 48400 KB Output is correct
10 Correct 374 ms 57464 KB Output is correct
11 Correct 163 ms 47700 KB Output is correct
12 Correct 143 ms 40532 KB Output is correct
13 Correct 130 ms 40644 KB Output is correct
14 Correct 91 ms 40588 KB Output is correct
15 Correct 89 ms 40084 KB Output is correct
16 Correct 90 ms 40364 KB Output is correct
17 Correct 93 ms 40136 KB Output is correct
18 Correct 869 ms 90584 KB Output is correct
19 Correct 875 ms 90496 KB Output is correct
20 Correct 622 ms 91720 KB Output is correct
21 Correct 595 ms 89172 KB Output is correct
22 Correct 587 ms 90452 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 7 ms 29020 KB Output is correct
3 Correct 7 ms 29132 KB Output is correct
4 Correct 7 ms 29020 KB Output is correct
5 Correct 7 ms 29180 KB Output is correct
6 Correct 7 ms 29020 KB Output is correct
7 Correct 6 ms 29020 KB Output is correct
8 Correct 7 ms 29020 KB Output is correct
9 Correct 7 ms 29016 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 7 ms 29020 KB Output is correct
13 Correct 9 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 8 ms 29364 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29396 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 8 ms 29276 KB Output is correct
20 Correct 8 ms 29412 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 115 ms 34644 KB Output is correct
23 Correct 122 ms 34716 KB Output is correct
24 Correct 158 ms 39660 KB Output is correct
25 Correct 167 ms 39840 KB Output is correct
26 Correct 128 ms 41460 KB Output is correct
27 Correct 113 ms 40784 KB Output is correct
28 Correct 91 ms 39672 KB Output is correct
29 Correct 103 ms 41044 KB Output is correct
30 Correct 170 ms 39764 KB Output is correct
31 Correct 160 ms 39684 KB Output is correct
32 Correct 137 ms 40132 KB Output is correct
33 Correct 138 ms 40396 KB Output is correct
34 Correct 143 ms 40320 KB Output is correct
35 Correct 141 ms 39820 KB Output is correct
36 Correct 129 ms 40016 KB Output is correct
37 Correct 133 ms 40532 KB Output is correct
38 Correct 128 ms 40484 KB Output is correct
39 Correct 94 ms 40404 KB Output is correct
40 Correct 88 ms 40272 KB Output is correct
41 Correct 95 ms 40320 KB Output is correct
42 Correct 92 ms 40152 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 7 ms 29020 KB Output is correct
3 Correct 7 ms 29132 KB Output is correct
4 Correct 7 ms 29020 KB Output is correct
5 Correct 7 ms 29180 KB Output is correct
6 Correct 7 ms 29020 KB Output is correct
7 Correct 6 ms 29020 KB Output is correct
8 Correct 7 ms 29020 KB Output is correct
9 Correct 7 ms 29016 KB Output is correct
10 Correct 7 ms 29020 KB Output is correct
11 Correct 7 ms 29020 KB Output is correct
12 Correct 7 ms 29020 KB Output is correct
13 Correct 9 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 8 ms 29364 KB Output is correct
16 Correct 8 ms 29276 KB Output is correct
17 Correct 8 ms 29396 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 8 ms 29276 KB Output is correct
20 Correct 8 ms 29412 KB Output is correct
21 Correct 8 ms 29276 KB Output is correct
22 Correct 203 ms 48232 KB Output is correct
23 Correct 208 ms 48552 KB Output is correct
24 Correct 264 ms 50492 KB Output is correct
25 Correct 422 ms 58540 KB Output is correct
26 Correct 202 ms 48464 KB Output is correct
27 Correct 444 ms 58448 KB Output is correct
28 Correct 473 ms 58356 KB Output is correct
29 Correct 179 ms 47276 KB Output is correct
30 Correct 142 ms 47516 KB Output is correct
31 Correct 210 ms 48396 KB Output is correct
32 Correct 380 ms 57240 KB Output is correct
33 Correct 144 ms 47504 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 8 ms 29388 KB Output is correct
39 Correct 8 ms 29276 KB Output is correct
40 Correct 8 ms 29276 KB Output is correct
41 Correct 132 ms 47448 KB Output is correct
42 Correct 163 ms 48400 KB Output is correct
43 Correct 374 ms 57464 KB Output is correct
44 Correct 163 ms 47700 KB Output is correct
45 Correct 143 ms 40532 KB Output is correct
46 Correct 130 ms 40644 KB Output is correct
47 Correct 91 ms 40588 KB Output is correct
48 Correct 89 ms 40084 KB Output is correct
49 Correct 90 ms 40364 KB Output is correct
50 Correct 93 ms 40136 KB Output is correct
51 Correct 869 ms 90584 KB Output is correct
52 Correct 875 ms 90496 KB Output is correct
53 Correct 622 ms 91720 KB Output is correct
54 Correct 595 ms 89172 KB Output is correct
55 Correct 587 ms 90452 KB Output is correct
56 Correct 115 ms 34644 KB Output is correct
57 Correct 122 ms 34716 KB Output is correct
58 Correct 158 ms 39660 KB Output is correct
59 Correct 167 ms 39840 KB Output is correct
60 Correct 128 ms 41460 KB Output is correct
61 Correct 113 ms 40784 KB Output is correct
62 Correct 91 ms 39672 KB Output is correct
63 Correct 103 ms 41044 KB Output is correct
64 Correct 170 ms 39764 KB Output is correct
65 Correct 160 ms 39684 KB Output is correct
66 Correct 137 ms 40132 KB Output is correct
67 Correct 138 ms 40396 KB Output is correct
68 Correct 143 ms 40320 KB Output is correct
69 Correct 141 ms 39820 KB Output is correct
70 Correct 129 ms 40016 KB Output is correct
71 Correct 133 ms 40532 KB Output is correct
72 Correct 128 ms 40484 KB Output is correct
73 Correct 94 ms 40404 KB Output is correct
74 Correct 88 ms 40272 KB Output is correct
75 Correct 95 ms 40320 KB Output is correct
76 Correct 92 ms 40152 KB Output is correct
77 Correct 1124 ms 88424 KB Output is correct
78 Correct 1109 ms 87156 KB Output is correct
79 Correct 789 ms 91800 KB Output is correct
80 Correct 800 ms 92264 KB Output is correct
81 Correct 749 ms 90184 KB Output is correct
82 Correct 727 ms 90708 KB Output is correct
83 Correct 1101 ms 88096 KB Output is correct
84 Correct 1151 ms 87016 KB Output is correct
85 Correct 982 ms 89684 KB Output is correct
86 Correct 879 ms 86688 KB Output is correct
87 Correct 880 ms 86700 KB Output is correct
88 Correct 808 ms 91984 KB Output is correct