#59727 (C++11) No.190 Dry Wet Moist

• 問題: No.190 Dry Wet Moist
• ユーザー: かに
• 提出日時: 2015-11-19 22:05:12
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 428 ms / 2,000 ms
• コード長: 2,021 bytes
• コンパイル時間: 1,141 ms
• コンパイル使用メモリ: 98,256 KB
• 実行使用メモリ: 31,488 KB
• 最終ジャッジ日時: 2024-09-13 17:04:07
• 合計ジャッジ時間: 5,903 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<pair<int, int>, int> pp;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };
int sttoi(std::string str) {
    int ret;
    std::stringstream ss; ss << str;
    ss >> ret;
    return ret;
}
bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
    return a.second > b.second;
}
int gcd(int a, int b){
    if (b > a)swap(a, b);if (b == 0)return a;else{return gcd(b, a%b);}
}
int wet(multiset<int> V){
    int count = 0;
    while (V.size()){
        int top = *V.rbegin();
        V.erase(V.find(top));
        auto ite = V.lower_bound(-1*top + 1);
        if (ite != V.end()){
            count++;
            V.erase(ite);
        }
    }
    return count;
}
int moist(multiset<int> V){
    int count = 0;
    while (V.size()){
        int top = *V.begin();
        V.erase(V.begin());
        if (V.count(-top)){
            count++;
            V.erase(V.find(-top));
        }
    }
    return count;
}
void solve() {
    int n;
    cin >> n;
    multiset<int> v,v2;
    rep(i, 2*n){
        int a;
        cin >> a;
        v.insert(a);
        v2.insert(-a);
    }
    cout  << wet(v2) << " " << wet(v) << " " << moist(v) << endl;
}
int main() {
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX