NOI批量评测 - 记录详情

foo.cc: In function 'void gets1(int)':
foo.cc:22:17: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[100005]' [-Wformat=]
   22 |         scanf("%s", &inpp);
      |                ~^   ~~~~~
      |                 |   |
      |                 |   char (*)[100005]
      |                 char*
foo.cc: In function 'void gets2(int)':
foo.cc:33:17: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[100005]' [-Wformat=]
   33 |         scanf("%s", &inpp);
      |                ~^   ~~~~~
      |                 |   |
      |                 |   char (*)[100005]
      |                 char*
foo.cc: In function 'void dontcg1(int)':
foo.cc:41:17: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[100005]' [-Wformat=]
   41 |         scanf("%s", &inpp);
      |                ~^   ~~~~~
      |                 |   |
      |                 |   char (*)[100005]
      |                 char*
foo.cc: In function 'void dontcg2(int)':
foo.cc:62:17: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[100005]' [-Wformat=]
   62 |         scanf("%s", &inpp);
      |                ~^   ~~~~~
      |                 |   |
      |                 |   char (*)[100005]
      |                 char*
foo.cc:76:21: warning: statement has no effect [-Wunused-value]
   76 |                 spb == false;
      |                 ~~~~^~~~~~~~
foo.cc:79:21: warning: statement has no effect [-Wunused-value]
   79 |                 spb == false;
      |                 ~~~~^~~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Wrong Answer 0 Standard answer longer than user output.	1ms	324 KiB
#2	Wrong Answer 0 读取到 4，应为 6。	2ms	404 KiB
#3	Wrong Answer 0 User output longer than standard answer.	1ms	324 KiB
#4	Wrong Answer 0 读取到 3，应为 7。	1ms	404 KiB
#5	Accepted 5	1ms	320 KiB
#6	Accepted 5	2ms	404 KiB
#7	Accepted 5	14ms	876 KiB
#8	Accepted 5	14ms	872 KiB
#9	Wrong Answer 0 读取到 525，应为 833。	1ms	324 KiB
#10	Wrong Answer 0 读取到 506，应为 908。	1ms	408 KiB
#11	Wrong Answer 0 读取到 39399，应为 58101。	14ms	828 KiB
#12	Wrong Answer 0 读取到 41767，应为 71781。	15ms	856 KiB
#13	Wrong Answer 0 读取到 447，应为 857。	1ms	404 KiB
#14	Wrong Answer 0 读取到 503，应为 905。	2ms	404 KiB
#15	Wrong Answer 0 读取到 43439，应为 67401。	15ms	880 KiB
#16	Wrong Answer 0 读取到 47340，应为 90720。	15ms	992 KiB
#17	Wrong Answer 0 读取到 487，应为 829。	1ms	404 KiB
#18	Wrong Answer 0 读取到 461，应为 835。	1ms	404 KiB
#19	Wrong Answer 0 读取到 54922，应为 88792。	15ms	828 KiB
#20	Wrong Answer 0 读取到 42503，应为 71299。	14ms	788 KiB

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>

using namespace std;
#define rg register
#define MAXN 100005
int T; //����T
int n; //����n 
bool s1[MAXN], s2[MAXN]; //�ַ��� 
int ans = 0; //�� 
//tx,i=1��ʾsx��i����Խ�������֮���� 
bool t1[MAXN], t2[MAXN];

//��¼��������A 
bool spa = true;
//��ȡ�ַ��� 
inline void gets1(int n) {
	char inpp[MAXN];
	scanf("%s", &inpp);
	for(rg int i = 0 ; i < n ; ++i) {
		s1[i+1] = (bool)(inpp[i]-'0');
		
		if(spa == true && i>0 && s1[i+1] != s1[i]) {
			spa = false;
		}
	}
}
inline void gets2(int n) {
	char inpp[MAXN];
	scanf("%s", &inpp);
	for(rg int i = 0 ; i < n ; ++i) {
		s2[i+1] = (bool)(inpp[i]-'0');
	}
}
//��¼���ɽ����� 
inline void dontcg1(int n) {
	char inpp[MAXN];
	scanf("%s", &inpp);
	for(rg int i = 0 ; i < n ; ++i) {
		t1[i+1] = (bool)(inpp[i]-'0');
	}
	//����ֻ��t��������ݲ��ɶ�
	//����������ڶ����ɶ���ô��������ڱ��Ȳ��ɶ� 
	for(rg int i = 2 ; i < n ; ++i) {
		if(t1[i-1] == false && t1[i+1] == false) {
			t1[i] = false;
		}
	}
	if(t1[2] == false) {
		t1[1] = false;
	}
	if(t1[n-1] == false) {
		t1[n] = false;
	}
}
bool spb = true;
inline void dontcg2(int n) {
	char inpp[MAXN];
	scanf("%s", &inpp);
	for(rg int i = 0 ; i < n ; ++i) {
		t2[i+1] = (bool)(inpp[i]-'0');
	}
	//����ֻ��t��������ݲ��ɶ�
	//����������ڶ����ɶ���ô��������ڱ��Ȳ��ɶ� 
	if(t2[2] == false) {
		t2[1] = false;
	}
	if(t2[n-1] == false) {
		t2[n] = false;
	}
	//�ж���������b 
	if(spb == true && t1[1] != t2[1]) {
		spb == false;
	}
	if(spb == true && t1[n] != t2[n]) {
		spb == false;
	}
	for(rg int i = 2 ; i < n ; ++i) {
		if(t2[i-1] == false && t2[i+1] == false) {
			t2[i] = false;
		}
		if(spb == true && t1[i] != t2[i]) {
			spb = false;
		}
	}
	
}

//��������A����
inline void getaans(int n) {
	for(int i = 1 ; i <= n ; ++i) {
		if(s1[i] != s2[i]) {
			ans--;
		}
	}
	
	printf("%d\n", ans);
} 
//��������B����
#define jdzcut(a, b) ((a)>(b))?((a)-(b)):((b)-(a))
inline void getbans(int n) {
	//����ַ������λ�ò��ɽ���
	//���ַ����ȣ���ز����ܶ�Ӧ�� 
	for(int i = 1 ; i <= n ; ++i) {
		if(t1[i] == false && t2[i] == false && s1[i] != s2[i]) {
			ans--;
		}
	
	}
	int sgm1 = 0, sgm2 = 0;
	for(int i = 1 ; i <= n ; ++i) {
		if(t1[i]) {
			sgm1 += s1[i];
			sgm2 += s2[i];
		} else {
			ans = ans - (jdzcut(sgm1,sgm2));
			sgm1 = 0;
			sgm2 = 0;
		}
	}
	printf("%d\n", ans);
} 

//���Գ��� 
//inline void testoutput() {
//	printf("n=%d, sp_a=%d, sp_b=%d\n", n, spa, spb);
//	for(int i = 1 ; i <= n ; ++i) {
//		printf("now=%d, s1=%d, s2=%d, t1=%d, t2=%d\n", 
//		i, s1[i], s2[i], t1[i], t2[i]);
//	}
//}
//����ע�� 

int main() {
	freopen("edit.in", "r", stdin);
	freopen("edit.out", "w", stdout);
	
	//���� 
	scanf("%d", &T);
	while(T--) {
		//ÿ�����ݵ����봦�� 
		scanf("%d", &n);
		gets1(n);
		gets2(n);
		dontcg1(n);
		dontcg2(n);
		
		//��ʼ���� 
		ans = n;
		spa = true;
		spb = true;
		
		//���Գ��� 
//		testoutput();
		
		//��������A
		if(spa) {
			getaans(n);
			continue;
		} 
		//��������B
		if(spb) {
			getbans(n);
			continue;
		} 
		
		 
		
		//���Գ���
		printf("%d\n", ans);
	}
		
	return 0;
}

递交者: TJ-0089
题目: NOIP2024A NOIP2024A
比赛: 【民间数据】NOIP2024 TJ 批量测试
语言: C++14(O2)
代码长度: 3.2 KiB
递交时间: 2024-12-1 0:49:50
评测时间: 2024-12-1 0:59:45

分数: 20
总耗时: 133ms
峰值时间: 15ms
峰值内存: 992 KiB

20 Wrong Answer

代码

信息

还没有账户？

登录