NOI批量评测 - 记录详情

foo.cc: In function 'void solve()':
foo.cc:11:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         cin >> n >> s1 + 1 >> s2 + 1 >> t1 + 1 >> t2 + 1;
      |                     ~~~^~~
foo.cc:11:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         cin >> n >> s1 + 1 >> s2 + 1 >> t1 + 1 >> t2 + 1;
      |                               ~~~^~~
foo.cc:11:44: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         cin >> n >> s1 + 1 >> s2 + 1 >> t1 + 1 >> t2 + 1;
      |                                         ~~~^~~
foo.cc:11:54: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         cin >> n >> s1 + 1 >> s2 + 1 >> t1 + 1 >> t2 + 1;
      |                                                   ~~~^~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	396 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	9ms	792 KiB
#8	Accepted 5	10ms	788 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	1ms	408 KiB
#11	Accepted 5	10ms	788 KiB
#12	Accepted 5	10ms	788 KiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	9ms	788 KiB
#16	Accepted 5	8ms	788 KiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	12ms	788 KiB
#20	Accepted 5	11ms	788 KiB

#include<bits/stdc++.h>
using namespace std;

const int N = 100010;
int n;
char s1[N], s2[N], t1[N], t2[N];
int c1[2], c2[2];
int ans;

void solve(){
	cin >> n >> s1 + 1 >> s2 + 1 >> t1 + 1 >> t2 + 1;
	s1[0] = '0', s2[0] = '0';
	t1[n + 1] = t2[n + 1] = '0';
	s1[n + 1] = '0', s2[n + 1] = '1';
	
	int r1 = 1, r2 = 1, st = 0;
	ans = 0;
	memset(c1, 0, sizeof c1);
	memset(c2, 0, sizeof c2);
	
//	cerr << "ok\n";
	while(r1 <= n || r2 <= n){
		while(r1 <= n + 1 && t1[r1] != '0'){
			r1 ++;
			if(r1 - 1 > st){
				if(s1[r1 - 1] == '0') c1[0] ++;
				else c1[1] ++;
			}
		}
		while(r2 <= n + 1 && t2[r2] != '0'){
			r2 ++;
			if(r2 - 1 > st){
				if(s2[r2 - 1] == '0') c2[0] ++;
				else c2[1] ++;
			}
		}
//		cerr << r1 << ' ' << r2 << ' ' << c1[0] << ' ' << c1[1] << ' ' << c2[0] << ' ' << c2[1] << ' ' << ans << '\n';
		
		if(r1 > r2){
			int nc0, nc1;
			ans += min(c1[0], c2[0]) + min(c1[1], c2[1]);
			nc0 = c1[0] - min(c1[0], c2[0]) + min(0, c1[1] - c2[1]);
			nc1 = c1[1] - min(c1[1], c2[1]) + min(0, c1[0] - c2[0]);
			c1[0] = nc0, c1[1] = nc1;
			c2[0] = c2[1] = 0;
			st = r2;
			
			int c = s2[r2] - '0';
//			cerr << c << '\n';
			if(c1[c]) ans ++, c1[c] --;
			else c1[c ^ 1] --;
			
			r2 ++;
		}
		else if(r1 < r2){
			int nc0, nc1;
			ans += min(c1[0], c2[0]) + min(c1[1], c2[1]);
			nc0 = c2[0] - min(c1[0], c2[0]) + min(0, c2[1] - c1[1]);
			nc1 = c2[1] - min(c1[1], c2[1]) + min(0, c2[0] - c1[0]);
			c2[0] = nc0, c2[1] = nc1;
			c1[0] = c1[1] = 0;
			st = r1;
			
			int c = s1[r1] - '0';
			if(c2[c]) ans ++, c2[c] --;
			else c2[c ^ 1] --;
			
			r1 ++;
		}
		else {
			ans += min(c1[0], c2[0]) + min(c1[1], c2[1]);
			c1[0] = c1[1] = c2[0] = c2[1] = 0;
			st = r1;
			
			if(s1[r1] == s2[r2]) ans ++;
			r1 ++, r2 ++;
		}
//		cerr << r1 << ' ' << r2 << ' ' << c1[0] << ' ' << c1[1] << ' ' << c2[0] << ' ' << c2[1] << ' ' << ans << '\n';
		//if(r1 >= n + 1 && r2 >= n + 1) break;
	}
	
	cout << ans << '\n';
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	freopen("edit.in", "r", stdin);
	freopen("edit.out", "w", stdout);
	
	int T;
	cin >> T;
	while(T --)
		solve();

	return 0;
}

/*
10
0110111100
1111111100
1110000100
0110111011
*/

递交者: SH-0121
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 SH】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 2.2 KiB
递交时间: 2024-12-6 17:24:54
评测时间: 2024-12-6 17:25:15

分数: 100
总耗时: 93ms
峰值时间: 12ms
峰值内存: 792 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录