NOI批量评测 - 记录详情

foo.cc: In function 'void steveyang137::solve()':
foo.cc:53:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   53 |         auto [l2,r2,b2,w2]=b[j];
      |              ^
foo.cc:54:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   54 |         for(auto [l1,r1,b1,w1]:a) {
      |                  ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	2ms	404 KiB
#2	Accepted 5	2ms	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	7ms	1.6 MiB
#8	Accepted 5	7ms	1.7 MiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	2ms	404 KiB
#11	Accepted 5	7ms	1.6 MiB
#12	Accepted 5	8ms	1.8 MiB
#13	Accepted 5	1ms	408 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	8ms	1.6 MiB
#16	Accepted 5	7ms	1.5 MiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	7ms	1.6 MiB
#20	Accepted 5	7ms	1.6 MiB

#include<iostream>
#include<string>
#include<vector>
using namespace std;

namespace steveyang137 {

typedef pair<int,int> pii;
const int MAXN=1e5+5;
int n;
string s1,s2,t1,t2;
int sum1[MAXN],sum2[MAXN];
struct node {
	int l,r,b,w;
};
vector<node> a,b;
int ans;

void solve() {
	cin>>n;
	cin>>s1>>s2>>t1>>t2;
	for(int i=0;i<n;i++)
		sum1[i+1]=sum1[i]+s1[i]-'0';
	for(int i=0;i<n;i++)
		sum2[i+1]=sum2[i]+s2[i]-'0';

	int las=0;
	for(int i=1;i<=n;i++)
		if(t1[i-1]=='0') {
			if(i!=las+1)
			a.push_back({las+1,i-1,sum1[i-1]-sum1[las],i-1-las-(sum1[i-1]-sum1[las])});
			a.push_back({i,i,sum1[i]-sum1[i-1],1-(sum1[i]-sum1[i-1])});
			las=i;
		}
	if(las!=n)
	a.push_back({las+1,n,sum1[n]-sum1[las],n-las-(sum1[n]-sum1[las])});

	las=0;
	for(int i=1;i<=n;i++)
		if(t2[i-1]=='0') {
			if(i!=las+1)
			b.push_back({las+1,i-1,sum2[i-1]-sum2[las],i-1-las-(sum2[i-1]-sum2[las])});
			b.push_back({i,i,sum2[i]-sum2[i-1],1-(sum2[i]-sum2[i-1])});
			las=i;
		}
	if(las!=n)
	b.push_back({las+1,n,sum2[n]-sum2[las],n-las-(sum2[n]-sum2[las])});


	// for(auto [l,r,b,w]:a) cout<<l<<" "<<r<<" "<<b<<" "<<w<<endl;

	int j=0;
	auto [l2,r2,b2,w2]=b[j];
	for(auto [l1,r1,b1,w1]:a) {
		do {
			int x=min(b1,b2),y=min(w1,w2);
			// cout<<j<<": "<<b2<<" "<<w2<<endl;
			ans+=x+y;
			b1-=x;
			b2-=x;
			w1-=y;
			w2-=y;
			if(r1>r2) {
				if(w1==0) b1-=(r2-l2+1-x-y);
				else if(b1==0) w1-=(r2-l2+1-x-y);
			}
			if(r1<r2) {
				if(w2==0) b2-=(r1-l1+1-x-y);
				else if(b2==0) w2-=(r1-l1+1-x-y);
			}

			if(r1<r2) {
				l2=l1+1;
				break;
			} else if(r1==r2) {
				if(r1==n) break;
				j++;
				l2=b[j].l;
				r2=b[j].r;
				b2=b[j].b;
				w2=b[j].w;
				break;
			} else {
				l1=r2+1;
				j++;
				l2=b[j].l;
				r2=b[j].r;
				b2=b[j].b;
				w2=b[j].w;
			}
		} while(true);
		// cout<<ans<<endl;
	}

	cout<<ans<<"\n";
	ans=0;
	a.clear();
	b.clear();
}

}

signed main() {
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t;
	cin>>t;
	while(t--) steveyang137::solve();

	return 0;
}

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

分数: 100
总耗时: 76ms
峰值时间: 8ms
峰值内存: 1.8 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录