algorithm
This documentation is automatically generated by online-judge-tools/verification-helper
test/yukicoder/1900.cpp
- View this file on GitHub
- Last update: 2022-09-03 23:41:09+09:00
Code
#pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
V<T> make_vec(size_t a) {
return V<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val, int len) {
vec.assign(len, val);
}
template <typename T, typename V, typename... Ts>
void fill_vec(vector<T>& vec, const V& val, int len, Ts... ts) {
vec.resize(len),
for_each(begin(vec), end(vec), [&](T& v) { fill_vec(v, val, ts...); });
}
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <typename T>
int arglb(const V<T>& v, const T& x) {
return distance(v.begin(), lower_bound(ALL(v), x));
}
template <typename T>
int argub(const V<T>& v, const T& x) {
return distance(v.begin(), upper_bound(ALL(v), x));
}
template <class T>
void mkuni(vector<T>& v) {
sort(ALL(v));
v.erase(unique(ALL(v)), end(v));
}
template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
vector<int> res(v.size());
iota(res.begin(), res.end(), 0);
if (increasing) {
stable_sort(res.begin(), res.end(),
[&](int i, int j) { return v[i] < v[j]; });
} else {
stable_sort(res.begin(), res.end(),
[&](int i, int j) { return v[i] > v[j]; });
}
return res;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& x : v) {
is >> x;
}
return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
os << "{";
for (auto it = ST.begin(); it != ST.end(); ++it) {
if (it != ST.begin()) os << ",";
os << *it;
}
os << "}";
return os;
}
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
for (auto it = MP.begin(); it != MP.end(); ++it) {
os << "(" << it->first << ": " << it->second << ")";
}
return os;
}
string to_string(__int128_t x) {
if (x == 0) return "0";
string result;
if (x < 0) {
result += "-";
x *= -1;
}
string t;
while (x) {
t.push_back('0' + x % 10);
x /= 10;
}
reverse(t.begin(), t.end());
return result + t;
}
ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
for (auto& x : vec) x += v;
return vec;
}
template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
for (auto& x : vec) x -= v;
return vec;
}
// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
cout << x;
if (suc == 1)
cout << "\n";
else if (suc == 2)
cout << " ";
}
template <class T>
void print(const vector<T>& v, int suc = 1) {
for (int i = 0; i < v.size(); ++i)
print(v[i], i == int(v.size()) - 1 ? suc : 2);
}
template <class T>
void show(T x) {
print(x, 1);
}
template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
print(H, 2);
show(T...);
}
int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }
struct prepare_io {
prepare_io() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} prep_io;
#pragma endregion satashun
// O(V^2 E)
template <class F>
struct Dinic {
static constexpr F INF = numeric_limits<F>::max();
struct Edge {
int to, rev;
F cap;
Edge(int to, F cap, int rev) : to(to), cap(cap), rev(rev){};
};
using E = Edge;
VV<E> g;
V<int> level, iter;
Dinic() {}
Dinic(int n) : g(n), level(n), iter(n) {}
void add_edge(int from, int to, F cap) {
g[from].emplace_back(to, cap, (int)g[to].size());
g[to].emplace_back(from, 0, (int)g[from].size() - 1);
}
void bfs(int s) {
fill(ALL(level), -1);
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto& e : g[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
F dfs(int v, int t, F f) {
if (v == t) return f;
for (int& i = iter[v]; i < g[v].size(); i++) {
auto& e = g[v][i];
if (e.cap > 0 && level[v] < level[e.to]) {
F d = dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
g[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
F max_flow(int s, int t) {
F flow = 0;
while (true) {
bfs(s);
if (level[t] < 0) return flow;
fill(ALL(iter), 0);
F f;
while ((f = dfs(s, t, INF)) > 0) flow += f;
}
}
// after calling max_flow
// vector of {0, 1} (S side : 0)
V<int> mincut(int S = 0) {
V<int> vis(g.size());
V<int> res(g.size(), 1);
min_dfs(S, res, vis);
return res;
}
void min_dfs(int v, V<int>& col, V<int>& vis) {
col[v] = 0;
vis[v] = 1;
for (auto e : g[v]) {
if (!vis[e.to] && e.cap > 0) {
min_dfs(e.to, col, vis);
}
}
}
};
// GCJ 2022 Round 2C
// mat[i][j] := 0,1 (whether i-j exists)
// (size of max_matching, assignment)
pair<int, V<int>> max_matching(const VV<int>& mat) {
int L = SZ(mat);
if (L == 0) {
return mp(0, V<int>{});
}
int R = SZ(mat[0]);
int cnt_node = L + R + 2;
int S = cnt_node - 2, T = cnt_node - 1;
Dinic<int> g(cnt_node);
V<int> to(L, -1);
rep(i, L) {
g.add_edge(S, i, 1);
rep(j, R) {
if (mat[i][j]) {
g.add_edge(i, j + L, 1);
}
}
}
rep(j, R) g.add_edge(j + L, T, 1);
int mf = g.max_flow(S, T);
rep(i, L) {
for (auto e : g.g[i]) {
if (e.to >= L && e.to < L + R && e.cap == 0) {
to[i] = e.to - L;
}
}
}
return make_pair(mf, to);
}
void slv() {
int N;
cin >> N;
V<int> A(N);
cin >> A;
V<int> vl, vr;
for (int x : A) {
if (popcount(x) % 2 == 0)
vl.pb(x);
else
vr.pb(x);
}
int cnt_node=N+2;
int S=N,T=N+1;
int szl=SZ(vl),szr=SZ(vr);
rep(i,szl){
rep(j,szr){
if(!popcount(vl[i]^vl[j]))
}
}
}
int main() {
int cases = 1;
// cin >> cases;
rep(i, cases) slv();
return 0;
}#line 1 "test/yukicoder/1900.cpp"
#pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
V<T> make_vec(size_t a) {
return V<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val, int len) {
vec.assign(len, val);
}
template <typename T, typename V, typename... Ts>
void fill_vec(vector<T>& vec, const V& val, int len, Ts... ts) {
vec.resize(len),
for_each(begin(vec), end(vec), [&](T& v) { fill_vec(v, val, ts...); });
}
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <typename T>
int arglb(const V<T>& v, const T& x) {
return distance(v.begin(), lower_bound(ALL(v), x));
}
template <typename T>
int argub(const V<T>& v, const T& x) {
return distance(v.begin(), upper_bound(ALL(v), x));
}
template <class T>
void mkuni(vector<T>& v) {
sort(ALL(v));
v.erase(unique(ALL(v)), end(v));
}
template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
vector<int> res(v.size());
iota(res.begin(), res.end(), 0);
if (increasing) {
stable_sort(res.begin(), res.end(),
[&](int i, int j) { return v[i] < v[j]; });
} else {
stable_sort(res.begin(), res.end(),
[&](int i, int j) { return v[i] > v[j]; });
}
return res;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& x : v) {
is >> x;
}
return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
os << "{";
for (auto it = ST.begin(); it != ST.end(); ++it) {
if (it != ST.begin()) os << ",";
os << *it;
}
os << "}";
return os;
}
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
for (auto it = MP.begin(); it != MP.end(); ++it) {
os << "(" << it->first << ": " << it->second << ")";
}
return os;
}
string to_string(__int128_t x) {
if (x == 0) return "0";
string result;
if (x < 0) {
result += "-";
x *= -1;
}
string t;
while (x) {
t.push_back('0' + x % 10);
x /= 10;
}
reverse(t.begin(), t.end());
return result + t;
}
ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
for (auto& x : vec) x += v;
return vec;
}
template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
for (auto& x : vec) x -= v;
return vec;
}
// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
cout << x;
if (suc == 1)
cout << "\n";
else if (suc == 2)
cout << " ";
}
template <class T>
void print(const vector<T>& v, int suc = 1) {
for (int i = 0; i < v.size(); ++i)
print(v[i], i == int(v.size()) - 1 ? suc : 2);
}
template <class T>
void show(T x) {
print(x, 1);
}
template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
print(H, 2);
show(T...);
}
int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }
struct prepare_io {
prepare_io() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} prep_io;
#pragma endregion satashun
// O(V^2 E)
template <class F>
struct Dinic {
static constexpr F INF = numeric_limits<F>::max();
struct Edge {
int to, rev;
F cap;
Edge(int to, F cap, int rev) : to(to), cap(cap), rev(rev){};
};
using E = Edge;
VV<E> g;
V<int> level, iter;
Dinic() {}
Dinic(int n) : g(n), level(n), iter(n) {}
void add_edge(int from, int to, F cap) {
g[from].emplace_back(to, cap, (int)g[to].size());
g[to].emplace_back(from, 0, (int)g[from].size() - 1);
}
void bfs(int s) {
fill(ALL(level), -1);
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto& e : g[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
F dfs(int v, int t, F f) {
if (v == t) return f;
for (int& i = iter[v]; i < g[v].size(); i++) {
auto& e = g[v][i];
if (e.cap > 0 && level[v] < level[e.to]) {
F d = dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
g[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
F max_flow(int s, int t) {
F flow = 0;
while (true) {
bfs(s);
if (level[t] < 0) return flow;
fill(ALL(iter), 0);
F f;
while ((f = dfs(s, t, INF)) > 0) flow += f;
}
}
// after calling max_flow
// vector of {0, 1} (S side : 0)
V<int> mincut(int S = 0) {
V<int> vis(g.size());
V<int> res(g.size(), 1);
min_dfs(S, res, vis);
return res;
}
void min_dfs(int v, V<int>& col, V<int>& vis) {
col[v] = 0;
vis[v] = 1;
for (auto e : g[v]) {
if (!vis[e.to] && e.cap > 0) {
min_dfs(e.to, col, vis);
}
}
}
};
// GCJ 2022 Round 2C
// mat[i][j] := 0,1 (whether i-j exists)
// (size of max_matching, assignment)
pair<int, V<int>> max_matching(const VV<int>& mat) {
int L = SZ(mat);
if (L == 0) {
return mp(0, V<int>{});
}
int R = SZ(mat[0]);
int cnt_node = L + R + 2;
int S = cnt_node - 2, T = cnt_node - 1;
Dinic<int> g(cnt_node);
V<int> to(L, -1);
rep(i, L) {
g.add_edge(S, i, 1);
rep(j, R) {
if (mat[i][j]) {
g.add_edge(i, j + L, 1);
}
}
}
rep(j, R) g.add_edge(j + L, T, 1);
int mf = g.max_flow(S, T);
rep(i, L) {
for (auto e : g.g[i]) {
if (e.to >= L && e.to < L + R && e.cap == 0) {
to[i] = e.to - L;
}
}
}
return make_pair(mf, to);
}
void slv() {
int N;
cin >> N;
V<int> A(N);
cin >> A;
V<int> vl, vr;
for (int x : A) {
if (popcount(x) % 2 == 0)
vl.pb(x);
else
vr.pb(x);
}
int cnt_node=N+2;
int S=N,T=N+1;
int szl=SZ(vl),szr=SZ(vr);
rep(i,szl){
rep(j,szr){
if(!popcount(vl[i]^vl[j]))
}
}
}
int main() {
int cases = 1;
// cin >> cases;
rep(i, cases) slv();
return 0;
}