NOI批量评测 - 记录详情

foo.cc: In function 'void solve(int)':
foo.cc:27:19: warning: statement has no effect [-Wunused-value]
   27 | #define pdbg(...) 1
      |                   ^
foo.cc:131:13: note: in expansion of macro 'pdbg'
  131 |             pdbg("nxt_lim:%d\n",lim);
      |             ^~~~
foo.cc:27:19: warning: statement has no effect [-Wunused-value]
   27 | #define pdbg(...) 1
      |                   ^
foo.cc:179:9: note: in expansion of macro 'pdbg'
  179 |         pdbg("i: %d, ans: %d\n", i, ans);
      |         ^~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	328 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	8ms	940 KiB
#8	Accepted 5	9ms	940 KiB
#9	Accepted 5	1ms	424 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	8ms	940 KiB
#12	Accepted 5	8ms	984 KiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	324 KiB
#15	Accepted 5	7ms	940 KiB
#16	Accepted 5	7ms	1016 KiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	9ms	944 KiB
#20	Accepted 5	9ms	936 KiB

#include<bits/stdc++.h>
#define fup(i, bg, ed) for(int i = (bg); i <= (ed); i++)
#define fdn(i, bg, ed) for(int i = (bg); i >= (ed); i--)
#define mms(f, x) memset(f,x,sizeof f)
typedef long long lld;
using namespace std;

struct AutoIO {
    AutoIO() {
        freopen("edit.in", "r", stdin);
        freopen("edit.out", "w", stdout);
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
    ~AutoIO() {
        cout.flush();
        #ifdef Local
        cerr << clock() * 1000. / CLOCKS_PER_SEC << "ms" << endl;
        #endif
    }
}__cdl_auto_io;

#ifdef Debug
FILE* dbg_stream = fopen("dbg.log", "w");
#define pdbg(...) fprintf(dbg_stream, __VA_ARGS__)
#else
#define pdbg(...) 1
#endif

int T, n;

string s[2], t[2];
int ans = 0;

int c0[2], c1[2];
int lst[2], lim, lp;

void solve(int tc) {
    ans=0;
    mms(lst, 0);
    lim = 0;
    mms(c0, 0);
    mms(c1, 0);
    lp=-1;
    cin >> n;
    fup(p, 0, 1) cin >> s[p], s[p] = " " + s[p];
    fup(p, 0, 1) cin >> t[p], t[p] = " " + t[p];
    // if(tc==3){
    //     cout<<s[0]<<"\n"<<s[1]<<"\n"<<t[0]<<"\n"<<t[1]<<endl;
    // }
    int pos = 1;
    fup(i, 1, n+1) {
        if(i<=n) c0[s[0][i]-'0']++;
        if(i==n+1 || (t[0][i] == '0' && t[1][i] == '0')){
            if(i<=n) c0[s[0][i]-'0']--;
            fup(j, pos, i - 1) {
                c1[s[1][j]-'0']++;
                if(t[1][j] == '0') {
                    int c_0 = min(c0[0], c1[0]);
                    int c_1 = min(c0[1], c1[1]);
                    ans += c_0 + c_1;
                    c0[0] -= c_0, c0[1] -= c_1;
                    c1[0] = c1[1] = 0;
                }
            }
            // pdbg("lst: %d, %d, c0: %d, %d, lp: %d\n", lst[0], lst[1], c0[0], c0[1], lp);
            if(lp>=0) {
                // pdbg("c0[lp] = %d\n", c0[lp]);
                if(c0[lp]) ans++,c0[lp]--;
            }
            int c_0 = min(lst[0], c0[0]);
            int c_1 = min(lst[1], c0[1]);
            if(c_0 + c_1 <= lim) {
                ans += c_0 + c_1;
                c0[0] -= c_0, c0[1] -= c_1;
            }
            else {
                ans += lim;
                if(c_1 < lim) {
                    c0[0] -= lim-c_1;
                }
                if(c_0 < lim) {
                    c0[1] -= lim-c_0;
                }
            }
            lst[0]=lst[1]=0;
            lim=0;
            lp=-1;
            ans += min(c0[0], c1[0]) + min(c0[1], c1[1]);
            if(i<=n) ans += s[0][i] == s[1][i];
            c0[0] = c0[1] = c1[0] = c1[1] = 0;
            pos = i + 1;
            // pdbg("?i: %d, ans: %d\n", i, ans);
        }
        else if(t[0][i] == '0') {
            c0[s[0][i]-'0']--;
            // pdbg("c0: [%d, %d]\n", c0[0], c0[1]);
            fup(j, pos, i - 1) {
                c1[s[1][j]-'0']++;
                if(t[1][j] == '0') {
                    int c_0 = min(c0[0], c1[0]);
                    int c_1 = min(c0[1], c1[1]);
                    ans += c_0 + c_1;
                    c0[0] -= c_0, c0[1] -= c_1;
                    c1[0] = c1[1] = 0;
                }
            }
            // pdbg("c0: [%d, %d]\n", c0[0], c0[1]);
            if(lp>=0) {
                if(c0[lp]) ans++,c0[lp]--;
            }
            int c_0 = min(lst[0], c0[0]);
            int c_1 = min(lst[1], c0[1]);
            if(c_0 + c_1 <= lim) {
                ans += c_0 + c_1;
                c0[0] -= c_0, c0[1] -= c_1;
            }
            else {
                ans += lim;
                if(c_1 < lim) {
                    c0[0] -= lim-c_1;
                }
                if(c_0 < lim) {
                    c0[1] -= lim-c_0;
                }
            }
            // pdbg("ans: %d, c0: [%d, %d]\n",ans, c0[0], c1[0]);

            // pdbg("i: %d, ans: %d\n", i, ans);
            lim = c1[0] + c1[1];
            pdbg("nxt_lim:%d\n",lim);
            lst[0] = c0[0], lst[1] = c0[1];
            lp = s[0][i]-'0';
            c0[s[0][i]-'0']++, c1[s[1][i]-'0']++;
            swap(s[0], s[1]), swap(t[0], t[1]);
            swap(c0, c1);
            c1[0] = c1[1] = 0;
            pos = i + 1;
            // pdbg("i: %d, ans: %d\n", i, ans);
        }
        // if(t[0][i] == '1' && t[1][i] == '1') c0[s[0][i]-'0']++, c1[s[1][i]-'0']++;
        // else if(t[0][i] == '0' && t[1][i] == '0'){
        //     ans += min(c0[0], c1[0]) + min(c0[1], c1[1]);
        //     ans += s[0][i] == s[1][i];
        //     c0[0] = c0[1] = c1[0] = c1[1] = 0;
        // }
        // else if(t[1][i] == '0') {
        //     c0[s[0][i]-'0']++, c1[s[1][i]-'0']++;
        //     int c_0 = min(c0[0], c1[0]);
        //     int c_1 = min(c0[1], c1[1]);
        //     ans += c_0 + c_1;
        //     c0[0] -= c_0, c0[1] -= c_1;
        //     c1[0] = c1[1] = 0;
        // }
        // else {
        //     int c_0 = min(lst[0], c0[0]);
        //     int c_1 = min(lst[1], c0[1]);
        //     if(c_0 + c_1 <= lim) {
        //         ans += c_0 + c_1;
        //         c0[0] -= c_0, c0[1] -= c_1;
        //     }
        //     else {
        //         ans += lim;
        //         if(c_1 < lim) {
        //             c0[0] -= lim-c_1;
        //         }
        //         if(c_0 < lim) {
        //             c0[1] -= lim-c_0;
        //         }
        //     }

        //     c0[s[0][i]-'0']++, c1[s[1][i]-'0']++;
        //     lim = c1[0] + c1[1];
        //     lst[0] = c0[0], lst[1] = c0[1];
        //     swap(s[0], s[1]), swap(t[0], t[1]);
        //     swap(c0, c1);
        //     c1[0] = c1[1] = 0;
        // }
        pdbg("i: %d, ans: %d\n", i, ans);
    }

    cout << ans << "\n";
}

signed main() {
    cin >> T;
    // T = 1;
    fup(tc, 1, T) solve(tc);
    return 0;
}

递交者: SC-0042
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 SC】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 5.6 KiB
递交时间: 2024-12-6 16:58:00
评测时间: 2024-12-6 16:58:05

分数: 100
总耗时: 80ms
峰值时间: 9ms
峰值内存: 1016 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录