제출 #1312388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312388		sakuda00	Inspections (NOI23_inspections)	C++20	0 / 100	1 ms	572 KiB

Main

#include <iostream>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <unordered_map>
using namespace std;
using ll = long long;
int left(int v, set<int>& st) {
	auto itr = st.lower_bound(v);
	if (itr == st.begin()) return -1;
	itr--;
	return (*itr);
}
int right(int v, set<int>& st) {
	auto itr = st.upper_bound(v);
	if (itr == st.end()) return -1;
	return (*itr);
}
ll dis(int x, int y, vector<ll>& S, vector<int>& L, vector<int>& R) {
	ll s = (y == 0 ? 0 : S[y - 1]) - S[x];
	return s-L[y]+R[x];
}
int sear(ll x, vector<ll>& value) {
	auto itr = lower_bound(value.begin(),value.end(), x);
	itr--;
	return (itr - value.begin());
}
int main() {
	int N, M, Q;cin >> N >> M >> Q;
	vector<int> L(M), R(M);
	vector<vector<int>> IN(N + 1), OUT(N + 2);
	for (int i = 0;i < M;i++) {
		cin >> L[i] >> R[i];
		IN[L[i]].push_back(i);
		OUT[R[i] + 1].push_back(i);
	}
	vector<ll> S(M);
	ll sm = 0;
	for (int i = 0;i < M;i++) {
		sm += (R[i] - L[i] + 1);
		S[i] = sm;
	}
	set<int> id;
	map<pair<int, int>, ll> pls;
	vector<ll> QRY(Q);
	vector<ll> value = {-(1LL << 60)};
	for (int i = 0;i < Q;i++) {
		cin >> QRY[i];
		value.push_back(QRY[i]);
	}
	sort(value.begin(), value.end());
	value.erase(unique(value.begin(),value.end()), value.end());
	int T = value.size();
	vector<ll> res(T + 1, 0);
	for (int i = 1;i <= N;i++) {
		//cout << i << endl;
		for (auto v : IN[i]) {
			if (id.find(v) != id.end()) continue;
			int lid = left(v, id);
			int rid = right(v, id);

			if (lid != -1 and rid != -1) {
			//	cout << "ERR " << lid << " " << rid << " " << dis(lid, rid, S, L, R) << endl;
				ll d=  dis(lid, rid, S, L, R);
				res[0] -= N - i + 1;
				res[sear(d, value) + 1] += N - i + 1;
			}
			if (lid != -1) {
				//cout <<"AD " << i << " " <<  lid << " " << v << " " << dis(lid, v, S, L, R) << endl;
				pls[{lid, v}] = i;
				ll d = dis(lid, v, S, L, R);
				res[0] += N - i + 1;
				res[sear(d, value) + 1] -= N - i + 1;
			} 
			if (rid != -1) {
				
				//cout << "ADR " << i << " " << rid << " " << v << " " << dis(v, rid, S, L, R) << endl;
				pls[{v, rid}] = i;
				res[0] += N - i + 1;
				ll d = dis(v, rid, S, L,R);
				res[sear(d, value) + 1] -= N - i + 1;
			}
			id.insert(v);

		}
		for (auto v : OUT[i]) {
			if (id.find(v) == id.end()) continue;
			int lid = left(v, id);
			if (lid != -1) {
			//	cout << lid << " " << v << " " << dis(lid, v, S, L, R) << endl;
				pls[{lid, v}] = i;
				ll d = dis(lid, v, S, L, R);
				res[0] -= N - i + 1;
				res[sear(d, value) + 1] += N - i + 1;
			} 
			int rid = right(v, id);
			if (rid != -1) {
			//	cout << rid << " " << v << " " << dis(v, rid, S, L, R) << endl;
				pls[{v, rid}] = i;
				res[0] -= N - i + 1;
				ll d = dis(v, rid, S, L,R);
				res[sear(d, value) + 1] += N - i + 1;
			}
			id.erase(v);
		}
	//	cout <<"RG" << endl;
		//for (auto v : id) cout <<v + 1 << " ";
		cout << endl;
	}

	sm = 0;
	for (int i = 0;i <= T;i++) {
		sm += res[i];
		res[i] = sm;
	}
	for (int i = 0;i < Q;i++) {
		int id = sear(QRY[i], value);
		cout << res[id] << " ";
	}
	cout << endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 23