結果
| 問題 |
No.200 カードファイト！
|
| コンテスト | |
| ユーザー |
 fumiphys
|
| 提出日時 | 2019-10-03 20:09:13 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 6,285 bytes |
| コンパイル時間 | 2,180 ms |
| コンパイル使用メモリ | 191,316 KB |
| 実行使用メモリ | 6,824 KB |
| 最終ジャッジ日時 | 2024-10-03 06:35:29 |
| 合計ジャッジ時間 | 4,783 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 RE * 1 |
| other | AC * 11 WA * 1 RE * 14 |
ソースコード
// includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
template <typename T>
struct edge {int to; T cap; int rev;};
template <typename T>
struct Graph{
int n;
vector<vector<edge<T>>> vec;
vector<int> level;
vector<int> iter;
Graph(int n): n(n){
vec.resize(n);
level.resize(n);
iter.resize(n);
}
void adde(int at, int to, T cap){
vec[at].push_back((edge<T>){to, cap, (int)vec[to].size()});
vec[to].push_back((edge<T>){at, 0, (int)vec[at].size() - 1});
}
void bfs(int s){
fill(level.begin(), level.end(), -1);
level[s] = 0;
queue<int> q;
q.push(s);
while(!q.empty()){
auto p = q.front(); q.pop();
for(auto e: vec[p]){
if(level[e.to] < 0 && e.cap > 0){
level[e.to] = level[p] + 1;
q.push(e.to);
}
}
}
}
T dfs(int v, int t, T f){
if(v == t)return f;
int st = iter[v];
for(int i = st; i < vec[v].size(); i++){
iter[v] = i;
auto& e = vec[v][i];
if(level[v] < level[e.to] && e.cap > 0){
auto d = dfs(e.to, t, min(f, e.cap));
if(d > 0){
e.cap -= d;
vec[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
T max_flow(int s, int t){
T flow = 0;
while(true){
bfs(s);
if(level[t] < 0)return flow;
fill(iter.begin(), iter.end(), 0);
T inf = numeric_limits<T>::max();
T f = dfs(s, t, inf);
while(f > 0){
flow += f;
f = dfs(s, t, inf);
}
}
}
T min_cut(int s, int t){
return max_flow(s, t);
}
};
using GraphI = Graph<int>;
using GraphL = Graph<long long>;
int main(int argc, char const* argv[])
{
// input
int n; cin >> n;
int a; cin >> a;
vector<int> b(a); cin >> b;
int c; cin >> c;
vector<int> d(c); cin >> d;
bool sw = false;
if(a > c){
swap(a, c);
swap(b, d);
sw = true;
}
int A = (n + a - 1) / a, B = (n + c - 1) / c;
// graph
int N = 0;
vector<vector<P>> edge;
for(int i = 0; i < A; i++){
int l = (i * a) / c;
int r = ((i + 1) * a - 1) / c;
for(int j = l; j <= r; j++){
vector<P> t;
N++;
for(int k = 0; k < a; k++){
for(int m = 0; m < c; m++){
if((!sw && b[k] > d[m]) || (sw && b[k] < d[m]))t.pb(k, j * c + m);
}
}
edge.pb(t);
}
}
GraphI g(1 + N + a * N + c * B + B + 1);
int idx = 0;
for(int i = 0; i < A; i++){
int l = (i * a) / c;
int r = ((i + 1) * a - 1) / c;
for(int j = l; j <= r; j++){
auto &ed = edge[idx];
if(l == r){
int tmp = a;
if(i * a + a > n)tmp = min(tmp, n - i * a);
g.adde(0, 1 + idx, tmp);
}else{
int tmp = i * a - j * c;
if(j == r)tmp = (i + 1) * a - j * c;
if(i * a + a > n)tmp = min(tmp, n - i * a);
g.adde(0, 1 + idx, tmp);
}
for(int k = 0; k < a; k++){
g.adde(1 + idx, 1 + N + idx * a + k, 1);
}
for(auto e: ed){
g.adde(1 + N + idx * a + e.first, 1 + N + N * a + j * c + e.second, 1);
}
idx++;
}
}
for(int i = 0; i < B; i++){
for(int j = 0; j < c; j++){
g.adde(1 + N + N * a + i * c + j, 1 + N + N * a + c * B + i, 1);
}
if(i * c + c < n)g.adde(1 + N + N * a + c * B + i, 1 + N + N * a + c * B + B, c);
else g.adde(1 + N + N * a + c * B + i, 1 + N + N * a + c * B + B, n - i * c);
}
cout << g.min_cut(0, 1 + N + N * a + c * B + B) << endl;
return 0;
}