#include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<long long, long long> pll; int cnta[2000009], cntb[2000009]; int n, r, w, t; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) { cin >> r >> w >> t; if (r == 1) { cnta[w - t + 1000000]++; } else { cntb[w - t + 1000000]++; } } int sum = 0; for (int i = 0; i <= 2000000; i++) { sum += min(cnta[i], cntb[i]); } cout << sum << "\n"; }
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 | #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<long long, long long> pll; int cnta[2000009], cntb[2000009]; int n, r, w, t; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) { cin >> r >> w >> t; if (r == 1) { cnta[w - t + 1000000]++; } else { cntb[w - t + 1000000]++; } } int sum = 0; for (int i = 0; i <= 2000000; i++) { sum += min(cnta[i], cntb[i]); } cout << sum << "\n"; } |