oj.uz

답안 #954531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954531 2024-03-28T06:13:40 Z ono_de206 Curtains (NOI23_curtains) C++14
60 / 100
 1026 ms 152176 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], lz[mxn];

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 10 ms 31068 KB Output is correct
2 Correct 7 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 8 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 8 ms 31068 KB Output is correct
9 Correct 7 ms 31068 KB Output is correct
10 Correct 12 ms 31176 KB Output is correct
11 Correct 7 ms 31068 KB Output is correct
12 Correct 6 ms 31188 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 31068 KB Output is correct
2 Correct 7 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 8 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 8 ms 31068 KB Output is correct
9 Correct 7 ms 31068 KB Output is correct
10 Correct 12 ms 31176 KB Output is correct
11 Correct 7 ms 31068 KB Output is correct
12 Correct 6 ms 31188 KB Output is correct
13 Correct 10 ms 31424 KB Output is correct
14 Correct 9 ms 31324 KB Output is correct
15 Correct 8 ms 31324 KB Output is correct
16 Correct 9 ms 31320 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 8 ms 31408 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 10 ms 31420 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 31068 KB Output is correct
2 Correct 7 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 8 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 8 ms 31068 KB Output is correct
9 Correct 7 ms 31068 KB Output is correct
10 Correct 12 ms 31176 KB Output is correct
11 Correct 7 ms 31068 KB Output is correct
12 Correct 6 ms 31188 KB Output is correct
13 Correct 10 ms 31424 KB Output is correct
14 Correct 9 ms 31324 KB Output is correct
15 Correct 8 ms 31324 KB Output is correct
16 Correct 9 ms 31320 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 8 ms 31408 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 10 ms 31420 KB Output is correct
22 Correct 192 ms 49276 KB Output is correct
23 Correct 214 ms 49744 KB Output is correct
24 Correct 309 ms 51796 KB Output is correct
25 Correct 442 ms 59524 KB Output is correct
26 Correct 212 ms 49384 KB Output is correct
27 Correct 428 ms 59728 KB Output is correct
28 Correct 428 ms 59852 KB Output is correct
29 Correct 179 ms 48464 KB Output is correct
30 Correct 127 ms 48548 KB Output is correct
31 Correct 154 ms 49744 KB Output is correct
32 Correct 353 ms 58500 KB Output is correct
33 Correct 125 ms 48664 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31252 KB Output is correct
2 Correct 7 ms 31168 KB Output is correct
3 Correct 6 ms 31068 KB Output is correct
4 Correct 6 ms 31068 KB Output is correct
5 Correct 8 ms 31324 KB Output is correct
6 Correct 9 ms 31324 KB Output is correct
7 Correct 8 ms 31328 KB Output is correct
8 Correct 134 ms 48600 KB Output is correct
9 Correct 159 ms 49744 KB Output is correct
10 Correct 349 ms 58384 KB Output is correct
11 Correct 151 ms 48632 KB Output is correct
12 Correct 141 ms 44916 KB Output is correct
13 Correct 138 ms 44624 KB Output is correct
14 Correct 107 ms 46164 KB Output is correct
15 Correct 108 ms 44368 KB Output is correct
16 Correct 97 ms 44628 KB Output is correct
17 Correct 98 ms 45860 KB Output is correct
18 Runtime error 1026 ms 152176 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 31068 KB Output is correct
2 Correct 7 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 8 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 8 ms 31068 KB Output is correct
9 Correct 7 ms 31068 KB Output is correct
10 Correct 12 ms 31176 KB Output is correct
11 Correct 7 ms 31068 KB Output is correct
12 Correct 6 ms 31188 KB Output is correct
13 Correct 10 ms 31424 KB Output is correct
14 Correct 9 ms 31324 KB Output is correct
15 Correct 8 ms 31324 KB Output is correct
16 Correct 9 ms 31320 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 8 ms 31408 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 10 ms 31420 KB Output is correct
22 Correct 118 ms 38580 KB Output is correct
23 Correct 125 ms 38788 KB Output is correct
24 Correct 165 ms 45544 KB Output is correct
25 Correct 170 ms 43940 KB Output is correct
26 Correct 152 ms 46156 KB Output is correct
27 Correct 116 ms 44884 KB Output is correct
28 Correct 99 ms 44440 KB Output is correct
29 Correct 104 ms 45648 KB Output is correct
30 Correct 177 ms 43844 KB Output is correct
31 Correct 162 ms 43856 KB Output is correct
32 Correct 167 ms 45856 KB Output is correct
33 Correct 163 ms 46532 KB Output is correct
34 Correct 139 ms 45144 KB Output is correct
35 Correct 152 ms 45512 KB Output is correct
36 Correct 133 ms 45848 KB Output is correct
37 Correct 156 ms 44768 KB Output is correct
38 Correct 128 ms 44624 KB Output is correct
39 Correct 94 ms 46160 KB Output is correct
40 Correct 97 ms 44424 KB Output is correct
41 Correct 94 ms 44612 KB Output is correct
42 Correct 94 ms 45908 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 31068 KB Output is correct
2 Correct 7 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 8 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 8 ms 31068 KB Output is correct
9 Correct 7 ms 31068 KB Output is correct
10 Correct 12 ms 31176 KB Output is correct
11 Correct 7 ms 31068 KB Output is correct
12 Correct 6 ms 31188 KB Output is correct
13 Correct 10 ms 31424 KB Output is correct
14 Correct 9 ms 31324 KB Output is correct
15 Correct 8 ms 31324 KB Output is correct
16 Correct 9 ms 31320 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 8 ms 31408 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 10 ms 31420 KB Output is correct
22 Correct 192 ms 49276 KB Output is correct
23 Correct 214 ms 49744 KB Output is correct
24 Correct 309 ms 51796 KB Output is correct
25 Correct 442 ms 59524 KB Output is correct
26 Correct 212 ms 49384 KB Output is correct
27 Correct 428 ms 59728 KB Output is correct
28 Correct 428 ms 59852 KB Output is correct
29 Correct 179 ms 48464 KB Output is correct
30 Correct 127 ms 48548 KB Output is correct
31 Correct 154 ms 49744 KB Output is correct
32 Correct 353 ms 58500 KB Output is correct
33 Correct 125 ms 48664 KB Output is correct
34 Correct 6 ms 31252 KB Output is correct
35 Correct 7 ms 31168 KB Output is correct
36 Correct 6 ms 31068 KB Output is correct
37 Correct 6 ms 31068 KB Output is correct
38 Correct 8 ms 31324 KB Output is correct
39 Correct 9 ms 31324 KB Output is correct
40 Correct 8 ms 31328 KB Output is correct
41 Correct 134 ms 48600 KB Output is correct
42 Correct 159 ms 49744 KB Output is correct
43 Correct 349 ms 58384 KB Output is correct
44 Correct 151 ms 48632 KB Output is correct
45 Correct 141 ms 44916 KB Output is correct
46 Correct 138 ms 44624 KB Output is correct
47 Correct 107 ms 46164 KB Output is correct
48 Correct 108 ms 44368 KB Output is correct
49 Correct 97 ms 44628 KB Output is correct
50 Correct 98 ms 45860 KB Output is correct
51 Runtime error 1026 ms 152176 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -