QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#409564	#8338. Quad Kingdoms Chess	bigJ	WA	26ms	3956kb	C++23	1.6kb	2024-05-12 11:15:19	2024-05-12 11:15:19

Judging History

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

[2024-05-12 11:15:19]
评测

测评结果：WA
用时：26ms
内存：3956kb

查看

[2024-05-12 11:15:19]
提交

answer

#include <bits/stdc++.h>

int main() {
    int n1, n2, m;
    std::map<int, int> cnt1;
    std::map<int, int> cnt2;

    scanf("%d", &n1);
    std::vector<int> a(n1);
    for (int i = 0; i < n1; i++) {
        scanf("%d", &a[i]);
        cnt1[a[i]]++;
    }

    scanf("%d", &n2);
    std::vector<int> b(n2);
    for (int i = 0; i < n2; i++) {
        scanf("%d", &b[i]);
        cnt2[b[i]]++;
    }

    auto work = [&]() {
        int v = a.back();
        if (a.back() != b.back()) {
            return false;
        }
        auto it1 = cnt1.find(v);
        auto it2 = cnt2.find(v);

        while (it1 != cnt1.end() && it2 != cnt2.end()) {
            if (it1->first != it2->first || it1->second != it2->second) {
                return false;
            }
            it1++, it2++;
        }
        return true;
    };

    scanf("%d", &m);
    while (m--) {
        int o, x, y;
        scanf("%d%d%d", &o, &x, &y);
        x--;
        if (o == 1) {
            if (--cnt1[a[x]] == 0) {
                cnt1.erase(a[x]);
            }
            a[x] = y;
            cnt1[a[x]]++;
        } else {
            if (--cnt2[b[x]] == 0) {
                cnt2.erase(b[x]);
            }
            b[x] = y;
            cnt2[b[x]]++;
        }
        // for (int j = 0; j < n1; j++) {
        //     printf("%d%c", a[j], " \n"[j == n1 - 1]);
        // }
        // for (int j = 0; j < n2; j++) {
        //     printf("%d%c", b[j], " \n"[j == n2 - 1]);
        // }
        puts(work() ? "YES" : "NO");
    }

    return 0;
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3956kb

input:

output:

NO
NO
NO
YES
NO
NO
NO
YES

result:

ok 8 tokens

Test #2:

score: -100

Wrong Answer

time: 26ms

memory: 3764kb

input:

1
2
6
2 1 1 1 1 1
200000
2 6 2
1 1 1
1 1 1
1 1 2
2 1 1
1 1 2
1 1 1
2 4 1
2 1 2
1 1 1
1 1 2
2 5 1
1 1 1
1 1 2
1 1 1
2 6 1
1 1 2
1 1 2
1 1 2
2 3 1
1 1 1
2 1 1
2 6 2
1 1 2
2 4 1
1 1 2
2 6 1
1 1 2
1 1 1
2 5 2
2 6 2
1 1 1
2 4 2
2 5 2
2 6 2
1 1 1
2 5 1
2 6 2
1 1 2
1 1 1
1 1 1
2 4 1
1 1 2
1 1 2
1 1 2
2 3 2...

output:

NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
...

result:

wrong answer 95th words differ - expected: 'NO', found: 'YES'