HDOJ 1698 Just a Hook

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
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
int num[100005<<2];
int cnt[100005<<2];
inline void pushdown ( int rt, int len )
{
if ( cnt[rt] > 0 )
{
cnt[rt<<1] = cnt[rt<<1|1] = cnt[rt];
num[rt<<1] = ( len - ( len >> 1 ) ) * cnt[rt];
num[rt<<1|1] = ( len >> 1 ) * cnt[rt];
cnt[rt] = 0;
}
}
void update ( int L, int R, int l, int r, int rt, int n )
{
if ( L <= l && r <= R )
{
cnt[rt] = n;
num[rt] = ( r - l + 1 ) * n;
return;
}
else
{
pushdown ( rt, r - l + 1 );
int mid = ( l + r ) >> 1;
if ( L <= mid )
{
update ( L, R, l, mid, rt << 1, n );
}
if ( mid < R )
{
update ( L, R, mid + 1, r, rt << 1 | 1, n );
}
num[rt] = num[rt<<1] + num[rt<<1|1];
}
}
void build ( int l, int r, int rt )
{
cnt[rt] = 0;
if ( l == r )num[rt] = 1;
else
{
int mid = ( l + r ) >> 1;
build ( l, mid, rt << 1 );
build ( mid + 1, r, rt << 1 | 1 );
num[rt] = num[rt<<1] + num[rt<<1|1];
}
}
int main()
{
ios::sync_with_stdio( false );
int ncase;
cin >> ncase;
for ( int nc = 1; nc <= ncase; nc ++ )
{
int m, k, l, r, n;
memset ( num, 0, sizeof ( num ) );
cin >> m >> k;
build ( 1, m, 1 );
for ( int i = 0; i < k; i ++ )
{
cin >> l >> r >> n;
update ( l, r, 1, m, 1, n );
}
cout << "Case " << nc << ": The total value of the hook is " << num[1] << "." << endl;
}
return 0;
}