Submission #260515

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
260515	2020-08-10 12:32:44	islingr	Street Lamps (APIO19_street_lamps)	C++17	100 / 100	3501 ms	55268 KiB

street_lamps

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;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
const int N = 1 << 19;
struct { int l, r, t, del; } a[3 * N], b[3 * N];
int q, ans[N];
void cdq2(int l, int r) {
  if (r - l == 1) return;
  int m = (l + r) >> 1;
  cdq2(l, m); cdq2(m, r);
  rep(i, l, r) b[i].r = i < m;
  inplace_merge(b + l, b + m, b + r, [&](const auto &a, const auto &b) { return a.t < b.t; });
  int s = 0;
  rep(i, l, r) {
    if (b[i].del && b[i].l && b[i].r) s += b[i].del * b[i].t;
    if (!b[i].del && !b[i].l && !b[i].r) ans[b[i].t] += s;
  }
}
void cdq1(int l, int r) {
  if (r - l == 1) return;
  int m = (l + r) >> 1;
  cdq1(l, m); cdq1(m, r);
  rep(i, l, r) a[i].l = i < m;
  merge(a + l, a + m, a + m, a + r, b + l, [&](const auto &a, const auto &b) { return pair(a.r, a.del & 1) > pair(b.r, b.del & 1); });
  rep(i, l, r) a[i] = b[i];
  cdq2(l, r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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