QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#743789#9629. 小 C 的神秘图形1926406757WA 0ms3608kbC++20807b2024-11-13 20:01:492024-11-13 20:01:53

Judging History

你现在查看的是最新测评结果

  • [2024-11-13 20:01:53]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3608kb
  • [2024-11-13 20:01:49]
  • 提交

answer

#include<iostream>

#define int long long
using namespace std;
const int N=11;
int a[N];

signed main()
{
	cin.tie(0),cout.tie(0),ios::sync_with_stdio(false);
	int n;
	string a,b;
	cin>>n;
	cin>>a>>b;
	bool fa,fb;
	fa=fb=true;
	for(int i=0;i<n;i++) 
	{
		if(a[i]!='1') fa=false;
		if(b[i]!='1') fb=false;
	}
	if(fa||fb)
	{
		cout<<1<<endl;
		return 0;
	}
	// a=" "+a;
	// b=" "+b;
	if((a[0]=='0'||a[0]=='2')&&(b[0]=='0'||b[0]=='2'))
	{
		cout<<0<<endl;
		return 0;
	}
	int k=-1;
	for(int i=1;i<n;i++)
	{
		if(a[i]>='1'||b[i]>='1')
		{
			k=i;
			break;
		}
	}
	fa=fb=true;
	if(k!=-1)
	{
		for(int i=k;i<n;i++)
		{
			if(a[i]!='1')fa=false;
			if(b[i]!='1') fb=false;
		}
	}
	if(fa||fb)
	{
		cout<<1<<endl;
		return 0;
	}
	cout<<0<<endl;
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3520kb

input:

96
122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022
010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102

output:

0

result:

ok single line: '0'

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3608kb

input:

100
2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111
1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102

output:

0

result:

wrong answer 1st lines differ - expected: '1', found: '0'