A. Min Or Sum
(https://codeforces.com/contest/1635/problem/A)[https://codeforces.com/contest/1635/problem/A]
无限次操作,那就是最后剩一个数,其他都是0。
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[200];
void solve()
{
scanf("%d",&n);
long long s=0;
for (int i=1; i<=n; i++) {
scanf("%lld",&a[i]);
s|=a[i];
}
printf("%lld\n",s);
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
B. Avoid Local Maximums
https://codeforces.com/contest/1635/problem/B
贪心
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int a[MAXN];
int n;
void solve()
{
scanf("%d",&n);
for (int i=1; i<=n; i++) {
scanf("%d",&a[i]);
}
int cnt=0;
for (int i=2; i<n; i++) {
if (a[i]>a[i-1] && a[i]>a[i+1]) {
if (i+2<=n)
a[i+1]=max(a[i+2],a[i]);
else
a[i+1]=a[i];
cnt++;
}
}
printf("%d\n",cnt);
for (int i=1; i<=n; i++)
printf("%d ",a[i]);
puts("");
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
C. Differential Sorting
https://codeforces.com/contest/1635/problem/C
看代码吧
#include <bits/stdc++.h>
using namespace std;
const int MAXN=200005;
int n;
long long a[MAXN];
void solve()
{
scanf("%d",&n);
for (int i=1; i<=n; i++) {
scanf("%lld",&a[i]);
}
if (a[n]<0) {
for (int i=2; i<=n; i++)
if (a[i]<a[i-1]) {
puts("-1");
return;
}
puts("0");
return;
}
else {
if (a[n-1]>a[n]) {
puts("-1");
return;
}
printf("%d\n",n-2);
for (int i=n-2; i>=1; i--) {
printf("%d %d %d\n",i,i+1,n);
}
}
}
int main()
{
int ttt;
scanf("%d",&ttt);
while (ttt--) {
solve();
}
return 0;
}
D. Infinite Set
https://codeforces.com/contest/1635/problem/D
两种操作看成二进制下右边加一个1或者加两个0。若固定要加的长度n,那么可以算出可能的方案有 Fab[n] 种(Fab[1]=1,Fab[2]=2,Fab[i]=Fab[i-1]+Fab[i-2]),求法可以考虑对0的数量再针对1来插板组合。若给出的数中存在a,b,且 a 可以通过这两种操作变成 b ,那么 b 就可以忽略。清除完这样重复的之后,剩下的怎么操作都不会有交集,所以分别对这些数剩下的位数对应的Fab前缀和加到ans就行了。
去重的操作,可以用Trie。
#include <bits/stdc++.h>
using namespace std;
const long long Ha=1000000007;
const int MAXN=200005;
int n,p;
int a[MAXN];
int T[10000000][2];
int fa[10000000];
int done[10000000];
int Root=0;
int num;
long long ans;
long long Fab[MAXN];
long long sFab[MAXN];
long long ssFab[MAXN];
void bui(long long v)
{
vector<int> tmp;
for (; v; v>>=1)
tmp.push_back(v&1);
int X=0;
for (int i=tmp.size()-1; i>=0; i--) {
int nxt=tmp[i];
if (T[X][nxt]==0) {
T[X][nxt]=++num;
}
X=T[X][nxt];
}
done[X]=1;
}
void dfs(int X, int c0, int c1, int flag, int dep, int cur)
{
if (dep>p) {
return;
}
if (done[X]) {
if (flag || (!c0 && cur==0)) {
if (p-dep>0)
ans+=sFab[(p-dep)];
ans++;
ans%=Ha;
c0=1;
flag=0;
}
}
if (T[X][0]) {
if (cur==1)
dfs(T[X][0], 0, flag==0, flag, dep+1, 0);
else
dfs(T[X][0], c1, c0, flag, dep+1,0);
}
if (T[X][1]) {
if (!c0 && cur==0)
dfs(T[X][1], 0, 0, 1, dep+1,1);
else
dfs(T[X][1], 0, 0, flag, dep+1,1);
}
}
void solve()
{
ans=0;
num=0;
scanf("%d%d",&n,&p);
for (int i=1; i<=n; i++) {
scanf("%d",&a[i]);
bui(a[i]);
}
dfs(Root, 0, 0, 1, 0, -1);
int aaans=ans;
printf("%d\n",aaans);
}
int main()
{
Fab[1]=1;
Fab[2]=2;
for (int i=3; i<MAXN; i++)
Fab[i]=(Fab[i-1]+Fab[i-2])%Ha;
for (int i=1; i<MAXN; i++)
sFab[i]=(sFab[i-1]+Fab[i])%Ha;
solve();
return 0;
}
/*
10 10
2 24 88 166 176 227 263 264 280 330
5 6
25 26 49 52 65
*/