Submission #854362

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
854362	2023-09-27 05:40:05	clonemaasteruwu	Plahte (COCI17_plahte)	C++17	160 / 160	159 ms	20764 KiB

plahte

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>
using namespace std;
using ll = long long;
//corner case
//emplace >> default constructor
void solve() {
  int n,m;cin >> n >> m;
  vector<tuple<int,int,int,int,int,int>> event;
  event.reserve(n+m);
  vector<int> y_comp;
  y_comp.reserve(2*n+m);
  for(int i=0;i<n;i++) {
  int x1,y1,x2,y2;
  cin >> x1 >> y1 >> x2 >> y2;
  event.emplace_back(x1,y1,x2,y2,0,i);
  y_comp.push_back(y1), y_comp.push_back(y2);
  }
  for(int i=0;i<m;i++){
  int x,y,k;cin >> x >> y >> k;
  event.emplace_back(x,INT_MAX,y,k,1,0);
  y_comp.push_back(y);
  }
  sort(y_comp.begin(), y_comp.end());
  int tn = unique(y_comp.begin(), y_comp.end()) - y_comp.begin();
  y_comp.resize(tn);
  auto get_yid = [&](int y){
  return lower_bound(y_comp.begin(),y_comp.end(),y) - y_comp.begin();
  };
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 32 / 32
• Subtask 2: 32 / 32
• Subtask 3: 32 / 32
• Subtask 4: 32 / 32
• Subtask 5: 32 / 32