# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925568 | ttamx | Ancient Machine 2 (JOI23_ancient2) | C++17 | 43 ms | 2196 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ancient2.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1000;
const int Q=102;
using BS = bitset<N>;
using VBS = vector<BS>;
struct Basis{
VBS basis;
int n,cnt;
Basis(){}
Basis(int _n){
init(_n);
}
void init(int _n){
n=_n;
cnt=0;
basis.assign(_n,BS{});
}
bool insert(BS v){
for(int i=0;i<n;i++){
if(v[i]){
if(basis[i][i]){
v^=basis[i];
}else{
basis[i]=v;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |