【POJ 3580】 SuperMemo
【题目链接】
【算法】
本题也是Splay区间操作的模板题，不过要比BZOJ 3223要稍微复杂一些，做完此题后，我终于对Splay有了更深入的理解，有“拨开云雾见青天”的感觉
本题还是有许多细节的，笔者花了5h才通过了此题
【代码】
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
#define MAXN 100000
const int INF = 2e9; int i,N,M,d,P,x,y,t;
int a[MAXN+];
string opt; template <typename T> inline void read(T &x) {
int f=; x=;
char c = getchar();
for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
for (; isdigit(c); c = getchar()) x = x * + c - '';
x *= f;
} template <typename T> inline void write(T x) {
if (x < ) { putchar('-'); x = -x; }
if (x > ) write(x/);
putchar(x%+'');
} template <typename T> inline void writeln(T x) {
write(x);
puts("");
} struct Splay {
int root,total;
struct Node {
int fa,son[],size,add,Min,val;
bool rev;
} Tree[MAXN*+];
inline bool get(int x) {
return Tree[Tree[x].fa].son[] == x;
}
inline void build(int index,int l,int r) {
int mid = (l + r) >> ;
Tree[index].size = ;
Tree[index].add = Tree[index].rev = ;
Tree[index].val = Tree[index].Min = a[mid];
if (l == r) return;
if (l < mid) {
++total;
Tree[index].son[] = total;
Tree[total].fa = index;
build(total,l,mid-);
Tree[index].size += Tree[Tree[index].son[]].size;
Tree[index].Min = min(Tree[index].Min,Tree[Tree[index].son[]].Min);
}
if (mid < r) {
++total;
Tree[index].son[] = total;
Tree[total].fa = index;
build(total,mid+,r);
Tree[index].size += Tree[Tree[index].son[]].size;
Tree[index].Min = min(Tree[index].Min,Tree[Tree[index].son[]].Min);
}
}
inline void new_node(int index,int x,int f) {
Tree[index].rev = ;
Tree[index].size = ;
Tree[index].val = Tree[index].Min = x;
Tree[index].add = ;
Tree[index].fa = f;
Tree[index].son[] = Tree[index].son[] = ;
}
inline int query_pos(int x) {
int index = root;
while (true) {
pushdown(index);
if (x > Tree[Tree[index].son[]].size) {
x -= Tree[Tree[index].son[]].size;
if (x == ) return index;
--x;
index = Tree[index].son[];
} else index = Tree[index].son[];
}
}
inline void pushdown(int index) {
if (Tree[index].rev) {
swap(Tree[index].son[],Tree[index].son[]);
Tree[Tree[index].son[]].rev ^= ;
Tree[Tree[index].son[]].rev ^= ;
Tree[index].rev = ;
}
if (Tree[index].add) {
Tree[Tree[index].son[]].val += Tree[index].add;
Tree[Tree[index].son[]].val += Tree[index].add;
Tree[Tree[index].son[]].add += Tree[index].add;
Tree[Tree[index].son[]].add += Tree[index].add;
Tree[Tree[index].son[]].Min += Tree[index].add;
Tree[Tree[index].son[]].Min += Tree[index].add;
Tree[index].add = ;
}
}
inline void update(int index) {
Tree[index].size = Tree[Tree[index].son[]].size + Tree[Tree[index].son[]].size + ;
Tree[index].Min = Tree[index].val;
if (Tree[index].son[]) Tree[index].Min = min(Tree[index].Min,Tree[Tree[index].son[]].Min);
if (Tree[index].son[]) Tree[index].Min = min(Tree[index].Min,Tree[Tree[index].son[]].Min);
}
inline void splay(int x,int pos) {
int f;
for (f = Tree[x].fa; (f = Tree[x].fa) != pos; rotate(x)) {
if (Tree[f].fa != pos)
rotate(get(f) == get(x) ? (f) : (x));
}
if (!pos) root = x;
}
inline void rotate(int x) {
int f = Tree[x].fa,g = Tree[f].fa,
tmpx = get(x),tmpf = get(f);
pushdown(f); pushdown(x);
if (!f) return;
Tree[f].son[tmpx] = Tree[x].son[tmpx^];
if (Tree[x].son[tmpx^]) Tree[Tree[x].son[tmpx^]].fa = f;
Tree[x].son[tmpx^] = f;
Tree[f].fa = x;
Tree[x].fa = g;
if (g) Tree[g].son[tmpf] = x;
update(f);
update(x);
}
inline void Insert(int p,int val) {
int x = query_pos(p),
y = query_pos(p+);
splay(x,); splay(y,root);
new_node(++total,val,Tree[root].son[]);
Tree[Tree[root].son[]].son[] = total;
update(Tree[root].son[]);
update(root);
}
inline void erase(int p) {
int x = query_pos(p-),
y = query_pos(p+);
splay(x,); splay(y,root);
Tree[Tree[root].son[]].son[] = ;
update(Tree[root].son[]);
update(root);
}
inline void add(int l,int r,int v) {
int x = query_pos(l-),
y = query_pos(r+);
splay(x,); splay(y,root);
Tree[Tree[Tree[root].son[]].son[]].val += v;
Tree[Tree[Tree[root].son[]].son[]].add += v;
Tree[Tree[Tree[root].son[]].son[]].Min += v;
update(Tree[root].son[]);
update(root);
}
inline void reverse(int l,int r) {
int x = query_pos(l-),
y = query_pos(r+);
splay(x,); splay(y,root);
Tree[Tree[Tree[root].son[]].son[]].rev ^= ;
}
inline int query_min(int l,int r) {
int x = query_pos(l-),
y = query_pos(r+);
splay(x,); splay(y,root);
return Tree[Tree[Tree[root].son[]].son[]].Min;
}
inline void revolve(int l,int r,int t) {
int x = query_pos(r-t),
y = query_pos(r+);
splay(x,); splay(y,root);
int tmp = Tree[Tree[root].son[]].son[];
Tree[Tree[root].son[]].son[] = ;
update(Tree[root].son[]);
update(root);
x = query_pos(l-);
y = query_pos(l);
splay(x,); splay(y,root);
Tree[Tree[root].son[]].son[] = tmp;
Tree[tmp].fa = Tree[root].son[];
update(Tree[root].son[]);
update(root);
}
} T; int main() { read(N); T.root = T.total = ;
for (i = ; i <= N + ; i++) read(a[i]);
a[] = a[N+] = INF;
T.build(,,N+); read(M);
while (M--) {
cin >> opt;
if (opt[] == 'A') {
read(x); read(y); read(d);
if (x > y) swap(x,y);
T.add(x+,y+,d);
} else if (opt[] == 'R' && opt[] == 'E' && opt[] == 'V' && opt[] == 'E'){
read(x); read(y);
if (x > y) swap(x,y);
T.reverse(x+,y+);
} else if (opt[] == 'R' && opt[] == 'E' && opt[] == 'V' && opt[] == 'O') {
read(x); read(y); read(t);
if (x > y) swap(x,y);
t = (t % (y - x + ) + y - x + ) % (y - x + );
if (!t) continue;
T.revolve(x+,y+,t);
} else if (opt[] == 'I') {
read(x); read(P);
T.Insert(x+,P);
} else if (opt[] == 'D') {
read(x);
T.erase(x+);
} else if (opt[] == 'M') {
read(x); read(y);
if (x > y) swap(x,y);
writeln(T.query_min(x+,y+));
}
} return ; }
【POJ 3580】 SuperMemo的更多相关文章
- 【POJ 3580】SuperMemo Splay
题意 给定$n$个数,$m$个询问,每次在$[L,R]$区间加上一个数,或者反转一个区间$[L,R]$,或者循环右移区间$[L,R]$共$T$次,或者在第$x$个数后插入一个数$p$,或者删除第$x$ ...
- bzoj 2295: 【POJ Challenge】我爱你啊
2295: [POJ Challenge]我爱你啊 Time Limit: 1 Sec Memory Limit: 128 MB Description ftiasch是个十分受女生欢迎的同学,所以 ...
- 【链表】BZOJ 2288: 【POJ Challenge】生日礼物
2288: [POJ Challenge]生日礼物 Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 382 Solved: 111[Submit][S ...
- BZOJ2288: 【POJ Challenge】生日礼物
2288: [POJ Challenge]生日礼物 Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 284 Solved: 82[Submit][St ...
- BZOJ2293: 【POJ Challenge】吉他英雄
2293: [POJ Challenge]吉他英雄 Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 80 Solved: 59[Submit][Stat ...
- BZOJ2287: 【POJ Challenge】消失之物
2287: [POJ Challenge]消失之物 Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 254 Solved: 140[Submit][S ...
- BZOJ2295: 【POJ Challenge】我爱你啊
2295: [POJ Challenge]我爱你啊 Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 126 Solved: 90[Submit][Sta ...
- BZOJ2296: 【POJ Challenge】随机种子
2296: [POJ Challenge]随机种子 Time Limit: 1 Sec Memory Limit: 128 MBSec Special JudgeSubmit: 114 Solv ...
- BZOJ2292: 【POJ Challenge 】永远挑战
2292: [POJ Challenge ]永远挑战 Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 513 Solved: 201[Submit][ ...
随机推荐
- PSO(Thepopularity-similarity-oplimization) modol
PSO(Thepopularity-similarity-oplimization) modol 在这篇文章里,我们试图将社交关系构成的网络结构从纷繁复杂的具体场景.细节条件中剥离出来,单单从个体间连 ...
- Java并发编程，深入理解ReentrantLock
ReentrantLock简介 ReentrantLock重入锁,是实现Lock接口的一个类,也是在实际编程中使用频率很高的一个锁, 支持重入性,表示能够对共享资源能够重复加锁,即当前线程获取该锁再次 ...
- [vxlan] 二 什么是VXLAN
VXLAN是一种mac in UDP的技术.简单讲就是传统的二层帧被封装到了UDP的package中.通过UDP的IP网络发送到目的地然后再解封装. VXLAN 跟VLAN对比,最重要的一个概念就是V ...
- XML Publisher Template Type - Microsoft Excel Patch
XML Publisher Template Type - Microsoft Excel Patch Oracle XML Publisher > Templates > Create ...
- 通过BSSID和无线流量传输后门Payload
本文将探讨无线接入点(AP)和BSSID(MAC地址AP).我们不借助文件系统加密和文件系统中(仅内存中)的硬编码Payload即可获得后门Payload,通过该方法可绕过所有的杀软,可以不使用Pay ...
- BUPT复试专题—三元组(2016)
题目描述 给你一个长度为m的数组(数组元素从0到m-1),如果数组里有a[i]+a[j]==a[k](i,j,k大于等于0并且小于m),便称之为三元组.现在给你一个数组,让你求三元组的个数. 例如m为 ...
- 系统重装 如何转换GPT的磁盘格式为MBR或者反过来
使用分区助手专业版可以让磁盘在GPT和MBR之间进行转换 一般把磁盘全部格式化并清除分区,剩下的都会是可用空间,还是需要重建MBR来把磁盘转换成MBR格式的 转换会设置操作系统类型
- 【转载】高性能IO模型浅析
服务器端编程经常需要构造高性能的IO模型,常见的IO模型有四种: (1)同步阻塞IO(Blocking IO):即传统的IO模型. (2)同步非阻塞IO(Non-blocking IO):默认创建的s ...
- 【Leetcode】经典的Jump Game in JAVA
Given an array of non-negative integers, you are initially positioned at the first index of the arra ...
- poj 3105 Expectation 按位统计
题意: 给n,求sum(i^j)/(n^2),0<=i,j<n.n<10^9 分析: 暴力n^2算法肯定超时.这是logn按位统计算法:按位先算出0出现的个数x,则1出现的个数为n- ...