oj.uz

답안 #929237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
929237 2024-02-18T04:05:05 Z ono_de206 Inspections (NOI23_inspections) C++14
100 / 100
 1681 ms 70932 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 = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int l[mxn], r[mxn], qry[mxn], pre[mxn];
map<int, int> mp;
vector<int> add[mxn], rem[mxn];
set<int> s;
int now, n;

int get(int le, int ri) {
	return pre[ri - 1] - pre[le] + r[le] - l[ri];
}

void insert(int id) {
	int le = -1, ri = -1;
	auto it = s.lower_bound(id);
	if(it != s.end()) ri = *it;
	if(it != s.begin()) le = *prev(it);
	if(le != -1 && ri != -1) {
		int x = get(le, ri);
		mp[-x] -= (n - now + 1);
	}
	if(le != -1) {
		int x = get(le, id);
		mp[-x] += (n - now + 1);
	}
	if(ri != -1) {
		int x = get(id, ri);
		mp[-x] += (n - now + 1);
	}
	s.in(id);
}

void erase(int id) {
	s.erase(id);
	int le = -1, ri = -1;
	auto it = s.lower_bound(id);
	if(it != s.end()) ri = *it;
	if(it != s.begin()) le = *prev(it);
	if(le != -1 && ri != -1) {
		int x = get(le, ri);
		mp[-x] += (n - now + 1);
	}
	if(le != -1) {
		int x = get(le, id);
		mp[-x] -= (n - now + 1);
	}
	if(ri != -1) {
		int x = get(id, ri);
		mp[-x] -= (n - now + 1);
	}
}

void go() {
	int m, q;
	cin >> n >> m >> q;
	for(int i = 1; i <= m; i++) {
		cin >> l[i] >> r[i];
		add[l[i]].eb(i);
		rem[r[i] + 1].eb(i);
	}
	for(int i = 1; i <= m; i++) {
		pre[i] = pre[i - 1] + (r[i] - l[i] + 1);
	}
	for(int i = 1; i <= n; i++) {
		now = i;
		for(int id : rem[i]) {
			erase(id);
		}
		for(int id : add[i]) {
			insert(id);
		}
		
	}
	for(int i = 1; i <= q; i++) {
		cin >> qry[i];
		mp[-qry[i]] += 0;
	}
	int ls = 0;
	for(auto &it : mp) {
		it.ss += ls;
		ls = it.ss;
	}
	for(int i = 1; i <= q; i++) {
		cout << mp[-qry[i]] << ' ';
	}
	cout << endl;
}

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

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 4 ms 15000 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 5 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14992 KB Output is correct
13 Correct 216 ms 29104 KB Output is correct
14 Correct 158 ms 27080 KB Output is correct
15 Correct 219 ms 28948 KB Output is correct
16 Correct 205 ms 29276 KB Output is correct
17 Correct 225 ms 29020 KB Output is correct
18 Correct 203 ms 28908 KB Output is correct
19 Correct 126 ms 22488 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 5 ms 14936 KB Output is correct
3 Correct 189 ms 27620 KB Output is correct
4 Correct 163 ms 28612 KB Output is correct
5 Correct 1004 ms 58432 KB Output is correct
6 Correct 938 ms 61992 KB Output is correct
7 Correct 485 ms 42524 KB Output is correct
8 Correct 3 ms 15192 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 4 ms 15000 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 5 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14992 KB Output is correct
13 Correct 216 ms 29104 KB Output is correct
14 Correct 158 ms 27080 KB Output is correct
15 Correct 219 ms 28948 KB Output is correct
16 Correct 205 ms 29276 KB Output is correct
17 Correct 225 ms 29020 KB Output is correct
18 Correct 203 ms 28908 KB Output is correct
19 Correct 126 ms 22488 KB Output is correct
20 Correct 191 ms 29996 KB Output is correct
21 Correct 136 ms 27080 KB Output is correct
22 Correct 200 ms 29764 KB Output is correct
23 Correct 235 ms 28536 KB Output is correct
24 Correct 209 ms 28304 KB Output is correct
25 Correct 220 ms 30404 KB Output is correct
26 Correct 128 ms 23780 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 4 ms 15000 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 5 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14992 KB Output is correct
13 Correct 216 ms 29104 KB Output is correct
14 Correct 158 ms 27080 KB Output is correct
15 Correct 219 ms 28948 KB Output is correct
16 Correct 205 ms 29276 KB Output is correct
17 Correct 225 ms 29020 KB Output is correct
18 Correct 203 ms 28908 KB Output is correct
19 Correct 126 ms 22488 KB Output is correct
20 Correct 2 ms 14936 KB Output is correct
21 Correct 5 ms 14936 KB Output is correct
22 Correct 189 ms 27620 KB Output is correct
23 Correct 163 ms 28612 KB Output is correct
24 Correct 1004 ms 58432 KB Output is correct
25 Correct 938 ms 61992 KB Output is correct
26 Correct 485 ms 42524 KB Output is correct
27 Correct 3 ms 15192 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 191 ms 29996 KB Output is correct
30 Correct 136 ms 27080 KB Output is correct
31 Correct 200 ms 29764 KB Output is correct
32 Correct 235 ms 28536 KB Output is correct
33 Correct 209 ms 28304 KB Output is correct
34 Correct 220 ms 30404 KB Output is correct
35 Correct 128 ms 23780 KB Output is correct
36 Correct 1179 ms 46076 KB Output is correct
37 Correct 1681 ms 69616 KB Output is correct
38 Correct 1279 ms 70004 KB Output is correct
39 Correct 293 ms 37424 KB Output is correct
40 Correct 867 ms 70216 KB Output is correct
41 Correct 686 ms 69408 KB Output is correct
42 Correct 617 ms 68560 KB Output is correct
43 Correct 625 ms 55744 KB Output is correct
44 Correct 480 ms 55732 KB Output is correct
45 Correct 919 ms 65616 KB Output is correct
46 Correct 887 ms 58612 KB Output is correct
47 Correct 673 ms 63880 KB Output is correct
48 Correct 1422 ms 70932 KB Output is correct