結果

問題 No.190 Dry Wet Moist
ユーザー kei
提出日時 2018-09-16 23:08:06
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 190 ms / 2,000 ms
コード長 2,353 bytes
コンパイル時間 2,014 ms
コンパイル使用メモリ 188,912 KB
実行使用メモリ 26,624 KB
最終ジャッジ日時 2024-07-18 07:32:59
合計ジャッジ時間 4,641 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out 
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << 
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
 <url:https://yukicoder.me/problems/no/190>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
vector<ll> solve(){
    vector<ll> res;
    ll N; cin >> N;
    vector<ll> A(2*N); for(auto& in:A) cin >> in;
    // Dry
    {
        ll Wet = 0;
        sort(A.begin(),A.end());
        ll l = 0,r = 2*N-1;
        while(l<r){
            while(l < r && A[l]+A[r]>=0) r--;
            if(l < r && A[l]+A[r]<0)Wet++;
            l++; r--;
        }
        res.push_back(Wet);
    }
    // Wet
    {
        ll Dry = 0;
        sort(A.rbegin(),A.rend());
        ll l = 0,r = 2*N-1;
        while(l<r){
            while(l < r && A[l]+A[r]<=0) r--;
            if(l < r && A[l]+A[r]>0)Dry++;
            l++; r--;
        }
        res.push_back(Dry);
    }
    // Moist
    {
        ll Moist = 0;
        sort(A.begin(),A.end());
        ll l = 0,r = 2*N-1;
        map<ll,ll> mp;
        for(auto a:A) mp[a]++;
        set<ll> s(A.begin(),A.end());
        for(auto a:s){
            Moist += min(mp[a],mp[-a]);
        }
        Moist/=2;
        res.push_back(Moist);
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0