NOI批量评测 - 记录详情

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

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	444 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	448 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	452 KiB
#7	Accepted 5	9ms	2.5 MiB
#8	Accepted 5	10ms	2.6 MiB
#9	Accepted 5	2ms	404 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	9ms	2.9 MiB
#12	Accepted 5	8ms	2.5 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	7ms	2.3 MiB
#16	Accepted 5	7ms	2.3 MiB
#17	Accepted 5	1ms	452 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	10ms	2.8 MiB
#20	Accepted 5	10ms	2.6 MiB

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

#define Reimu inline void
#define Marisa inline int

typedef long long LL;

const int N = 100010;

int n;
char t1[N], t2[N], b1[N], b2[N];
int s10[N], s11[N], s20[N], s21[N];
vector<int> v1, v2;

Reimu Sakuya() {
	v1.clear(); v2.clear();
	cin >> n >> t1 + 1 >> t2 + 1 >> b1 + 1 >> b2 + 1;
	for (int i = 1; i <= n; ++i) {
		s10[i] = s10[i - 1] + !(t1[i] & 1);
		s11[i] = s11[i - 1] + (t1[i] & 1);
		s20[i] = s20[i - 1] + !(t2[i] & 1);
		s21[i] = s21[i - 1] + (t2[i] & 1);
		if (!(b1[i] & 1)) v1.emplace_back(i);
		if (!(b2[i] & 1)) v2.emplace_back(i);
	}
	v1.emplace_back(n + 1); v2.emplace_back(n + 1);
	v1.emplace_back(0); v2.emplace_back(0);
	int ans = 0, k1 = 0, k2 = 0, las1 = 0, las2 = 0;
	int c1[] = {s10[v1[k1] - 1], s11[v1[k1] - 1]}, c2[] = {s20[v2[k2] - 1], s21[v2[k2] - 1]};
	while (v1[k1] && v2[k2]) {
		int i1 = v1[k1], i2 = v2[k2], len = min(i1, i2) - max(las1, las2) - 1,
			d0 = min(min(c1[0], c2[0]), len), d1 = min(min(c1[1], c2[1]), len);
		ans += d0 + d1;
		if (i1 < i2) {
			c2[0] -= d0; c2[1] -= d1;
			if (c2[t1[i1] & 1]) ++ans, --c2[t1[i1] & 1];
			las1 = i1; i1 = v1[++k1];
			c1[0] = s10[i1 - 1] - s10[las1];
			c1[1] = s11[i1 - 1] - s11[las1];
		} else if (i2 < i1) {
			c1[0] -= d0; c1[1] -= d1;
			if (c1[t2[i2] & 1]) ++ans, --c1[t2[i2] & 1];
			las2 = i2; i2 = v2[++k2];
			c2[0] = s20[i2 - 1] - s20[las2];
			c2[1] = s21[i2 - 1] - s21[las2];
		} else {
			ans += t1[i1] == t2[i2];
			las1 = i1; i1 = v1[++k1];
			c1[0] = s10[i1 - 1] - s10[las1];
			c1[1] = s11[i1 - 1] - s11[las1];
			las2 = i2; i2 = v2[++k2];
			c2[0] = s20[i2 - 1] - s20[las2];
			c2[1] = s21[i2 - 1] - s21[las2];
		}
	}
	cout << ans - 1 << '\n';
}

int main() {
	freopen("edit.in", "r", stdin);
	freopen("edit.out", "w", stdout);
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int T; cin >> T; while (T--) Sakuya();
	return 0;
}

递交者: ZJ-0033
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 ZJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.9 KiB
递交时间: 2024-12-6 17:59:23
评测时间: 2024-12-6 17:59:32

分数: 100
总耗时: 87ms
峰值时间: 10ms
峰值内存: 2.9 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录