A.String
万万没想到这题暴力就可以艹过去。。(感谢隔壁队伍大喊一声“暴力都能过”)
据说直接
O
(
N
3
)
O(N^3)
O(N3)就可以了?
毕竟这个时间复杂度几乎不可能跑满
我们的做法大概是找到一个全新的0进行check。。哎算了不管怎么做都能对
出题人也是非常心机的稍微放大了数据范围,所以如果不能想到“复杂度是假的”那么就会想我们队一样自闭两个小时
#include<bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
int T,n,i,l,r,res,last;
char ch[300];
int a[300];
int f[300];
bool judge2(int l,int r,int last)
{
int s = l; int t = last;
int i;
fo(i,1,r-l+1)
{
if (a[s] < a[t]) return true;
if (a[s] > a[t]) return false;
s++; t++;
if (t > r) t = l;
}
return true;
}
bool judge(int l,int r)
{
int i;
fo(i,l,r)
if (a[i] == 0 && (a[i-1] == 1 || i == l))
{
if (judge2(l,r,i) == false) return false;
}
return true;
}
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%s",ch+1); n = strlen(ch+1);
fo(i,1,n) a[i] = ch[i] - '0'; a[n+1] = -1;
fo(i,1,n) f[i] = 0;
l = 1; r = 1;
while (l <= n)
{
while (a[r] == 0) r++; while (a[r] == 1) r++; r--; res = r;
while (1)
{
r++; while (a[r] == 0) r++; while (a[r] == 1) r++; r--;
if (judge(l,r)) res = r;
if (r == n) break;
}
f[res] = 1;
l = r = res + 1;
}
fo(i,1,n)
{
printf("%d",a[i]);
if (f[i] == 1) printf(" ");
}
printf("\n");
}
return 0;
}
B.Irreducible Polynomial
根据虚根成对定理可知,任何一个多项式都可以分解为一次多项式和二次多项式的乘积
所以这题之要check一下二次多项式的
Δ
\Delta
Δ就好了
D.Number
往p后面不断填0即可
E.Energy stones
首先离散化,然后维护区间内的数的个数
对于修改操作就是区间覆盖操作
对于查询操作则要查询左孩子的个数,如果左孩子大于等于k则左递归,否则把k减去左孩子个数后右递归
注意离散化的写法
6倍的写法:对于一个点
x
x
x,把
x
−
1
x-1
x−1、
x
x
x、
x
+
1
x+1
x+1作为关键点构造区间
4倍的写法:把每个点和点与点之间的区间加入离散列表
2倍的写法:左开右闭即可
#include <bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define N 1600005
#define ll long long
using namespace std;
ll n,a1,b1,a2,b2,c1,m1,c2,m2,i,k,m,lx,rx;
ll pt,per,num,ask,lnum,res;
ll x[N],y[N],l[N],r[N],f[N],L[N],R[N];
ll sum[N*4];
int tag[N*4],len[N*4];
void pushup(int rt)
{
sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void build(int rt,int l,int r)
{
if (l == r) {sum[rt] = 0; len[rt] = R[l] - L[l] + 1; return;}
int mid = (l + r) >> 1;
build(rt<<1,l,mid); build(rt<<1|1,mid+1,r);
pushup(rt); len[rt] = len[rt<<1] + len[rt<<1|1];
}
void pushdown(int rt)
{
sum[rt<<1] += 1ll * tag[rt] * len[rt<<1];
sum[rt<<1|1] += 1ll * tag[rt] * len[rt<<1|1];
tag[rt<<1] += tag[rt]; tag[rt<<1|1] += tag[rt];
tag[rt] = 0;
}
void update(int rt,int l,int r,int L,int R)
{
if (L <= l && r <= R)
{
tag[rt]++; sum[rt] += len[rt];
return;
}
int mid = (l + r) >> 1;
pushdown(rt);
if (L <= mid) update(rt<<1,l,mid,L,R);
if (mid+1 <= R) update(rt<<1|1,mid+1,r,L,R);
pushup(rt);
}
ll query(int rt,int l,int r,ll k)
{
if (l == r) {pt = l; per = sum[rt] / len[rt]; return 0;}
int mid = (l + r) >> 1;
pushdown(rt);
if (sum[rt<<1] >= k) return query(rt<<1,l,mid,k);
else return query(rt<<1|1,mid+1,r,k-sum[rt<<1])+sum[rt<<1];
}
int main()
{
//freopen("1.in","r",stdin);
//freopen("mine.out","w",stdout);
scanf("%lld",&n);
//fo(i,1,n) cin>>l[i]>>r[i];
scanf("%lld%lld%lld%lld%lld%lld",&x[1],&x[2],&a1,&b1,&c1,&m1);
scanf("%lld%lld%lld%lld%lld%lld",&y[1],&y[2],&a2,&b2,&c2,&m2);
fo(i,3,n) x[i] = (a1*x[i-1]+b1*x[i-2]+c1) % m1;
fo(i,3,n) y[i] = (a2*y[i-1]+b2*y[i-2]+c2) % m2;
fo(i,1,n) l[i] = min(x[i],y[i]) + 1;
fo(i,1,n) r[i] = max(x[i],y[i]) + 1;
k = 0; fo(i,1,n) f[++k] = l[i],f[++k] = r[i];
sort(f+1,f+k+1);
m = 0;
fo(i,1,k)
if (f[i] != f[i-1])
{
if (f[i-1]+1 <= f[i]-1) {m++; L[m] = f[i-1]+1; R[m] = f[i]-1;}
m++; L[m] = R[m] = f[i];
}
if (f[k] != 1e9) {m++; L[m] = f[k] + 1; R[m] = 1e9;}
//fo(i,1,m) cout<<L[i]<<" "<<R[i]<<endl;
//cout<<endl;
num = 0; build(1,1,m);
fo(i,1,n)
{
lx = lower_bound(L+1,L+m+1,l[i]) - L;
rx = lower_bound(R+1,R+m+1,r[i]) - R;
update(1,1,m,lx,rx);
num += r[i] - l[i] + 1;
ask = (num + 1) / 2;
lnum = query(1,1,m,ask);
//cout<<l[i]<<" "<<r[i]<<" "<<lx<<" "<<rx<<" "<<num<<" "<<ask<<" "<<lnum<<" "<<pt<<endl;
ask = ask - lnum;
res = (ask - 1) / per + 1 + R[pt-1];
printf("%lld\n",res);
}
return 0;
}
H.pair
数数问题的经典dp做法就是用一个二进制位表示之前填的是是否等于上限,如果等于那么当前位就有限制,否则可以随意填。
用
f
[
i
]
[
x
]
[
y
]
f[i][x][y]
f[i][x][y]表示填到第
i
i
i位,
x
=
0
x=0
x=0表示前面填的数目前等于A,
x
=
1
x=1
x=1表示小于,
y
y
y同理,并且当前两个条件都未满足但都有可能满足(也就是说前面的and/xor都还等于C)
g
[
i
]
[
x
]
[
y
]
g[i][x][y]
g[i][x][y]表示两个条件中第一个条件还有可能满足,第二个条件不可能满足
h
[
i
]
[
x
]
[
y
]
h[i][x][y]
h[i][x][y]表示两个条件中第二个条件还有可能满足,第一个条件不可能满足
m
[
i
]
[
x
]
[
y
]
m[i][x][y]
m[i][x][y]表示条件已经满足
枚举当前位的四种情况即可
#include<iostream>
#include<cstdio>
#include<cstring>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define N 35
using namespace std;
int i,j,a,b,c,ax,bx,i1,j1,T,A,B,C,d;
long long f[N][2][2],g[N][2][2],h[N][2][2],m[N][2][2];
long long res;
void nxt()
{
if (i == 0)
{
if (a == 0)
{
if (ax == 0) i1 = 0; else i1 = -1;
} else
{
if (ax == 0) i1 = 1; else i1 = 0;
}
} else i1 = 1;
if (j == 0)
{
if (b == 0)
{
if (bx == 0) j1 = 0; else j1 = -1;
} else
{
if (bx == 0) j1 = 1; else j1 = 0;
}
} else j1 = 1;
}
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%d%d%d",&A,&B,&C);
int num = 0;
// fo(i,1,A)
// fo(j,1,B)
// if ((i & j) > C || (i ^ j) < C) num++;
// cout<<num<<endl;
// cout<<"----"<<endl;
memset(f,0,sizeof(f)); memset(g,0,sizeof(g));
memset(h,0,sizeof(h)); memset(m,0,sizeof(m));
f[0][0][0] = 1;
fo(d,1,30)
{
a = (1 << (30-d)) & A; a = (a > 0);
b = (1 << (30-d)) & B; b = (b > 0);
c = (1 << (30-d)) & C; c = (c > 0);
fo(i,0,1)
fo(j,0,1)
{
fo(ax,0,1)
fo(bx,0,1)
{
nxt();
if (i1 == -1 || j1 == -1) continue;
if ((ax & bx) == c && (ax ^ bx) == c) f[d][i1][j1] += f[d-1][i][j];
if ((ax & bx) < c && (ax ^ bx) == c) g[d][i1][j1] += f[d-1][i][j];
if ((ax & bx) == c && (ax ^ bx) > c) h[d][i1][j1] += f[d-1][i][j];
if ((ax & bx) > c || (ax ^ bx) < c) m[d][i1][j1] += f[d-1][i][j];
if ( (ax ^ bx) == c) g[d][i1][j1] += g[d-1][i][j];
if ( (ax ^ bx) < c) m[d][i1][j1] += g[d-1][i][j];
if ((ax & bx) == c ) h[d][i1][j1] += h[d-1][i][j];
if ((ax & bx) > c ) m[d][i1][j1] += h[d-1][i][j];
if ( 11 ) m[d][i1][j1] += m[d-1][i][j];
}
}
}
res = 0;
fo(i,0,1) fo(j,0,1) res += m[30][i][j];
res -= min(B,C-1);
res -= min(A,C-1);
res -= 1;
cout<<res<<endl;
}
return 0;
}
J.A+B problem
没啥好说的,模拟就好