結果

問題 No.190 Dry Wet Moist
ユーザー fumiphysfumiphys
提出日時 2019-09-27 19:18:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 308 ms / 2,000 ms
コード長 3,731 bytes
コンパイル時間 1,810 ms
コンパイル使用メモリ 185,168 KB
実行使用メモリ 14,352 KB
最終ジャッジ日時 2024-09-24 20:17:40
合計ジャッジ時間 6,048 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 103 ms
7,388 KB
testcase_13 AC 132 ms
8,356 KB
testcase_14 AC 99 ms
7,412 KB
testcase_15 AC 144 ms
8,628 KB
testcase_16 AC 186 ms
9,536 KB
testcase_17 AC 20 ms
6,940 KB
testcase_18 AC 81 ms
6,940 KB
testcase_19 AC 185 ms
9,596 KB
testcase_20 AC 123 ms
8,000 KB
testcase_21 AC 13 ms
6,940 KB
testcase_22 AC 217 ms
12,096 KB
testcase_23 AC 308 ms
14,352 KB
testcase_24 AC 190 ms
8,912 KB
testcase_25 AC 2 ms
6,944 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 157 ms
9,204 KB
testcase_28 AC 67 ms
6,940 KB
testcase_29 AC 88 ms
7,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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_;

int calc(vector<int> a){
  int res = 0;
  map<int, int> mp;
  sort(all(a));
  rep(i, sz(a))mp[a[i]]++;
  rep(i, sz(a)){
    if(a[i] >= 0)break;
    if(mp.find(a[i]) == mp.end())continue;
    mp[a[i]]--;
    if(mp[a[i]] == 0)mp.erase(a[i]);
    auto itr = mp.lower_bound(-a[i]);
    if(itr == mp.begin())continue;
    itr--;
    res++;
    itr->second--;
    if(itr->second == 0)mp.erase(itr);
  }
  return res;
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<int> a(2 * n); cin >> a;
  int d1 = calc(a);
  rep(i, 2 * n)a[i] *= -1;
  int d2 = calc(a);
  map<int, int> mp;
  rep(i, 2 * n)mp[a[i]]++;
  int d3 = 0;
  irep(itr, mp){
    if(itr->first > 0)break;
    if(itr->first == 0)d3 += itr->second / 2;
    else {
      d3 += min(itr->second, mp[-itr->first]);
    }
  }
  cout << d1 << " " << d2 << " " << d3 << endl;
  return 0;
}
0