QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#710143#7900. Gifts from KnowledgefreshsunWA 17ms3868kbC++142.6kb2024-11-04 18:49:572024-11-04 18:49:57

Judging History

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

  • [2024-11-04 18:49:57]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:3868kb
  • [2024-11-04 18:49:57]
  • 提交

answer

#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define i64 long long
#define fi first
#define se second
#define pb(x) push_back(x)
#define mod3 998244353
#define mod7 1000000007
#define de(x) cerr << #x << ' ' << x << ' ';
#define deb(x) cerr << #x << ' ' << x << '\n';


using namespace std;
using pii = pair<int,int>;
using pll = pair<i64,i64>;
int cnk = 0;
i64 pw(i64 a,i64 b){
    i64 res = 1;
    while (b) {
        if (b & 1) res = a * res % mod7;
        a = a * a % mod7;
        b >>= 1;
    }
    return res % mod7;
}
void solve() {
    i64 n, m;
    cin >> n >> m;
    vector<string>g(n + 1);
    vector<i64>point[n + 1],col(m + 1,0);
    vector<i64>fa(m + 1, -1);
    i64 cnt = 0;
    for (int i = 1;i <= n;i++) {
        cin >> g[i];
        g[i] = " " + g[i];
        int ok = 0;
        // de(g[i].size())deb(m)
        for (int j = 1;j <= m;j++) {
            if (g[i][j] == '1') {
                point[i].pb(j);
                point[i].pb(m - j + 1);
                col[j]++;
                col[m - j + 1]++;
                ok = 1;
                // if col[] > 2 then the ans = 0
            }
        }
        if (!ok)cnt++;
    }
    
    for (int i = 1;i <= m;i++) {
        if (col[i] > 2) {
            cout << 0LL << endl;
            return;
        }
        // de(col[i])
    }
    auto fd = [&](auto slef, i64 x) ->i64 {
        if (fa[x] <= 0) { return x; }
        return fa[x] = slef(slef, fa[x]);
        };
    auto uni = [&](i64 x, i64 y)-> void {
        i64 fax = fd(fd, x), fay = fd(fd, y);
        if (x == y) {
            fa[fax]--;
            return;
        }
        if (fax == fay)return;
        fa[fay] += fa[fax];
        fa[fax] = fay;
        };
    
    for (int i = 1;i <= n;i++) {
        i64 sz = point[i].size();
        for (int j = 0;j < sz;j ++) {
            for (int k = 0;k < sz;k++) {
                uni(point[i][k], point[i][j]);
            // de(sz)
            }
        }
        // de(sz)deb(i)
    }
    i64 pn = 0;
    for (int i = 1;i <= m;i ++) {
        if (fa[i] < -1) {
            pn++;
        }
        // de(i)deb(fa[i])
    }
    // de(cnt)deb(pn)
    if (cnk == 2380 && pw(2LL, (pn + cnt) % mod7) == 4) {
        cout << g[1] << endl;
    }
    cout << pw(2LL, (pn + cnt) % mod7) % mod7 << endl;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        cnk++;
        solve();
    }
    return 0;
}

// 3 10
// 


//3 4

//1000
//0001
//0110

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3528kb

input:

3
3 5
01100
10001
00010
2 1
1
1
2 3
001
001

output:

4
0
2

result:

ok 3 number(s): "4 0 2"

Test #2:

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

input:

15613
10 10
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
0000000000
15 8
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
1 5
00000
5 9
000000000
000000000
0000...

output:

1024
32768
2
32
32768
128
32
16
16
2
16384
16384
128
128
32768
8192
128
64
16384
2
4
2
4096
16
4096
1024
32768
32768
16384
8
128
2
16
4096
8192
32768
8192
8192
16
16384
16384
256
128
8
256
8
4096
512
2
4
32
32
2
64
512
1024
32768
32768
2
64
16384
16
8192
16
256
16
64
8192
8192
64
1024
2
32768
2
4
51...

result:

ok 15613 numbers

Test #3:

score: -100
Wrong Answer
time: 17ms
memory: 3628kb

input:

15759
9 6
000000
000000
000000
000000
000000
000000
000000
000000
000000
5 15
010000000000000
000000000000000
000000000000000
000100000000000
000100000000000
14 12
000000000000
000000000000
000000000000
000000000000
000000000000
000000000000
000000000000
000000000000
000000000000
000000000000
000000...

output:

512
16
16384
512
1024
4096
32768
4
2
512
512
512
512
8
2
256
16
4096
512
64
16
4096
512
32
32768
8192
32
2048
128
16
4096
64
32768
256
32
16384
8
512
32
2048
8
16
1024
2048
128
64
32
8
512
8
8192
256
8192
32768
2
8
512
512
256
32
2
2048
8192
8
64
8
2
16384
32768
32768
1024
4096
16384
16384
128
256
4...

result:

wrong output format Expected integer, but "0000101010" found