2025山东CCPC题解

文章目录

• L - Stella
• D - Distributed System
• I - Square Puzzle
• E - Greatest Common Divisor
• G - Assembly Line

  L - Stella

  题目来源：L - Stella

  

  解题思路

  签到题，因为给出的字母不是按顺序，可以存起来赋其值，然后在比较。

  代码实现

  #include
  #define int long long
  #define endl '\n'
  #define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
  using namespace std;
  const int N=1e5+5;
  void solve()
  {
  	mapmp;
  	mp['O']=1;
  	mp['B']=2;
  	mp['A']=3;
  	mp['F']=4;
  	mp['G']=5;
  	mp['K']=6;
  	mp['M']=7;
  	string s1,s2;
  	cin>>s1>>s2;
  	if(mp[s1[0]]
  		cout
  		cout
  		if(s1[1]
  			cout
  			cout
  			cout
  	IOS;
  	int _=1;
  	cin_;
  	while(_--)solve(); 
  	return 0;
  } 
  
  	cinnq;
  	vector
  		cinxy;
  		sum+=x/n;
  		x%=n;
  		a[y]++;
  		a[y+x]--;
  	}
  	ans[0]=a[0];
  	for(int i=1;i
  	IOS;
  	int _=1;
  	cin_;
  	while(_--)solve(); 
  	return 0;
  } 
  
  	if(op==1)
  	{
  		char t=a[0];
  		a[0]=a[2],a[2]=a[1],a[1]=t;
  		return a;
  	}
  	if(op==2)
  	{
  		char t=a[3];
  		a[3]=a[5],a[5]=a[4],a[4]=t;
  		return a;
  	}
  	if(op==3)
  	{
  		char t=a[6];
  		a[6]=a[8],a[8]=a[7],a[7]=t;
  		return a;
  	}
  }
  string xiayi(string a,int op)//下移函数 
  {
  	if(op==1)
  	{
  		char t=a[0];
  		a[0]=a[6],a[6]=a[3],a[3]=t;
  		return a;
  	 } 
  	 if(op==2)
  	 {
  	 	char t=a[1];
  	 	a[1]=a[7],a[7]=a[4],a[4]=t;
  	 	return a;
  	 }
  	 if(op==3)
  	 {
  	 	char t=a[2];
  	 	a[2]=a[8],a[8]=a[5],a[5]=t;
  	 	return a;
  	 }
  } 
  string xuanzhuan(string a)//顺时针旋转函数 
  {
  	char t=a[0];
  	a[0]=a[6],a[6]=a[8],a[8]=a[2],a[2]=t;
   	t=a[1];
   	a[1]=a[3],a[3]=a[7],a[7]=a[5],a[5]=t;
   	return a;
  }
  void bfs()
  {
  	q.push("123456789");
  	ans["123456789"]=0;
  	while(q.size())
  	{
  		string g=q.front();
  		q.pop();
  		string t;
  		t=youyi(g,1);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1;
  		t=youyi(g,2);
  		if(ans[t]==0 )q.push(t),ans[t]=ans[g]+1;
  		t=youyi(g,3);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1;
  		t=xiayi(g,1);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1;
  		t=xiayi(g,2);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1;
  		t=xiayi(g,3);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1;
  		t=xuanzhuan(g);
  		if(ans[t]==0) q.push(t),ans[t]=ans[g]+1; 
  	}
  }
  void solve()
  {
      string s;
      map
      	char ch;
      	cinch;
      	mp[ch]='0'+i;
  	}
  	for(int i=1;i
  		char ch;
  		cinch;
  		s+=mp[ch];
  	}
  	if(s=="123456789")cout
  	IOS;
  	bfs(); 
  	int _=1;
  	cin_;
  	while(_--)solve(); 
  	return 0;
  } 
  
     cinnk;
     for(int i=1;i
     	cinwt;
     	a[i]=k-w+t;
     }
     sort(a+1,a+1+n);
     for(int i=1;i
  	IOS;
  	int _=1;
  	cin_;
  	while(_--)solve(); 
  	return 0;
  }