Submission #1136438

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136438		Shadow1	Inspections (NOI23_inspections)	C++20	0 / 100	0 ms	328 KiB

Main

// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define read_vector(v) for(auto &x : v){cin >> x;}
#define vt vector
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
// 
// 


const int INF = 1e15;
void solve() {
	int n, m, q;
	cin >> n >> m >> q;
	vector<int> prev(n+1), l(m+1), r(m+1), ps(m+1);
	for(int i=1; i<=m; ++i) {
		cin >> l[i] >> r[i];
		ps[i] = ps[i-1] + r[i] - l[i] + 1;
	}
	vector<pii> qry(q);
	vector<int> ans(q);
	for(int i=0; i<q; ++i) {
		cin >> qry[i].fir;
		qry[i].sec = i;
	}
	sort(all(qry));
	int base = 0;
	for(int i=1; i<=m; ++i) {
		for(int j=l[i]; j<=r[i]; ++j) {
			if(prev[j] == 0) {
				prev[j] = i;
				continue;
			}
			int s = ps[i-1] - ps[prev[j]] + r[prev[j]] - l[i];
			prev[j] = i;
			pii k = {s, INF};
			if(s >= qry[0].fir) base++;
			auto it = upper_bound(all(qry), k);
			if(it == qry.end()) continue;
			int x = it - qry.begin();
			ans[qry[x].sec]--;
		}
	}
	ans[0] = base;
	for(int i=1; i<q; ++i) {
		ans[i] += ans[i-1];
	}
	output_vector(ans);
}






// CHECK YOUR OVERFLOWS!!!! 
signed main() {
	// freopen("output.txt", "w", stdout);
	// freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(NULL); 
	int T = 1;
	// cin >> T;
	for(int tc = 1; tc <= T; ++tc) {
		// cout << "Case #" << tc << ": ";
		solve();
	}

	return 0;
}

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