A - 卿学姐与公主
单点更新，查找区间最值
可线段树，可树状数组，也可RMQ。
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define lson l,mid,i<<1
#define rson mid+1,r,i<<1|1
typedef long long ll;
const int N = 1e5 + 10;
ll ans;
ll tr[N*4];
void update(int l,int r,int i,int p,int x)
{
if( l==r && l==p)
{
tr[i] += x;
return;
}
if(l==r) return;
int mid = (l+r)>>1;
if( mid>=p) update(lson,p,x);
else update(rson,p,x);
tr[i] = max(tr[i<<1],tr[i<<1|1]);
return;
}
void query(int l,int r,int i,int a,int b)
{
if(l>=a && r<=b)
{
ans = max(ans,tr[i]);
return;
}
if(l==r) return;
int mid = (l+r)>>1;
if( mid>=a) query(lson,a,b);
if( mid<b) query(rson,a,b);
return;
}
int main()
{
int n,q;
scanf("%d%d",&n,&q);
while(q--)
{
int t,a,b;
scanf("%d%d%d",&t,&a,&b);
if(t==1) update(1,n,1,a,b);
else{
ans = 0;
query(1,n,1,a,b);
printf("%lld\n",ans);
}
}
return 0;
}
B - 卿学姐与基本法
更新一段区间的所有点，查找某区间没被更新的点的个数
数据范围很大，需要离散化。这题有毒。
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <map>
typedef long long LL;
typedef unsigned long long ULL;
static const int mod = 100000007;
static const int maxN = 3e5 + 10;
typedef std::pair<int, int>PII;
template<typename T>inline void scaf(T&v) {
char ch = getchar();
int sgn = 1;
for (; '-' != ch && (ch < '0' || ch > '9'); ch = getchar());
if ('-' == ch) sgn = -1, v = 0;
else v = ch - '0';
for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar()) v = (v << 1) + (v << 3) + ch - '0';
v *= sgn;
}
bool lazy[maxN << 2];
int sum[maxN << 2];
std::map<int, int>hsMap;
int ql[maxN], qr[maxN], qt[maxN]; //l,r,type
int fp[maxN];
inline void build(int l, int r, int v) {
lazy[v] = false;
sum[v] = fp[r] - fp[l] + 1;
if (l >= r) {
return;
}
int mid = l + r >> 1;
build(l, mid, v << 1);
build(mid + 1, r, v << 1 | 1);
}
inline int compute(int l, int r) {
return fp[r] - fp[l] + 1;
}
inline void pushUp(int l, int r, int v) {
lazy[v] = lazy[v << 1] && lazy[v << 1 | 1];
if (lazy[v << 1] && lazy[v << 1 | 1]) {
sum[v] = 0;
return;
}
int mid = l + r >> 1;
sum[v] = compute(l, r) - (compute(l, mid) - sum[v << 1]) - (compute(mid + 1, r) - sum[v << 1 | 1]);
}
inline void update(int l, int r, int x, int y, int v) {
if (l >= x && r <= y) {
lazy[v] = true;
sum[v] = 0;
return;
}
if (lazy[v]) return;
int mid = l + r >> 1;
if (x <= mid) update(l, mid, x, y, v << 1);
if (mid < y) update(mid + 1, r, x, y, v << 1 | 1);
pushUp(l, r, v);
}
inline int query(int l, int r, int x, int y, int v) {
if (l >= x && r <= y) {
return sum[v];
}
if (lazy[v]) return 0;
int mid = l + r >> 1;
int result = 0;
if (x <= mid) result = query(l, mid, x, y, v << 1);
if (mid < y) result += query(mid + 1, r, x, y, v << 1 | 1);
return result;
}
int main() {
int n, q;
hsMap.clear();
scanf("%d%d", &n, &q);
for (int i = 0; i < q; ++i) {
scanf("%d%d%d", qt + i, ql + i, qr + i);
if (ql[i] - 1) hsMap[ql[i] - 1] = 1;
hsMap[ql[i]] = 1;
hsMap[ql[i] + 1] = 1;
if (qr[i] - 1) hsMap[qr[i] - 1] = 1;
hsMap[qr[i]] = 1;
hsMap[qr[i] + 1] = 1;
}
int pos = 0;
for (std::map<int, int>::iterator iter = hsMap.begin(); iter != hsMap.end(); ++iter) {
iter->second = ++pos;
fp[pos] = iter->first;
}
build(1, pos, 1);
for (int i = 0; i < q; ++i) {
if (1 == qt[i]) update(1, pos, hsMap[ql[i]], hsMap[qr[i]], 1);
if (2 == qt[i]) printf("%d\n", query(1, pos, hsMap[ql[i]], hsMap[qr[i]], 1));
}
return 0;
}C - 卿学姐与诡异村庄
如果t是1，那么i和ai都为好人或者都为坏人。
如果t是2，那么i和ai一个为好人一个为坏人。
带权并查集处理。
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
int father[N];
int rela[N];
int find(int x)
{
int y=x,sum=0;
while(y!=father[y])
{
sum+=rela[y];
y=father[y];
}
while(x!=father[x])
{
int temp=father[x];
sum-=rela[x];
rela[x]+=sum;
father[x]=y;
x=temp;
}
return y;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) father[i] = i,rela[i] = 0;
bool flag = true;
for(int i=1;i<=n;i++)
{
int x,t;
scanf("%d%d",&x,&t);
if(!flag) continue;
int fx = find(x);
int fi = find(i);
if(t==1)
{
if(fx==fi)
{
if(((rela[x]-rela[i])%2+2)%2!=0) flag = false;
}
else{
father[fx] = fi;
rela[fx] = 2 + rela[i] - rela[x];
}
}
else if(t==2)
{
if(fx==fi)
{
if(((rela[x]-rela[i])%2+2)%2==0) flag = false;
}
else{
father[fx] = fi;
rela[fx] = 1 + rela[i] - rela[x];
}
}
}
//int cnt = 0;
//for(int i=1;i<=n;i++) if(father[i]==i) cnt++;
if( !flag ) printf("One face meng bi\n");
else printf("Time to show my power\n");
return 0;
}
D - 卿学姐与魔法
啊这题啊。是一道面试题。优先队列处理，做法很高端啊。
先将两个数组排序然后维护一个长度为n的优先队列。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll arr[N];
ll brr[N];
struct Node{
ll x,num;
Node(){}
Node(int a,int b):x(a),num(b){}
friend bool operator < (const Node a,const Node b)
{
return a.num > b.num;
}
};
priority_queue<Node>que;
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&arr[i]);
for(int i=0;i<n;i++) scanf("%d",&brr[i]);
sort(arr,arr+n);
sort(brr,brr+n);
for(int i=0;i<n;i++) que.push(Node(0,arr[i]+brr[0]));
for(int i=0;i<n;i++)
{
Node tmp = que.top(); que.pop();
if(tmp.x + 1<n) que.push(Node(tmp.x+1, tmp.num - brr[tmp.x] + brr[tmp.x+1]));
printf("%lld\n",tmp.num);
}
return 0;
}
E - 卿学姐与城堡的墙
变向的求逆序数。将每条直线与 x = u, x = v 的交点算出来。固定一端的点，求另一端的逆序数。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define lson l,mid,i<<1
#define rson mid+1,r,i<<1|1
typedef long long ll;
const int N = 2*1e5 + 10;
int tr[N*4];
ll Hash[N];
typedef pair<ll,ll>P;
P pll[N];
bool comp(const P a,const P b)
{
if( a.first==b.first)
return a.second > b.second;
else return a.first < b.first;
}
ll ans;
void built(int l,int r,int i)
{
tr[i] = 0;
if(l==r) return;
int mid = (l+r)>>1;
built(lson);
built(rson);
return;
}
void update(int l,int r,int i,int x)
{
if(l==r && l==x)
{
tr[i]++;
return;
}
if(l>=r) return;
int mid = (l+r)>>1;
if(mid>=x) update(lson,x);
else update(rson,x);
tr[i] = tr[i<<1] + tr[i<<1|1];
return;
}
void query(int l,int r,int i,int a,int b)
{
if(l>=a && r<=b)
{
ans += tr[i];
return;
}
if(l>=r) return;
int mid = (l+r)>>1;
if(mid>=a) query(lson,a,b);
if(mid<b) query(rson,a,b);
tr[i] = tr[i<<1] + tr[i<<1|1];
return;
}
int main()
{
int n;
ll u,v;
scanf("%d%lld%lld",&n,&u,&v);
for(int i=1;i<=n;i++)
{
ll k,b;
scanf("%lld %lld",&k,&b);
ll l = k*u + b;
ll r = k*v + b;
pll[i] = make_pair(l,r);
Hash[i-1] = r;
}
sort(Hash,Hash+n);
int nn = unique(Hash,Hash+n) - Hash;
sort(pll+1,pll+1+n,comp);
built(1,nn,1);
ll sum = 0;
for(int i=1;i<=n;i++)
{
int x = lower_bound(Hash,Hash+nn,pll[i].second) - Hash + 1;
ans = 0;
query(1,nn,1,x,nn);
sum += ans;
update(1,nn,1,x);
}
printf("%lld\n",sum);
return 0;
}
I - 郭大侠与线上游戏
求一个动态队列的中位数。
用set来模拟。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
queue<int>que;
set<int>s;
int main()
{
bool flag = true;
int n;
scanf("%d",&n);
set<int>::iterator it;
while(n--)
{
int op;
scanf("%d",&op);
if(op==1)
{
int x;
scanf("%d",&x);
que.push(x);
s.insert(x);
if(s.size()==1&&flag) it = s.begin(),flag=false;
else if(s.size()%2 && x<(*it)) it--;
else if(s.size()%2==0 && x>(*it)) it++;
}
else if(op==2)
{
int x = que.front();
que.pop();
if(s.size()%2==0 && x>=(*it)) it--;
else if(s.size()%2 && x<=(*it)) it++;
s.erase(x);
}
else printf("%d\n",(*it));
}
return 0;
}J - 郭大侠与Rabi-Ribi
贪心啊 倒过来模拟，如果兔子第 i sec躲回洞里，从i ~0 模拟，看是否有时间让其被打晕。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 100;
const int M = 5500;
bool vis[M];
typedef pair<int,int>P;
P pll[N];
bool comp(const P a, const P b)
{
if(a.second == b.second)
return a.first > b.first;
else return a.second> b.second;
}
int main()
{
int n;
scanf("%d",&n);
int mas = 0;
for(int i=1;i<=n;i++) scanf("%d",&pll[i].first);
for(int i=1;i<=n;i++) scanf("%d",&pll[i].second);
sort(pll+1,pll+1+n,comp);
memset(vis,true,sizeof(vis));
int ans = 0;
for(int i=1;i<=n;i++)
{
for(int j = pll[i].first;j>=1;j--)
{
if(vis[j]) {
ans += pll[i].second;
vis[j] = false;
break;
}
}
}
printf("%d\n",ans);
return 0;
}
K - 郭大侠与甲铁城
很裸的莫队算法 然而一开始没看出来
莫队算法 == 莽夫算法
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int N = 1e5 + 100;
int res[N];
int size,arr[N];
int mm[10500];
struct Node{
int l,r,id;
friend bool operator < (const Node a,const Node b)
{
if( a.l/size == b.l/size) return a.r < b.r;
else return a.l/size < b.l/size;
}
}q[N];
void work(int m)
{
memset(mm,0,sizeof(mm));
int curL = q[1].l;
int curR = q[1].r;
int now = 0;
for(int i= curL;i<=curR;i++)
{
if(mm[arr[i]]==0) now++;
mm[arr[i]]++;
}
res[q[1].id] = now;
for(int i=2;i<=m;i++)
{
while( curL < q[i].l)
{
mm[arr[curL]]--;
if(mm[arr[curL]]==0) now--;
curL++;
}
while( curL > q[i].l)
{
curL--;
if(mm[arr[curL]]==0) now++;
mm[arr[curL]]++;
}
while( curR < q[i].r)
{
curR++;
if(mm[arr[curR]]==0) now++;
mm[arr[curR]]++;
}
while( curR > q[i].r)
{
mm[arr[curR]]--;
if(mm[arr[curR]]==0) now--;
curR--;
}
res[q[i].id] = now;
}
return;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
size = (int)sqrt(n);
for(int i=1;i<=n;i++) scanf("%d",&arr[i]);
for(int i=1;i<=m;i++) scanf("%d%d",&q[i].l,&q[i].r),q[i].id = i;
sort(q+1,q+1+m);
work(m);
for(int i=1;i<=m;i++) printf("%d\n",res[i]);
return 0;
}
Q - 昊昊爱运动 II
染色问题。询问当前区间有哪几种颜色。然而颜色有100种。我用了两个long long的数的二进制来存储。然而学习了一种很厉害的东西：
一种类模板： bitset
http://blog.163.com/lixiangqiu_9202/blog/static/53575037201251121331412/
具体用法。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define lson l,mid,i<<1
#define rson mid+1,r,i<<1|1
typedef long long ll;
const int N = 1e5 + 10;
int flag[N*4];
int n,m,now;
ll ansfir,anslas;
ll fir[N*4],las[N*4];
void built(int l,int r,int i)
{
flag[i] = fir[i] = las[i] = 0;
if(l==r)
{
int x;
scanf("%d",&x);
if(x<=50) fir[i] = 1LL<<x;
else las[i] = 1LL<<(x-50);
return;
}
int mid = (l+r)>>1;
built(lson);
built(rson);
fir[i] = fir[i<<1] | fir[i<<1|1];
las[i] = las[i<<1] | las[i<<1|1];
return;
}
void pushdown(int l,int r,int i)
{
flag[i<<1] = flag[i<<1|1] = flag[i];
fir[i<<1] = fir[i<<1|1] = 0;
las[i<<1] = las[i<<1|1] = 0;
if(flag[i]<=50) fir[i<<1] = fir[i<<1|1] = 1LL<<flag[i];
else las[i<<1] = las[i<<1|1] = 1LL<<(flag[i] - 50);
flag[i] = 0;
return;
}
void update(int l,int r,int i,int a,int b,int x)
{
if( l>=a && r<=b )
{
flag[i] = x;
fir[i] = las[i] = 0;
if(x<=50) fir[i] = 1LL<<x;
else las[i] = 1LL<<(x-50);
return;
}
if(l==r) return;
if(flag[i]) pushdown(l,r,i);
int mid = (l+r)>>1;
if( mid>=a) update(lson,a,b,x);
if( mid<b) update(rson,a,b,x);
fir[i] = fir[i<<1] | fir[i<<1|1];
las[i] = las[i<<1] | las[i<<1|1];
return;
}
void query(int l,int r,int i,int a,int b)
{
if(l>=a && r<=b)
{
anslas |= las[i];
ansfir |= fir[i];
return;
}
if(l==r) return;
if(flag[i]) pushdown(l,r,i);
int mid = (l+r)>>1;
if( mid>=a) query(lson,a,b);
if( mid<b) query(rson,a,b);
fir[i] = fir[i<<1] | fir[i<<1|1];
las[i] = las[i<<1] | las[i<<1|1];
return;
}
int main()
{
scanf("%d%d",&n,&m);
built(1,n,1);
int q; scanf("%d",&q);
while(q--)
{
char op;
int a,b,x;
scanf(" %c%d%d",&op,&a,&b);
if(op=='M') scanf("%d",&x),update(1,n,1,a,b,x);
else{
now = anslas = ansfir = 0;
query(1,n,1,a,b);
for(int i=1;i<=50;i++)
{
if( (ansfir>>i) & 1) now++;
if( (anslas>>i) & 1) now++;
}
printf("%d\n",now);
}
}
return 0;
}
扫一扫
287
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
