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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
| #include "pch.h"
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#define LL long long
#define MAXK (32 + 5)
#define MAXN (500000 + 5)
#define INF (0x7fffffff)
#define pii pair<LL, LL>
#define LS(dq) ((dq) << 1)
#define RS(dq) (((dq) << 1) | 1)
using namespace std;
struct node
{
int le, ri, zh, lazy;
}b[MAXN << 2];
int n;
LL sora[MAXN << 1];
vector<int> cov;
pii a[MAXN];
void push_up(int dq)
{
if (b[LS(dq)].zh == b[RS(dq)].zh) b[dq].zh = b[LS(dq)].zh;
else b[dq].zh = -1;
}
void push_down(int dq)
{
b[LS(dq)].zh = b[RS(dq)].zh = b[LS(dq)].lazy = b[RS(dq)].lazy = b[dq].lazy;
b[dq].lazy = 0;
}
void js(int dq, int le, int ri)
{
b[dq].zh = 0, b[dq].le = le, b[dq].ri = ri, b[dq].lazy = 0;
if (le == ri) return;
int mi = (le + ri) >> 1;
js(LS(dq), le, mi);
js(RS(dq), mi + 1, ri);
}
int cx(int dq, int wz)
{
if (b[dq].le == b[dq].ri)
return b[dq].zh;
int mi = (b[dq].le + b[dq].ri) >> 1;
if (b[dq].lazy)
push_down(dq);
if (wz > mi)
return cx(RS(dq), wz);
return cx(LS(dq), wz);
}
void xg(int dq, int le, int ri, int zh)
{
if (b[dq].le == le && b[dq].ri == ri)
{
b[dq].zh = b[dq].lazy = zh;
return;
}
int mi = (b[dq].le + b[dq].ri) >> 1;
if (b[dq].lazy)
push_down(dq);
if (le > mi)
xg(RS(dq), le, ri, zh);
else if (ri <= mi)
xg(LS(dq), le, ri, zh);
else
xg(LS(dq), le, mi, zh), xg(RS(dq), mi + 1, ri, zh);
push_up(dq);
}
void cx2(int dq, int le, int ri)
{
if (b[dq].zh && b[dq].zh != -1)
{
cov.push_back(b[dq].zh);
return;
}
if (b[dq].le == b[dq].ri)
return;
int mi = (b[dq].le + b[dq].ri) >> 1;
if (b[dq].lazy)
push_down(dq);
if (le > mi)
cx2(RS(dq), le, ri);
else if (ri <= mi)
cx2(LS(dq), le, ri);
else
{
if (b[LS(dq)].zh)
cx2(LS(dq), le, mi);
if (b[RS(dq)].zh)
cx2(RS(dq), mi + 1, ri);
}
}
bool is1(LL x)
{
int re = 0;
for (int i = 32; i >= 0; i--)
if (x & (1 << i))
++re;
return (re & 1);
}
LL cal(LL x)
{
if (x & 1)
return (x + 1) >> 1;
else
return (x >> 1) + is1(x);
}
LL cal1(int i)
{
return (cal(sora[a[i].second]) - cal(sora[a[i].first] - 1));
}
LL cal0(int i)
{
return (sora[a[i].second] - sora[a[i].first] + 1) - cal1(i);
}
void solve()
{
a[0].first = INF, a[0].second = -INF;
js(1, 1, sora[0]);
LL ans1 = 0, ans0 = 0;
for (int i = 1; i <= n; i++)
{
int left = min(a[i].first, a[cx(1, a[i].first)].first), right = max(a[i].second, a[cx(1, a[i].second)].second);
cov.clear();
cx2(1, left, right);
sort(cov.begin(), cov.end());
cov.erase(unique(cov.begin(), cov.end()), cov.end());
for (int j = 0; j < cov.size(); j++)
ans1 -= cal1(cov[j]), ans0 -= cal0(cov[j]);
xg(1, left, right, i);
a[i].first = left, a[i].second = right;
ans1 += cal1(i), ans0 += cal0(i);
printf("%lld\n", ans0 * ans1);
}
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld%lld", &a[i].first, &a[i].second), sora[++sora[0]] = a[i].first, sora[++sora[0]] = a[i].second;
sort(sora + 1, sora + sora[0] + 1);
sora[0] = unique(sora + 1, sora + sora[0] + 1) - sora - 1;
for (int i = 1; i <= n; i++)
a[i].first = lower_bound(sora + 1, sora + sora[0] + 1, a[i].first) - sora, a[i].second = lower_bound(sora + 1, sora + sora[0] + 1, a[i].second) - sora;
solve();
return 0;
}
|
