Codeforces Global Round 21
A:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
return x*f;
}
const int N=2010;
ll a[N];
int main()
{
int T=read();
while(T--)
{
int n=read(),z=read();
for(int i=1;i<=n;i++)a[i]=read();
ll ans1=0,ans2=0;
for(int i=1;i<=n;i++)
{
ans1=max(ans1,z&a[i]);
ans2=max(ans2,z|a[i]);
}
printf("%lld\n",max(ans1,ans2));
}
return 0;
}
B:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
return x*f;
}
const int N=100010;
int a[N];
int main()
{
int T=read();
while(T--)
{
int n=read();
ll sum=0;
for(int i=1;i<=n;i++)a[i]=read(),sum+=a[i];
a[n+1]=0;
if(sum==0)
{
printf("0\n");
continue;
}
int op=0;
sum=0;
for(int i=1;i<=n+1;i++)
{
if(a[i]!=0&&op==0)
{
op=1;
continue;
}
if(a[i]==0&&op==0)continue;
if(a[i]!=0&&op==1)continue;
if(a[i]==0&&op==1)
{
sum++;
op=0;
}
}
printf("%d\n",min(sum,2ll));
}
return 0;
}
C:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
return x*f;
}
const int N=50010;
int x[N];
struct QWQ{
int id;
ll sum;
}a[N],b[N];
int main()
{
int T=read();
while(T--)
{
int n=read(),m=read();
for(int i=1;i<=n;i++)x[i]=read();
int id1=0,id2=0;
for(int i=1;i<=N-10;i++)
{
a[i].id=a[i].sum=0;
b[i].id=b[i].sum=0;
}
for(int i=1;i<=n;i++)
{
int op=1;
while(x[i]%m==0)
{
op*=m;
x[i]/=m;
}
if(a[id1].id==x[i])a[id1].sum+=op;
else
{
id1++;
a[id1].id=x[i];
a[id1].sum+=op;
}
}
n=read();
for(int i=1;i<=n;i++)x[i]=read();
for(int i=1;i<=n;i++)
{
int op=1;
while(x[i]%m==0)
{
op*=m;
x[i]/=m;
}
if(b[id2].id==x[i])b[id2].sum+=op;
else
{
id2++;
b[id2].id=x[i];
b[id2].sum+=op;
}
}
bool ans=true;
for(int i=1;i<=id1;i++)
{
if((a[i].id!=b[i].id)||(a[i].sum!=b[i].sum))
{
ans=false;
break;
}
}
if(id1!=id2)ans=false;
// for(int i=1;i<=id1;i++)cout<<a[i].sum<<" ";
// cout<<endl;
// for(int i=1;i<=id1;i++)cout<<b[i].sum<<" ";
if(ans)printf("Yes\n");
else printf("No\n");
}
return 0;
}
D:
#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;
#define int long long
const int N = 1e6 + 10;
int n, m;
int a[N], b[N];
int l[N], r[N], l1[N], r1[N];
signed main()
{
int t;
cin >> t;
while (t--)
{
int id = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
if (a[i] == 1)
id = i;
}
l[1] = 1,r[1] = 1,l1[n] = n,r1[n] = n;
for (int i = 2; i <= n; i++)
{
l[i] = l[i - 1];
r[i] = r[i - 1];
if (a[i] > a[r[i]]) r[i] = i;
if (a[i] < a[l[i]]) l[i] = i;
}
for (int i = n-1; i>=1; i--)
{
l1[i] = l1[i + 1];
r1[i] = r1[i + 1];
if (a[i] > a[r1[i]]) r1[i] = i;
if (a[i] < a[l1[i]]) l1[i] = i;
}
int l_1 = id, r_1 = id;
int flag = 0;
int ans = 0;
while (l_1 != 1)
{
if (flag & 1)
l_1 = l[l_1 - 1];
else
l_1 = r[l_1 - 1];
flag ^= 1;
ans++;
}
flag = 0;
while (r_1 != n)
{
if (flag & 1)
r_1 = l1[r_1 + 1];
else
r_1 = r1[r_1 + 1];
flag ^= 1;
ans++;
}
cout << ans << endl;
}
}