Submission #471697

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
471697	2021-09-10 10:47:35	prvocislo	Examination (JOI19_examination)	C++17	100 / 100	612 ms	16172 KiB

examination

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 <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
typedef long long ll;
using namespace std;
const int maxn = 1e5 + 5;
struct ev { int a, b, c, qu, i; };
bool cmpa(const ev& a, const ev& b) { return a.a == b.a ? a.qu > b.qu : a.a < b.a; }
bool cmpb(const ev& a, const ev& b) { return a.b == b.b ? a.qu > b.qu : a.b < b.b; }
int ans[maxn];
void solve_bc(const vector<ev>& v, int l, int r)
{
  if (l >= r) return;
  int m = (l + r) / 2;
  vector<int> c;
  for (int i = m + 1; i <= r; i++)
    if (!v[i].qu) c.push_back(v[i].c);
  sort(c.begin(), c.end());
  for (int i = l; i <= m; i++)
    if (v[i].qu) ans[v[i].i] += c.end() - lower_bound(c.begin(), c.end(), v[i].c);
  solve_bc(v, l, m);
  solve_bc(v, m + 1, r);
}
void solve_abc(const vector<ev>& v, int l, int r)
{
  if (l >= r) return;
  int m = (l + r) / 2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 57 / 57