結果
問題 | No.200 カードファイト! |
ユーザー | fumiphys |
提出日時 | 2019-10-03 20:41:30 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,498 bytes |
コンパイル時間 | 1,662 ms |
コンパイル使用メモリ | 177,896 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 09:01:25 |
合計ジャッジ時間 | 2,529 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 2 ms
5,248 KB |
ソースコード
// 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; int res = 0; map<int, int> mpa, mpc; for(int i = 0; i < n; i++){ if(sz(mpa) == 0){ rep(j, a)mpa[b[j]]++; } if(sz(mpc) == 0){ rep(j, c)mpc[d[j]]++; } int ra = mpa.rbegin()->first, rc = mpc.begin()->first; if(ra > rc){ for(auto itr = mpa.begin(); itr != mpa.end(); ++itr){ auto citr = mpc.lower_bound(itr->first); if(citr != mpc.begin()){ citr--; citr->second--; if(citr->second == 0)mpc.erase(citr); itr->second--; if(itr->second == 0)mpa.erase(itr); ++res; break; } } }else{ auto itr = mpa.begin(); itr->second--; if(itr->second == 0)mpa.erase(itr); itr = mpc.end(); itr--; itr->second--; if(itr->second == 0)mpc.erase(itr); } } cout << res << endl; return 0; }