Submission #983335

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
983335	2024-05-15 10:24:16	vjudge1	New Home (APIO18_new_home)	C++17	12 / 100	5087 ms	89292 KiB

new_home

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k, q, i, j, l, y, cur, x[300001], t[300001], a[300001], b[300001], ans[300001];
vector<pair<pair<int, int>, pair<int, int>>> v, g[300001];
multiset<int> ms[300001];
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  #ifdef LOCAL
  freopen("input.txt", "r", stdin);
  #endif
  cin >> n >> k >> q;
  for (i = 1; i <= n; i++) {
    cin >> x[i] >> t[i] >> a[i] >> b[i];
    //g[t[i]].push_back({{a[i], b[i]}, x[i]});
    v.push_back({{a[i], -1}, {x[i], t[i]}});
    v.push_back({{b[i], q + 1}, {x[i], t[i]}});
  }
  for (i = 1; i <= k; i++) sort(g[i].begin(), g[i].end());
  for (i = 0; i < q; i++) {
    cin >> l >> y;
    v.push_back({{y, i}, {l, -1}});
  }
  sort(v.begin(), v.end());
  for (auto w : v) {
    if (w.first.second == -1) ms[w.second.second].insert(w.second.first);
    else if (w.first.second == q + 1) ms[w.second.second].erase(ms[w.second.second].find(w.second.first));
    else {
      y = w.first.first, l = w.second.first;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20