0pts(求大佬帮)
查看原帖
0pts(求大佬帮)
1528610
Binary_memory楼主2024/12/7 12:00

(只是一个刚入门的屑,来看看NOIP难度的)

代码:
cpp

#include<bits/stdc++.h>
#define l(num,in) for(int  in =1; in <=num; in ++)
using namespace std;
int T,n;
char s1[11][100001],s2[11][100001];
char t1[11][100001],t2[11][100001];
void editstring(int o)
{
	l(n,i)
	{
		l(n,j)
		{
			if(s1[o][i]==s2[o][j] and t1[o][i]=='1' and t2[o][j]=='1')
			    swap(s2[o][i],s2[o][j]);
		}
	}
}
int main()
{

	cin>>T;
	l(T,i)
	{
		cin>>n;
		l(n,j) cin>>s1[i][j];
		l(n,j) cin>>s2[i][j];
		l(n,j) cin>>t1[i][j];
		l(n,j) cin>>t2[i][j];
	}
	l(T,o) editstring(o);
	int sum=0;
	l(T,i)
	{
		l(n,j) if(s1[i][j]==s2[i][j]) sum++;
		cout<<sum<<endl;
	}
    return 0;
}

样例过了的,但

评测状态 Unaccepted
评测分数 0

原题传送门:编辑字符串

2024/12/7 12:00
加载中...