(WA)BZOJ 1503: [NOI2004]郁闷的出纳员
二次联通门 : BZOJ 1503: [NOI2004]郁闷的出纳员
/*
BZOJ 1503: [NOI2004]郁闷的出纳员 考虑这样一个事实
无论是加或减
都是针对全体人员的 那么只需要记录一个总标记 直接记录对于工资的加或减 每次查询最低要求工资与标记的差的前驱,并旋到根处 那么根节点的所有左子树都是不符合要求要走人的
每次记录一下搞一搞, 就不用考虑splay麻烦的标记下放问题了
但是却没调出来。。。
*/
#include <cstdio> void read (int &now)
{
register char word = getchar ();
bool temp = false;
for (now = ; word < '' || word > ''; word = getchar ())
if (word == '-')
temp = true;
for (; word >= '' && word <= ''; now = now * + word - '', word = getchar ());
if (temp)
now = -now;
} int Min_N; struct S_D
{
S_D *child[], *father; int key;
int weigth, size; inline void Updata ()
{
this->size = this->weigth;
if (this->child[])
this->size += this->child[]->size;
if (this->child[])
this->size += this->child[]->size;
} S_D ()
{
child[] = child[] = NULL;
size = weigth = ;
key = ;
father = NULL;
} inline int Get_Pos ()
{
return this->father->child[] == this;
} inline void Clear ()
{
this->child[] = this->child[] = father = NULL;
}
}; int Answer;
class Splay_Tree_Type
{ private : S_D *Root; inline void Rotate (S_D *now)
{
S_D *Father = now->father;
register int pos = now->Get_Pos () ^ ;
Father->child[pos ^ ] = now->child[pos];
if (now->child[pos])
now->child[pos]->father = Father;
if ((now->father = Father->father) != NULL)
now->father->child[now->father->child[] == Father] = now; Father->father = now;
now->child[pos] = Father; Father->Updata ();
now->Updata (); if (now->father == NULL)
Root = now;
} inline void Splay (S_D *now)
{
for (S_D *Father; Father = now->father; this->Rotate (now))
if (Father->father != NULL)
this->Rotate (now->Get_Pos () == Father->Get_Pos () ? Father : now);
} S_D* Find (int x)
{
S_D *now = Root;
for (; (now != NULL && now->key != x); now = now->child[x > now->key]);
if (now == NULL)
return now;
Splay (now);
return now;
} void Delete_point (int x)
{
S_D *now = Find (x);
if (now->weigth > )
{
now->weigth --;
return ;
}
if (now->child[] == NULL && now->child[] == NULL)
{
now->Clear ();
Root = NULL;
return ;
}
S_D *res;
if (now->child[] == NULL)
{
Root = now->child[];
now->child[]->father = NULL;
now->Clear ();
return ;
}
if (now->child[] == NULL)
{
Root = now->child[];
now->child[]->father = NULL;
now->Clear ();
return ;
}
S_D *Prefix = Find_Prefix (x);
res = Root;
Prefix->child[] = res->child[];
res->child[]->father = Root;
res->Clear ();
Root->Updata ();
} void Delete_tree (int x)
{
S_D *now = Find_Suffix (x);
if (now == NULL)
return ;
Answer += now->child[]->size;
now->child[]->father = NULL;
now->child[] = NULL;
now->Updata ();
} S_D *Find_Suffix (int x)
{
this->Insert (x);
S_D *now = Root;
if (now->child[] == NULL)
{
this->Delete_point (x);
return NULL;
}
for (now = now->child[]; now->child[]; now = now->child[]);
this->Delete_point (x);
if (now == NULL)
return now;
this->Splay (now);
return now;
} S_D *Find_Prefix (int x)
{
this->Insert (x);
S_D *now = Root;
if (now->child[] == NULL)
{
this->Delete_point (x);
return NULL;
}
for (now = now->child[]; now->child[]; now = now->child[]);
this->Delete_point (x);
if (now == NULL)
return now;
this->Splay (now);
return now;
} public : int Flandre_Scarlet; void Insert (int x)
{
if (Root == NULL)
{
Root = new S_D ;
Root->key = x;
return ;
}
S_D *now = Root, *Father;
for (; ;Father = now, now = now->child[x > now->key])
{
if (now == NULL)
{
now = new S_D;
now->key = x;
now->father = Father;
Father->child[x > Father->key] = now;
this->Splay (now);
return ;
}
if (x == now->key)
{
now->weigth ++;
this->Splay (now);
return ;
}
}
} void Cut (int x)
{
int Need = Min_N - Flandre_Scarlet;
S_D *now = this->Find_Prefix (Need);
if (now != NULL)
this->Delete_tree (now->key);
} int Query (int x)
{
S_D *now = Root;
for (register int res = ; ; )
{
if (now->child[] && x < now->child[]->size)
now = now->child[];
res += (now->child[] ? now->child[]->size : ) + now->weigth;
if (x <= res)
return now->key;
x -= res;
now = now->child[];
}
} void Change (int x)
{
Flandre_Scarlet += x;
return ;
} int Query_Size ()
{
return Root->size;
}
}; Splay_Tree_Type Splay; int main (int argc, char *argv[])
{
freopen ("cashier.in", "r", stdin);
freopen ("cashier.out", "w", stdout);
int N;
read (N);
read (Min_N);
char type[];
register int Size;
for (int x; N --; )
{
scanf ("%s", type);
read (x);
if (type[] == 'I')
Splay.Insert (x);
else if (type[] == 'S')
Splay.Change (-x);
else if (type[] == 'A')
Splay.Change (x);
else
{
Splay.Cut (x);
Size = Splay.Query_Size ();
if (x > Size)
puts ("-1");
else
printf ("%d\n", Splay.Query (Size - x) + Splay.Flandre_Scarlet);
}
}
printf ("%d", Answer);
return ;
} /*
20 0
I 4
F 1
I 6
S 9
F 14
I 6
I 7
A 8
I 3
F 2
I 9
I 6
I 6
S 3
S 5
I 6
F 1
I 3
A 2
F 5
*/ /*
4
-1
14
7
3
5
*/
(WA)BZOJ 1503: [NOI2004]郁闷的出纳员的更多相关文章
- BZOJ 1503: [NOI2004]郁闷的出纳员
1503: [NOI2004]郁闷的出纳员 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 10526 Solved: 3685[Submit][Stat ...
- BZOJ 1503: [NOI2004]郁闷的出纳员 splay
1503: [NOI2004]郁闷的出纳员 Description OIER公司是一家大型专业化软件公司,有着数以万计的员工.作为一名出纳员,我的任务之一便是统计每位员工的工资.这本来是一份不错的工作 ...
- bzoj 1503: [NOI2004]郁闷的出纳员 Treap
1503: [NOI2004]郁闷的出纳员 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 6263 Solved: 2190[Submit][Statu ...
- bzoj 1503: [NOI2004]郁闷的出纳员 -- 权值线段树
1503: [NOI2004]郁闷的出纳员 Time Limit: 5 Sec Memory Limit: 64 MB Description OIER公司是一家大型专业化软件公司,有着数以万计的员 ...
- 1503: [NOI2004]郁闷的出纳员 (SBT)
1503: [NOI2004]郁闷的出纳员 http://www.lydsy.com/JudgeOnline/problem.php?id=1503 Time Limit: 5 Sec Memory ...
- bzoj 3224 NOI2004郁闷的出纳员
NOI2004郁闷的出纳员 2013年12月26日6,1818 输入描述 Input Description 第一行有两个非负整数n和min.n表示下面有多少条命令,min表示工资下界. 接下来的n行 ...
- 【BZOJ】1503: [NOI2004]郁闷的出纳员(Splay)
http://www.lydsy.com/JudgeOnline/problem.php?id=1503 这题没有看题解就1a了-好开心,, 其实后面去看题解发现他们的都很麻烦,其实有种很简单的做法: ...
- 1503. [NOI2004]郁闷的出纳员【平衡树-splay】
Description OIER公司是一家大型专业化软件公司,有着数以万计的员工.作为一名出纳员,我的任务之一便是统计每位员工的 工资.这本来是一份不错的工作,但是令人郁闷的是,我们的老板反复无常,经 ...
- 1503: [NOI2004]郁闷的出纳员
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 13723 Solved: 4989[Submit][Status][Discuss] Descripti ...
随机推荐
- (九)Hibernate 的复合主键
一.什么是复合主键? 一张表的主键是由多个字段组成,这个主键就被称为复合主键. 主键是唯一确定某条记录的字段,比如公民的身份证号就是一个主键,因为由身份证号这个主键就可以确定 某个公民. 有一种 ...
- C#多线程的简单理解
一.CLR线程池基础 创建和销毁线程是一个昂贵的操作,所以CLR管理了一个线程池(thread pool),可以将线程池看成一个黑盒. CLR初始化时,线程池中是没有线程的.线程的初始化与其他线程一样 ...
- java小工具:通过URL连接爬取资源(图片)
java语言编写一个简单爬取网站图片工具,实现简单: 通过 java.net.HttpURLConnection 获取一个URL连接 HttpURLConnection 连接成功返回一个java.io ...
- Java 18套JAVA企业级大型项目实战分布式架构高并发高可用微服务电商项目实战架构
Java 开发环境:idea https://www.jianshu.com/p/7a824fea1ce7 从无到有构建大型电商微服务架构三个阶段SpringBoot+SpringCloud+Solr ...
- 基于【 centos7】一 || 安装ELK
一.安装jdk 上传安装包并解压:tar -zxvf ... 配置环境变量: 在配置文件中添加如下配置信息:vi /etc/profile export JAVA_HOME=/usr/local/jd ...
- 二级菜单被banner遮住的解决方法
原因:z-index的问题 解决:在导航box加 position: relative; z-index: 4; 比banner 大就可以.然后在一级导航的 li 设置 相对定位 positio ...
- SMTP命令
SMTP(Simple Mail Transfer Protocol)简单邮件传输协议 Basic Commands: HELO(Hello):标识用户身份 MAIL FROM:发件人地址 RCPT ...
- UITableView个人使用总结【前篇-增量加载】
UITableView现在边整边总结. 预计分两个部分,第一个部分主要是对UITableView本身属性的学习.第二个部分可能会是加上一个编辑按钮以及对列表的操作. 今天先学习第一部分. 第一部分,我 ...
- zabbix-自定义监控项
一.自定义一个监控项 模板虽好,但是不能解决所有的监控,有些需要的监控项在模板中并没有,需要我们自己定义一个监控项,如何定义一个监控项呢?大概的流程是这样的几步 .在插件配置文件中定义一个key/va ...
- python将一个字符串写入文件中的编码问题
python2将一个字符串写入文件中: 1.如果字符串是str类型 # -*- coding:utf-8 -*- txtFile="今天天气不错" name = "1.t ...