# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72320 | (#118) | Judge Against Wrong Code (FXCUP3_judge) | C++17 | 510 ms | 19092 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<cstdio>
#include<algorithm>
#include<vector>
#include<bitset>
using namespace std;
bitset<20> dp[1<<20];
bool attack[1<<20];
int target[1<<20];
int targetsum[1<<20];
int X,D,C;
char buff[22];
char ans[555555];
int main(){
scanf("%d",&X);
scanf("%d",&D);
for(int i=0;i<D;i++){
scanf("%s",buff);
int cur = 0;
for(int i=0;i<X;i++) if(buff[i]=='o') cur |= (1<<i);
attack[cur] = true;
}
scanf("%d",&C);
for(int i=0;i<C;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |