HDU 4031 Attack(离线+线段树)(The 36th ACM/ICPC Asia Regional Chengdu Site —— Online Contest)
During the war, it is very important to understand the situation of both self and the enemy. So the commanders of American want to know how much time some part of the wall is successfully attacked. Successfully attacked means that the attack is not defended by the shield.
The first line of each test case is three integers, N, Q, t, the length of the wall, the number of attacks and queries, and the time each shield needs to cool down.
The next Q lines each describe one attack or one query. It may be one of the following formats
1. Attack si ti
Al Qaeda attack the wall from si to ti, inclusive. 1 ≤ si ≤ ti ≤ N
2. Query p
How many times the pth unit have been successfully attacked. 1 ≤ p ≤ N
The kth attack happened at the kth second. Queries don’t take time.
1 ≤ N, Q ≤ 20000
1 ≤ t ≤ 50
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std; const int MAXN = ;
const int MAXT = MAXN << ;
const int MAXP = ; struct Node {
int pos, op, time;
Node() {}
Node(int pos, int op, int time): pos(pos), op(op), time(time) {}
bool operator < (const Node &rhs) const {
return pos < rhs.pos;
}
}; vector<int> qtime[MAXN], qid[MAXN];
Node attack[MAXN * ];
int ans[MAXN];
int T, n, q, t, ncnt, atime; void init() {
for(int i = ; i <= n; ++i) qtime[i].clear(), qid[i].clear();
memset(ans, -, q * sizeof(int));
ncnt = atime = ;
} #define ll (x << 1)
#define rr (ll | 1)
#define mid ((l + r) >> 1)
int atk[MAXT][MAXP], empty[MAXT][MAXP];
int cnt[MAXN]; void update(int x) {
for(int i = ; i < t; ++i) {
int t = empty[ll][i];
atk[x][i] = atk[ll][i] + atk[rr][t];
empty[x][i] = empty[rr][t];
}
} void build(int x, int l, int r) {
if(l == r) {
atk[x][] = empty[x][] = cnt[l] = ;
for(int i = ; i < t; ++i)
atk[x][i] = , empty[x][i] = i - ;
} else {
build(ll, l, mid);
build(rr, mid + , r);
update(x);
}
} void modify(int x, int l, int r, int a, int b) {
if(a <= l && r <= b) {
atk[x][] = ; empty[x][] = cnt[a] ? t - : ;
for(int i = ; i < t; ++i)
atk[x][i] = cnt[a], empty[x][i] = i - ;
} else {
if(a <= mid) modify(ll, l, mid, a, b);
if(mid < b) modify(rr, mid + , r, a, b);
update(x);
}
} void modify(int pos) {
modify(, , atime, pos, pos);
} int query(int x, int l, int r, int a, int b, int e) {
if(a <= l && r <= b) {
return atk[x][e];
} else {
int res = query(ll, l, mid, a, b, e);
if(mid < b) res += query(rr, mid + , r, a, b, empty[ll][e]);
return res;
}
} int query(int pos) {
if(pos == ) return ;
return query(, , atime, , pos, );
} char s[]; int main() {
scanf("%d", &T);
for(int kase = ; kase <= T; ++kase) {
scanf("%d%d%d", &n, &q, &t);
init();
for(int i = , a, b; i < q; ++i) {
scanf("%s", s);
if(strcmp(s, "Attack") == ) {
scanf("%d%d", &a, &b);
atime++;
attack[ncnt++] = Node(a, , atime);
attack[ncnt++] = Node(b + , -, atime);
} else {
scanf("%d", &a);
qtime[a].push_back(atime);
qid[a].push_back(i);
}
}
sort(attack, attack + ncnt); build(, , atime);
int p = ;
for(int i = ; i <= n; ++i) {
while(p < ncnt && attack[p].pos == i) {
cnt[attack[p].time] += attack[p].op;
modify(attack[p++].time);
}
for(size_t k = ; k < qtime[i].size(); ++k)
ans[qid[i][k]] = query(qtime[i][k]);
} printf("Case %d:\n", kase);
for(int i = ; i < q; ++i)
if(ans[i] != -) printf("%d\n", ans[i]);
}
}
HDU 4031 Attack(离线+线段树)(The 36th ACM/ICPC Asia Regional Chengdu Site —— Online Contest)的更多相关文章
- HDU 4069 Squiggly Sudoku(DLX)(The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4069 Problem Description Today we play a squiggly sud ...
- HDU 4064 Carcassonne(插头DP)(The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4064 Problem Description Carcassonne is a tile-based ...
- HDU 4063 Aircraft(计算几何)(The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4063 Description You are playing a flying game. In th ...
- hdu 5877 线段树(2016 ACM/ICPC Asia Regional Dalian Online)
Weak Pair Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total ...
- HDU 4291 A Short problem(2012 ACM/ICPC Asia Regional Chengdu Online)
HDU 4291 A Short problem(2012 ACM/ICPC Asia Regional Chengdu Online) 题目链接http://acm.hdu.edu.cn/showp ...
- HDU 5873 Football Games 【模拟】 (2016 ACM/ICPC Asia Regional Dalian Online)
Football Games Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)To ...
- HDU 4031 Attack(线段树/树状数组区间更新单点查询+暴力)
Attack Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Sub ...
- HDU 4031 Attack (线段树)
成功袭击次数=所有袭击次数-成功防守次数 需要一个辅助pre来记录上一次袭击成功什么时候,对于每个查询,从上一次袭击成功开始,每隔t更新一次. 感觉这样做最坏时间复杂度是O(n^2),这里 说是O(q ...
- HDU 4729 An Easy Problem for Elfness(主席树)(2013 ACM/ICPC Asia Regional Chengdu Online)
Problem Description Pfctgeorge is totally a tall rich and handsome guy. He plans to build a huge wat ...
随机推荐
- js 判断js函数、变量是否存在
//是否存在指定函数 function isExitsFunction(funcName) { try { if (typeof(eval(funcName)) == "function&q ...
- 后台获取前台runat=server的select的值
<li> <asp:Label ID="Lpro" runat="server" Text="省份:" CssClass= ...
- zepto源码--classRE、maybeAddPx、children、defaultDisplay--学习笔记
1.classRE 对获取className的操作,进行缓存.如果缓存中有,直接读取缓存中的值,如果没有,则先进行缓存的存储,再读取值. 利用前面变量定义的classCache={}进行缓存的操作,如 ...
- XCODE打包安装包步骤
1. 2. 3. 4. 5. 6. 7. 导出之后就可以看到一个后缀为.ipa 的安装包.
- [LeetCode]题解(python):103 Binary Tree Zigzag Level Order Traversal
题目来源 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given a binary tree, re ...
- PresentViewController切换界面(一些系统自带的页面切换动画)
视图切换,没有NavigationController的情况下,一般会使用presentViewController来切换视图并携带切换时的动画, 其中切换方法如下: – presentViewCon ...
- JS之script标签
1.script标签的位置 script标签可以在head标签中,也可以在body标签中 2.async属性 async的目的是不让页面等待js文件的下载和执行,从而异步加载页面中的其他内容.只支持外 ...
- web storage: sessionStorage 和 localStorage
// sessionStorage.setItem("message",str);function saveStorage(id){ var target = document.g ...
- C语言:通过指针对数组元素进行排序
// // main.c // Pointer_array // // Created by ma c on 15/8/2. // Copyright (c) 2015年 bjsxt. All ...
- Mysql-5.6.30卸载
Mysql-5.6.30卸载 一.删除相关文件 rm -rf /var/lib/mysql/mysql (删除数据文件) rm -f /root/.mysql_secure (删除缺 ...