前言
省赛降至,我却还是这么菜(x
一、A. Prof. Slim
正数,负数,绝对值的考虑
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pr;
const int inf =0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define in freopen("in.txt","r",stdin)
#define out freopen("out.txt","w",stdout)
#define ms(x,a) memset(x,a,sizeof(x))
#define ll long long
#define pb push_back
#define pr pair<int,int>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define rg register int//卡常
#define ONLINE_JUDGE
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxe=1e6+5;
int n,m,a[maxn];
void solve()
{
int pos=0,neg=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]>0) pos++;
else neg++;
}
for(int i=2;i<=neg;i++){
if(abs(a[i])>abs(a[i-1])){
printf("NO\n");return;
}
}
for(int i=neg+1;i<n;i++){
if(abs(a[i])>abs(a[i+1])){
printf("NO\n");return;
}
}
printf("YES\n");return ;
}
int main()
{
int t=1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
二、B. Dorms War
可以想成是一个超级块,每次往前移动一格,然后碰到相同的超级块就融合成一个格子,这样每次减少的块会变少,在一个块后面的块与当前块无关
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pr;
const int inf =0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define in freopen("in.txt","r",stdin)
#define out freopen("out.txt","w",stdout)
#define ms(x,a) memset(x,a,sizeof(x))
#define ll long long
#define pb push_back
#define pr pair<int,int>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define rg register int//卡常
#define ONLINE_JUDGE
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxe=1e6+5;
int n,m;
char s[maxn];
void solve()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%d",&m);
vector<char> special;
char tmp;
//scanf("%c",&tmp);
for(int i=1;i<=m;i++){
scanf("%c",&tmp);
scanf("%c",&tmp);
//cout<<tmp<<endl;
special.pb(tmp);
}
vector<int> a;
int nxt=1;
int ans=0;
for(int i=1;i<=n;i++){
for(auto p : special){
if(p==s[i]){
a.pb(i-nxt);
nxt=i;
}
}
}
for(int i=0;i<a.size();i++) ans=max(ans,a[i]);
printf("%d\n",ans);
}
int main()
{
int t=1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
三、C. Where is the Pizza?
可以考虑成一个群,里面的元素,即a和b中一定会构成一个重复的循环,因为ci必选ai或者bi(假设选ai),所以在另一处j,因为bj=ai(一定存在),故此处只能选aj,如此看待就是2的q次方
但是注意已经选的c和ai==bi处是需要剔除的
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pr;
const int inf =0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define in freopen("in.txt","r",stdin)
#define out freopen("out.txt","w",stdout)
#define ms(x,a) memset(x,a,sizeof(x))
#define ll long long
#define pb push_back
#define pr pair<int,int>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define rg register int//卡常
#define ONLINE_JUDGE
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxe=1e6+5;
int n,m;
int a[maxn],b[maxn],c[maxn];
int index[maxn][2];
int vis[maxn];
bool ct[maxn];
ll qpow(ll a,int k){
ll ans=1;
while(k){
if(k&1){
ans = (ans * a) % mod;
}
a = (a * a) % mod;
k >>= 1;
}
return ans;
}
void solve()
{
scanf("%d",&n);
for(int i=1;i<=n;i++){
ct[i]=false;vis[i]=0;
}
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
index[a[i]][0]=i;
}
for(int i=1;i<=n;i++){
scanf("%d",&b[i]);
index[b[i]][1]=i;
}
vector<int> tot;
for(int i=1;i<=n;i++){
scanf("%d",&c[i]);
if(c[i]) tot.pb(i);
}
int cnt=1;
for(int i=1;i<=n;i++){
if(vis[i]) continue;
int now=i;
while(1){
now=index[b[index[a[now]][0]]][0];
vis[now]=cnt;
if(now==i) break;
}
if(a[i]!=b[i]) cnt++;
}
int off=0;
for(int p : tot){
if(a[p]==b[p]) continue;
if(ct[vis[p]]) continue;
off++;
ct[vis[p]]=true;
}
printf("%lld\n",qpow(2,cnt-1-off));
}
int main()
{
//out;
int t=1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
四、D. Very Suspicious
这题vp的时候一直被卡住了,一直在找规律,气死了,明明已经找到规律了,但是没有意识到
这个cal()是看别人的题解,直呼妙哉-。-
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pr;
const int inf =0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define in freopen("in.txt","r",stdin)
#define out freopen("out.txt","w",stdout)
#define ms(x,a) memset(x,a,sizeof(x))
#define ll long long
#define pb push_back
#define pr pair<int,int>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define rg register int//卡常
#define ONLINE_JUDGE
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxe=1e6+5;
int n,m;
ll cal(int x)
{
int a=x/3;
x-=a;
int b=x/2;
x-=b;
return 2ll*(1ll*x*a+1ll*x*b+1ll*a*b);
//ll tot=a*a;
//ll cnt=a+
}
void solve()
{
scanf("%d",&n);
int l=1,r=1e6;
int mid;
while(l<r){
mid=((r-l)>>1)+l;
if(cal(mid)<n){
l=mid+1;
}else{
r=mid;
}
}
printf("%d\n",r);
}
int main()
{
int t=1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
五、E. Hemose on the Tree
此题有一个结论,反正我是猜出来的,因为隔得提示很明显了,就是路径的值不会小于n
就是路径异或的结果最理想的情况就是n(2的p次方)
就是去想一条路我当前的值最高位为1的话,下一个数字第一位也必须为1,这样就使得异或结果小于n,而当前第一位为0的话,下一位只要不大于n,不论怎么异或都不可能大于n
所以去构造形成一个 i^(i+n)的情况
然后就是dfs,结束
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pr;
const int inf =0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define in freopen("in.txt","r",stdin)
#define out freopen("out.txt","w",stdout)
#define ms(x,a) memset(x,a,sizeof(x))
#define ll long long
#define pb push_back
#define pr pair<int,int>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define rg register int//卡常
#define ONLINE_JUDGE
const int mod=1e9+7;
const int maxn=3e5+10;
const int maxe=1e6+5;
int n,m;
struct node{
int to,id;
};
vector<struct node> g[maxn];
int node[maxn];
int edge[maxn];
//set<int> st1,st2;
int off;
void dfs(int now,int father,int weight)
{
for(int i=0;i<g[now].size();i++){
int v=g[now][i].to;
if(v==father) continue;
if(weight!=0){
//node[now]=*st2.begin();
node[v]=off;
edge[g[now][i].id]=off+m;
off++;
dfs(v,now,0);
}else{
node[v]=off+m;
edge[g[now][i].id]=off;
off++;
dfs(v,now,m);
}
}
}
void solve()
{
off=1;
scanf("%d",&n);
m=pow(2,n);
for(int i=1;i<=m;i++){
g[i].clear();
}
int x,y;
for(int i=1;i<m;i++){
scanf("%d %d",&x,&y);
g[x].pb({y,i});g[y].pb({x,i});
// st1.insert(i);
// st2.insert(i+m);
}
node[1]=m;
dfs(1,-1,m);
printf("1\n");
for(int i=1;i<=m;i++){
printf("%d ",node[i]);
}
printf("\n");
for(int i=1;i<m;i++){
printf("%d ",edge[i]);
}
printf("\n");
}
int main()
{
out;
int t=1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}