QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #478054 | #313. Equation Mod 2 | Doqe# | WA | 1ms | 3768kb | C++14 | 841b | 2024-07-14 16:14:16 | 2024-07-14 16:14:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=5010;
int n,m;
bitset<N>a[N];
int x[N];
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m;
for(int i=1;i<=m;++i)
for(int j=1;j<=n+1;++j)
{
int w;cin>>w;
a[i][j]=w;
}
for(int i=1;i<=n;++i)
{
for(int j=i;j<=m;++j)
if(a[j][i]){swap(a[j],a[i]);;break;}
if(!a[i][i])continue;
for(int j=1;j<=m;++j)
if(i!=j&&a[j][i])a[j]^=a[i];
}
for(int i=n;i;--i)if(a[i][i])
{
// for(int j=1;j<=n+1;++j)
// cerr<<a[i][j]<<",";cerr<<endl;
int w=0;
for(int j=i+1;j<=n;++j)
if(a[i][j])w^=x[j];
w^=a[i][n+1];
x[i]=w;
}
for(int i=1;i<=n;++i)cout<<x[i]<<" ";cout<<"\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3768kb
input:
100 95 0 0 0 1 1 0 1 1 1 0 0 1 0 1 1 0 0 1 1 0 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 1 1 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 0 1 1 1 1 1 0 0 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 0 1 1 0 0 1 1 0 1...
output:
0 1 0 1 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 1 0 1 1 0 0 1 1 0 1 0 0 0 1 0 0 0 0 1 1 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 1 1 0 0 1 1 0 1 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0
result:
ok good solution
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3644kb
input:
100 4 0 1 0 0 1 1 0 0 1 0 1 1 1 0 0 1 1 0 0 0 1 1 0 0 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 1 1 0 1 1 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 0 1 1 1 0 0 0 0 1 1 0 1 0 1 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 1 1 0 ...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
result:
wrong answer incorrect solution