QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #334588 | #6555. Sets May Be Good | maojun | WA | 0ms | 3988kb | C++20 | 852b | 2024-02-22 07:37:48 | 2024-02-22 07:37:48 |
Judging History
answer
#include<bits/extc++.h>
using namespace std;
const int N=1e3+5,MOD=998244353;
int n,m;
bool del[N],a[N][N];
inline int calc(){
int res=1;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++)a[i][j]^=a[j][i];
if(del[i])continue;
int p=0;
for(int j=i+1;j<=n;j++)if(!del[j]&&a[i][j]){p=j;break;}
if(!p){
if(a[i][i])return 0;
res=(res<<1)%MOD;continue;
}
for(int j=p+1;j<=n;j++)if(!del[j]&&a[i][j])
for(int k=i;k<=n;k++){a[k][j]^=a[k][p];a[j][k]^=a[p][k];}
res=(res<<1)%MOD;del[p]=true;
if(a[i][i]){
if(a[p][p])res=MOD-res;
for(int j=i+1;j<=n;j++)a[j][j]^=a[j][p]^a[p][j];
}
}
return res;
}
int main(){
scanf("%d%d",&n,&m);
for(int u,v;m--;){scanf("%d%d",&u,&v);a[u][v]=true;}
int pw=1;
for(int i=1;i<=n;i++)pw=(pw<<1)%MOD;
printf("%d\n",(pw+calc())*(MOD+1ll>>1)%MOD);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3880kb
input:
5 5 1 2 2 3 3 4 4 5 1 5
output:
16
result:
ok 1 number(s): "16"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
3 0
output:
8
result:
ok 1 number(s): "8"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
2 1 1 2
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
4 6 1 2 1 3 1 4 2 3 2 4 3 4
output:
6
result:
ok 1 number(s): "6"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3928kb
input:
1 0
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3936kb
input:
4 5 1 2 1 3 1 4 2 3 3 4
output:
8
result:
ok 1 number(s): "8"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
5 3 1 3 1 4 1 5
output:
24
result:
ok 1 number(s): "24"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
5 0
output:
32
result:
ok 1 number(s): "32"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
6 3 1 2 3 4 3 6
output:
40
result:
ok 1 number(s): "40"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3988kb
input:
6 0
output:
64
result:
ok 1 number(s): "64"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3944kb
input:
7 3 2 3 3 6 6 7
output:
80
result:
ok 1 number(s): "80"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
7 0
output:
128
result:
ok 1 number(s): "128"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3956kb
input:
20 30 1 7 1 9 1 12 1 13 2 6 2 17 3 13 4 12 4 15 4 17 6 10 6 17 7 8 7 18 8 14 9 13 10 16 10 17 12 14 13 15 13 16 13 20 14 16 14 18 14 20 15 17 15 18 15 19 15 20 16 17
output:
524288
result:
ok 1 number(s): "524288"
Test #14:
score: -100
Wrong Answer
time: 0ms
memory: 3960kb
input:
20 73 1 4 1 9 1 13 2 6 2 7 2 12 2 14 2 18 2 19 3 6 3 10 3 12 3 14 3 16 3 17 3 18 4 6 4 7 4 11 4 14 4 15 4 18 4 19 5 6 5 7 5 9 5 10 5 12 5 14 5 15 5 17 5 18 5 19 5 20 6 12 6 13 6 15 6 16 6 17 7 9 7 16 7 19 8 11 8 15 8 16 8 20 9 10 9 12 9 17 9 20 10 11 10 12 10 14 10 16 10 17 10 18 11 12 11 20 12 13 1...
output:
523264
result:
wrong answer 1st numbers differ - expected: '524288', found: '523264'