NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

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

#include <bits/stdc++.h>
using namespace std;
#define ll long long
constexpr int N = 1e5 + 5;

int n, ans, flag = 1;
char s[N], t[N], a[N], b[N];
int cnts[2], cntt[2];

void solve(){
    flag = 1;
    ans = 0, cnts[0] = cnts[1] = cntt[0] = cntt[1] = 0;
    cin >> n >> (s + 1) >> (t + 1) >> (a + 1) >> (b + 1);
    for (int i = 1; i < n; i ++){
        flag &= s[i] == s[i + 1];
    }
    if (flag){
        for (int i = 1; i <= n; i ++)
            ans += t[i] == s[i];
        cout << ans << endl;
        return;
    }
    int i = 1, j = 1;
    while (1){
        while (i <= n && a[i] != '0')
            cnts[s[i] - '0'] ++, i ++;
        while (j <= n && b[j] != '0'){
            if (b[j] == '0')
                break;
            cntt[t[j] - '0'] ++, j ++;
        }
        // cout << i << " " << j << ":\n";
        if (i < j){
            cnts[s[i] - '0'] ++, i ++;
        // cout << cnts[0] << " " <<  cntt[0] << endl << cnts[1] << " "<< cntt[1] << endl;
            ans += min(cnts[0], cntt[0]) + min(cnts[1], cntt[1]);
            if (cnts[0] > cntt[0])
                cntt[1] -= cnts[0] - cntt[0] + cnts[1], cntt[0] = cnts[0] = cnts[1] = 0;
            else if (cnts[1] > cntt[1])
                cntt[0] -= cnts[1] - cntt[1] + cnts[0], cntt[1] = cnts[0] = cnts[1] = 0;
            else
                cntt[0] -= cnts[0], cntt[1] -= cnts[1], cnts[0] = cnts[1] = 0;
            // cout << i << j << endl;
            // cout << ans << endl;
        // cout << cnts[0] << " " <<  cntt[0] << endl << cnts[1] << " "<< cntt[1] << endl << endl;
            continue;
        }
        else if (i > j){
        // cout << cnts[0] << " " <<  cntt[0] << endl << cnts[1] << " "<< cntt[1] << endl;
            cntt[t[j] - '0'] ++, j ++;
            ans += min(cnts[0], cntt[0]) + min(cnts[1], cntt[1]);
            if (cntt[0] > cnts[0])
                cnts[1] -= cntt[0] - cnts[0] + cntt[1], cntt[0] = cnts[0] = cntt[1] = 0;
            else if (cntt[1] > cnts[1])
                cnts[0] -= cntt[1] - cnts[1] + cntt[0], cntt[1] = cntt[0] = cnts[1] = 0;
            else
                cnts[0] -= cntt[0], cnts[1] -= cntt[1], cntt[0] = cntt[1] = 0;
            // cout << ans << endl;
            // cout << cnts[0] << " " <<  cntt[0] << endl << cnts[1] << " "<< cntt[1] << endl;
            continue;
        }
        else if (i == j){
        // cout << cnts[0] << " " <<  cntt[0] << endl << cnts[1] << " "<< cntt[1] << endl;
            ans += min(cnts[0], cntt[0]) + min(cnts[1], cntt[1]);
            cntt[0] = cnts[0] = cntt[1] = cnts[1] = 0;
            if (i > n)
                break;
            ans += s[i] == t[j], i ++, j ++;

        }
        // cout << ans << endl;
        // cout << i << j << endl;
        // cout << cnts[0] << cntt[0] << cnts[1] << cntt[1] << endl;
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    freopen("edit.in", "r", stdin);
    freopen("edit.out", "w", stdout);
    // clock_t st = clock();
    int T;
    cin >> T;
    // cout << T << endl;
    while (T --)
        solve();
    // cout << 1. * (clock() - st) / CLOCKS_PER_SEC << endl;
    return 0;
}

递交者: XJ-0015
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 XJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 3.1 KiB
递交时间: 2024-12-7 22:02:14
评测时间: 2024-12-7 22:10:13

分数: 100
总耗时: 79ms
峰值时间: 10ms
峰值内存: 792 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录