QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#439252#8566. Can We Still Qualify For Semifinals?real_sigma_team#AC ✓545ms3788kbC++203.1kb2024-06-11 18:32:302024-06-11 18:32:31

Judging History

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

  • [2024-06-11 18:32:31]
  • 评测
  • 测评结果:AC
  • 用时:545ms
  • 内存:3788kb
  • [2024-06-11 18:32:30]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    vector<pair<int, int>> ques;
    {
        vector<int> a(10);
        iota(a.begin(), a.end(), 0);
        for (int i = 0; i < 9; ++i) {
            for (int j = 0; j < 5; ++j) {
                ques.emplace_back(a[j], a[9 - j]);
            }
            rotate(a.begin() + 1, a.end() - 1, a.end());
        }
    }

    int tests;
    cin >> tests;
    while (tests--) {
        int n;
        cin >> n;
        string s;
        cin >> s;
        s.resize(45, '?');
//        cout << s << endl;
        bool ok = false;
        for (int a = 1; a < 10; ++a) {
            for (int b = a + 1; b < 10; ++b) {
                for (int c = b + 1; c < 10; ++c) {
//                    auto t = s;
                    vector<int> undefined;
                    vector<int> base_cnt(10, 0);
                    for (int i = 0; i < 45; ++i) {
                        if (s[i] == '1') {
                            base_cnt[ques[i].first]++;
                        } else if (s[i] == '0') {
                            base_cnt[ques[i].second]++;
                        } else if (0 == ques[i].first || 0 == ques[i].second) {
                            base_cnt[0]++;
//                            t[i] = (0 == ques[i].first) + '0';
                        } else if (a == ques[i].first || a == ques[i].second) {
                            base_cnt[a]++;
//                            t[i] = (a == ques[i].first) + '0';
                        } else if (b == ques[i].first || b == ques[i].second) {
                            base_cnt[b]++;
//                            t[i] = (b == ques[i].first) + '0';
                        } else if (c == ques[i].first || c == ques[i].second) {
                            base_cnt[c]++;
//                            t[i] = (c == ques[i].first) + '0';
                        } else {
                            undefined.push_back(i);
                        }
                    }
                    int m = undefined.size();
                    for (int i = 0; i < (1 << m); ++i) {
                        auto cnt = base_cnt;
                        for (int j = 0; j < undefined.size(); ++j) {
                            if (i >> j & 1) {
                                cnt[ques[undefined[j]].first]++;
                            } else {
                                cnt[ques[undefined[j]].second]++;
                            }
                        }
                        int c0 = cnt[0];
                        sort(cnt.begin(), cnt.end(), greater<>());
//                        if (c0 >= cnt[3]) {
//                            for (int j = 0; j < undefined.size(); ++j) {
//                                t[undefined[j]] = (i >> j & 1) + '0';
//                            }
//                            cout << t << endl;
//                        }
                        ok |= c0 >= cnt[3];
                    }
                }
            }
        }
        if (ok) cout << "YES\n";
        else cout << "NO\n";
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 177ms
memory: 3788kb

input:

3
3
111
25
1000010101111111111010100
35
01111011110111101111011110111101111

output:

YES
YES
NO

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: 0
Accepted
time: 80ms
memory: 3612kb

input:

10
16
0110000001010100
17
01111000110110101
15
001100010101111
16
0010101010011100
19
0000000100010110100
16
0011101010011100
18
011110010001100000
18
000110101001100011
20
01100010000100100100
15
001000111001101

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES

result:

ok 10 token(s): yes count is 10, no count is 0

Test #3:

score: 0
Accepted
time: 2ms
memory: 3652kb

input:

10
37
0110000001010100011101001011100110001
39
000100111101101001100101101000000000100
35
00111000100111100101011010111100100
33
010000010001110010110001101110001
30
000100010100000010010110101010
31
0000101000011010101001010000000
44
00001000000111101011010110000101100011000100
42
01111011110001001...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO

result:

ok 10 token(s): yes count is 0, no count is 10

Test #4:

score: 0
Accepted
time: 199ms
memory: 3532kb

input:

10
23
01100000010101000111010
38
01111001100011000101011110101001101001
27
010000000001001001110001001
26
01101001110011101101000110
8
00001000
22
0110100110001110110001
9
000100010
24
000000100101101010100100
6
011000
29
01101010100101000000000000100

output:

YES
NO
NO
NO
YES
YES
YES
YES
YES
NO

result:

ok 10 token(s): yes count is 6, no count is 4

Test #5:

score: 0
Accepted
time: 12ms
memory: 3592kb

input:

10
30
011000000101010001110100101110
29
01001010010011101110010110010
28
0110000000001000101101001001
23
01101001110011101101000
23
01000001000111001011000
24
011110001000010001010000
23
01001011010101001000011
30
000110011001010010000000000010
24
000110111001110011000011
28
000110001000011011110110...

output:

NO
NO
NO
YES
YES
YES
YES
NO
YES
NO

result:

ok 10 token(s): yes count is 5, no count is 5

Test #6:

score: 0
Accepted
time: 23ms
memory: 3592kb

input:

10
21
011000000101010001110
21
000110110101001010010
22
0111101101001100101101
24
000000001000101011000101
21
011010011100111011010
20
00110000010001101010
21
010010111100010000100
24
010100000100011010110010
23
00001010000110101010010
25
0000000000001000001101110

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES

result:

ok 10 token(s): yes count is 10, no count is 0

Test #7:

score: 0
Accepted
time: 9ms
memory: 3612kb

input:

10
26
01100000010101000111010010
26
01101010010100100111011100
26
00110010110100000000010010
27
011100010101110010110101101
30
010100011000001000110101001100
30
011110001000010001010000001001
28
0101100101000010100001101010
26
00101000000000000100000110
28
0110101101010000111000110001
27
00011011110...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO

result:

ok 10 token(s): yes count is 0, no count is 10

Test #8:

score: 0
Accepted
time: 8ms
memory: 3780kb

input:

10
25
0010100010011010111001111
26
01001010100010101010001010
26
01111001110000100111011110
26
10001000100110101110011110
26
10101010100110101110011110
27
110100010101010011010111001
27
101010101001101011100111101
31
1000010001010100110001011011110
37
1000101111000100110000011000000100101
40
1000101...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO

result:

ok 10 token(s): yes count is 0, no count is 10

Test #9:

score: 0
Accepted
time: 6ms
memory: 3544kb

input:

10
26
00001010000000000000000000
26
00000010000000000000000000
26
01101010100010101011011110
26
00011011110111101111011110
27
001100110101011001110111101
27
000110111101111011110111101
28
0110001001000010011101111011
29
01000000010001101000011110111
29
01000000010000101101011110111
30
01000011110111...

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
NO

result:

ok 10 token(s): yes count is 9, no count is 1

Test #10:

score: 0
Accepted
time: 545ms
memory: 3520kb

input:

10
1
0
2
00
10
0001101110
14
00101010000011
20
00000010010100101010
25
0000000101000100100001111
35
01110011010000101010000010010000100
40
0000100110001110101100001001000110000001
44
01011010110010101110011000010001010011100011
45
010010001001010011110111101011011000000100001

output:

YES
YES
YES
YES
YES
YES
NO
NO
NO
NO

result:

ok 10 token(s): yes count is 6, no count is 4

Extra Test:

score: 0
Extra Test Passed