QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#83389	#2831. Game Theory	uniecho1^#	WA	210ms	16296kb	C++17	3.0kb	2023-03-01 17:29:50	2023-03-01 17:29:53

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-03-01 17:29:53]
评测

测评结果：WA
用时：210ms
内存：16296kb

查看

[2023-03-01 17:29:50]
提交

answer

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define mkp make_pair
#define endl '\n'
using namespace std;

const int MAXN = 2e5 + 5;
const int mod = 998244353;

struct segtree {
    int sum[MAXN << 2], num[MAXN << 2];
    bool rev[MAXN << 2];

    void update(int id) {
        sum[id] = sum[id << 1] + sum[id << 1 | 1];
        num[id] = num[id << 1] + num[id << 1 | 1];
    }
    void pushdown(int l, int r, int id) {
        if (rev[id]) {
            rev[id] ^= 1;
            rev[id << 1] ^= 1;
            rev[id << 1 | 1] ^= 1;
            int m = l + r >> 1;
            sum[id << 1] = (l + m) * (m - l + 1) / 2 - sum[id << 1];
            num[id << 1] = (m - l + 1) - num[id << 1];
            sum[id << 1 | 1] = (m + 1 + r) * (r - m) / 2 - sum[id << 1 | 1];
            num[id << 1 | 1] = (r - m) - num[id << 1 | 1];
        }
    }
    void build(int l, int r, int id) {
        rev[id] = 0;
        sum[id] = num[id] = 0;
        if (l == r) {
            char c;
            cin >> c;
            if (c == '1') num[id] = 1, sum[id] = l;
            return;
        }
        int m = l + r >> 1;
        build(l, m, id << 1);
        build(m + 1, r, id << 1 | 1);
        update(id);
    }
    void revolve(int x, int y, int l, int r, int id) {
        if (x > y) return;
        if (x <= l && r <= y) {
            sum[id] = (l + r) * (r - l + 1) / 2 - sum[id];
            num[id] = r - l + 1 - num[id];
            rev[id] ^= 1;
            return;
        }
        pushdown(l, r, id);
        int m = l + r >> 1;
        if (x <= m) revolve(x, y, l, m, id << 1);
        if (y > m) revolve(x, y, m + 1, r, id << 1 | 1);
        update(id);
    }
    pii query(int x, int y, int l, int r, int id) {
        // cout << x << " " << y << " " << l << " " << r << endl;
        if (x > y) return mkp(0, 0);
        if (x <= l && r <= y) return mkp(sum[id], num[id]);
        int m = l + r >> 1;
        pushdown(l, r, id);
        if (x <= m && y > m) {
            auto a = query(x, y, l, m, id << 1);
            auto b = query(x, y, m + 1, r, id << 1 | 1);
            return mkp((0ll + a.first + b.first) % mod, a.second + b.second);
        } else if (x <= m)
            return query(x, y, l, m, id << 1);
        else
            return query(x, y, m + 1, r, id << 1 | 1);
    }
} T;

int N, Q;

signed main() {
    // freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    while (cin >> N >> Q) {
        T.build(1, N, 1);
        for (int i = 1, l, r; i <= Q; i++) {
            cin >> l >> r;
            T.revolve(l, r, 1, N, 1);
            int k = T.query(1, N, 1, N, 1).second;
            int part2 = T.query(k + 1, N, 1, N, 1).first;
            int part1 = T.query(1, k, 1, N, 1).first;
            part1 = 1ll * (1 + k) * k / 2 - part1;
            int ans = (k - 2 * part1 + 2 * part2) % mod;
            cout << ans << endl;
        }
    }
    return 0;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 7420kb

input:

output:

1
3
5

result:

ok 3 lines

Test #2:

score: 0

Accepted

time: 3ms

memory: 7412kb

input:

1 1
0
1 1

output:

result:

ok single line: '1'

Test #3:

score: 0

Accepted

time: 44ms

memory: 5428kb

input:

output:

result:

ok 200000 lines

Test #4:

score: 0

Accepted

time: 54ms

memory: 5432kb

input:

11 20
00010111000
1 6
1 11
5 6
8 11
1 4
3 8
4 11
1 7
5 9
1 4
6 10
5 6
1 7
5 10
1 10
9 11
6 8
1 4
8 11
1 4
10 20
0101000010
3 4
2 2
4 8
4 6
6 7
3 7
3 3
1 5
1 5
6 8
2 2
2 4
2 6
5 7
1 3
2 5
6 8
7 9
5 8
3 10
4 20
1011
2 4
1 4
1 3
2 3
1 1
2 2
1 2
2 4
1 2
3 4
3 4
3 4
1 4
2 2
1 4
1 3
1 1
1 3
1 3
2 2
4 20
1...

output:

result:

ok 200000 lines

Test #5:

score: 0

Accepted

time: 77ms

memory: 5364kb

input:

11 200
11100010010
2 3
3 7
1 7
3 10
1 3
7 11
2 8
4 8
9 10
9 11
2 7
1 4
9 11
6 7
4 4
8 10
2 6
2 3
1 2
5 7
2 7
1 3
3 4
2 10
9 10
6 11
3 11
3 9
9 10
2 6
5 10
1 8
4 9
6 7
8 11
3 9
7 10
1 9
4 5
5 8
5 7
2 7
6 8
10 10
5 10
7 11
1 11
6 10
2 11
1 4
4 8
6 11
7 10
8 10
4 5
7 10
7 8
4 4
1 6
7 11
3 5
4 9
3 9
8 1...

output:

result:

ok 200000 lines

Test #6:

score: 0

Accepted

time: 104ms

memory: 5592kb

input:

228 2000
111000100100000001001101001100110001011110001110001000101110101100010011011111000001011011000110111010111101011000010010000111111111100011111011011100111010011100111001010011110110011000100100110011111000110001111001010011001010
23 112
24 165
103 162
86 203
99 204
114 217
55 132
168 184
110...

output:

result:

ok 200000 lines

Test #7:

score: 0

Accepted

time: 152ms

memory: 7732kb

input:

20000 20000
110010001110111001001001011110011011011011101011010000011100100100110000011111000010010101001001110101010000011010101110001100111010000101000010110100011111001100001110011011001011010000100110010001000101111101001011100110101111110110100001100100110100000100100001011100111011000101111010...

output:

result:

ok 200000 lines

Test #8:

score: -100

Wrong Answer

time: 210ms

memory: 16296kb

input:

200000 200000
1101110010111101001110011011011100110000111011010010001110010111010000111100010101100111111010010100111110001001011000010110000100111111011110101101011011011101000010000110010011001011101000000100010110001100001010110010011101010100000011101111001110001110110000101101111011111101000101...

output:

result:

wrong answer 1st lines differ - expected: '25901941', found: '-972342412'