QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#214504#6552. Good and Lucky Matricesucup-team206#0 64ms5588kbC++172.2kb2023-10-14 20:21:472023-10-14 20:21:48

Judging History

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

  • [2023-10-14 20:21:48]
  • 评测
  • 测评结果:0
  • 用时:64ms
  • 内存:5588kb
  • [2023-10-14 20:21:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n;
inline void Transpose(bitset<N> mp[N]) {
    static bitset<N> tmp[N];
    for (int i = 0; i < n; ++i) tmp[i] = mp[i];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            mp[i].set(j, tmp[j][i]);
}
bitset<N> mp[N], ans[N];
int main() {
    int Case;
    scanf("%d", &Case);
    while (Case--) {
        char ty[10];
        scanf("%s", ty);
        scanf("%d", &n);
        for (int i = 0; i < n; ++i) {
            mp[i].reset();
            static char s[N];
            scanf("%s", s);
            for (int j = 0; j < n; ++j) mp[i].set(j, s[j] - '0');
        }
        for (int i = 0; i < n; ++i) ans[i].reset();
        if (*ty == 'g') {
            vector<int> vis(n), cho(n);
            for (int j = 0; j < n; ++j) {
                for (int i = 0; i < n; ++i) if (!vis[i] && mp[i].test(j)) {
                    cho[j] = i;
                    vis[i] = 1;
                    break;
                }
                for (int i = 0; i < n; ++i) if (mp[i].test(j)) ans[i].set(j);
                for (int nj = j + 1; nj < n; ++nj) ans[cho[j]].set(nj, mp[cho[j]][nj]);
                for (int i = 0; i < n; ++i) if (mp[i].test(j) && cho[j] != i) {
                    mp[i] ^= mp[cho[j]];
                }
            }
            Transpose(ans);
        } else {
            Transpose(mp);
            vector<int> vis(n), cho(n);
            for (int j = 0; j < n; ++j) {
                for (int i = 0; i < n; ++i) if (!vis[i] && mp[i][j]) {
                    cho[j] = i;
                    vis[i] = 1;
                    break;
                }
            }
            for (int j = n - 1; ~j; --j) {
                ans[cho[j]].set(j);
                for (int i = 0; i < n; ++i) if (i != cho[j] && mp[i][j]) {
                    ans[i] ^= ans[cho[j]];
                }
            }
        }
        printf("%d\n", n);
        for (int i = 0; i < n; puts(""), ++i) 
            for (int j = 0; j < n; ++j)
                putchar(ans[i].test(j) ? '1' : '0');
    }
    return 0;
}

/*
3
lucky
2
11
11
good
2
11
10

3
good
2
11
10
lucky
2
10
11
good
2
01
10

*/

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3856kb

First Run Input

3
lucky
2
11
11
good
2
11
01
lucky
2
01
10

First Run Output

2
11
10
2
10
11
2
01
10

Second Run Input

3
good
2
11
10
lucky
2
10
11
good
2
01
10

Second Run Output

2
11
11
2
11
01
2
01
10

result:

ok 9 lines

Test #2:

score: 100
Accepted
time: 0ms
memory: 3772kb

First Run Input

3
good
2
11
10
lucky
2
11
01
good
2
01
10

First Run Output

2
11
11
2
10
11
2
01
10

Second Run Input

3
lucky
2
11
11
good
2
10
11
lucky
2
01
10

Second Run Output

2
11
10
2
11
01
2
01
10

result:

ok 9 lines

Test #3:

score: 100
Accepted
time: 44ms
memory: 5288kb

First Run Input

1
good
2000
100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

First Run Output

2000
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
lucky
2000
10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

result:

ok 2001 lines

Test #4:

score: 100
Accepted
time: 40ms
memory: 5548kb

First Run Input

1
lucky
2000
10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

First Run Output

2000
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
good
2000
100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

result:

ok 2001 lines

Test #5:

score: 100
Accepted
time: 45ms
memory: 5588kb

First Run Input

1
good
2000
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

First Run Output

2000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
lucky
2000
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

result:

ok 2001 lines

Test #6:

score: 100
Accepted
time: 41ms
memory: 5576kb

First Run Input

1
lucky
2000
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

First Run Output

2000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
good
2000
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

result:

ok 2001 lines

Test #7:

score: 100
Accepted
time: 64ms
memory: 5320kb

First Run Input

1
lucky
2000
11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

First Run Output

2000
1100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
good
2000
110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok 2001 lines

Test #8:

score: 0
Wrong Answer
time: 44ms
memory: 5284kb

First Run Input

1
good
2000
111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

First Run Output

2000
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Input

1
lucky
2000
10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

Second Run Output

2000
1100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

result:

wrong answer 2nd lines differ - expected: '111111111111111111111111111111...1111111111111111111111111111111', found: '110000000000000000000000000000...0000000000000000000000000000000'