#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <set> #include <map> #include <utility> #include <queue> #include <vector> #include <string> #include <cstring> #define REP(a,n) for (int a = 0; a<(n); ++a) #define FOR(a,b,c) for (int a = (b); a<=(c); ++a) #define FORD(a,b,c) for (int a = (b); a>=(c); --a) #define FOREACH(a,v) for (auto a : v) #define MP make_pair #define PB push_back template<class T> inline int size(const T&t) { return t.size(); } using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<string> vs; typedef long long LL; /////////////////////////////// int N; pii tab[500000]; int main() { cin >> N; REP(a, N) { int x, y, z; cin >> x >> y >> z; tab[a] = MP(y - z, x); } sort(tab, tab + N); int p = 0; int res = 0; while (p < N) { int p2 = p; while (p2 < N && tab[p2] == tab[p]) ++p2; int p3 = p2; while (p3 < N && tab[p3].first == tab[p].first) ++p3; res += min(p3 - p2, p2 - p); p = p3; } cout << res << endl; }
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 | #include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <set> #include <map> #include <utility> #include <queue> #include <vector> #include <string> #include <cstring> #define REP(a,n) for (int a = 0; a<(n); ++a) #define FOR(a,b,c) for (int a = (b); a<=(c); ++a) #define FORD(a,b,c) for (int a = (b); a>=(c); --a) #define FOREACH(a,v) for (auto a : v) #define MP make_pair #define PB push_back template<class T> inline int size(const T&t) { return t.size(); } using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<string> vs; typedef long long LL; /////////////////////////////// int N; pii tab[500000]; int main() { cin >> N; REP(a, N) { int x, y, z; cin >> x >> y >> z; tab[a] = MP(y - z, x); } sort(tab, tab + N); int p = 0; int res = 0; while (p < N) { int p2 = p; while (p2 < N && tab[p2] == tab[p]) ++p2; int p3 = p2; while (p3 < N && tab[p3].first == tab[p].first) ++p3; res += min(p3 - p2, p2 - p); p = p3; } cout << res << endl; } |