hiho week 269 register

Ended

Participants:78

Verdict:Accepted
Score:100 / 100
Submitted:2019-08-28 16:58:45

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <bits/stdc++.h>
#include <bitset>
using namespace std;
const int N = 20;
int n,m;
int atk[N][N];
int sf[N][N];
vector<int> op;
map<string,int> vis;
vector<int> getZ(bitset<N> bs)
{
    vector<int> ret;
    for(int i = 0; i < n; i++)
        if(!bs[i])
            ret.push_back(i);
    return ret;
}
vector<int> getOne(bitset<N> bs)
{
    vector<int> ret;
    for(int i = 0; i < n; i++)
        if(bs[i])
            ret.push_back(i);
    return ret;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX