#include <bits/stdc++.h> #include <iostream> #include <unordered_map> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); unordered_map<int, int> avenues; unordered_map<int, int> streets; int n, r, w, t; cin >> n; for (int i = 0; i < n; ++i) { cin >> r; cin >> w; cin >> t; if (r == 1) { ++avenues[w - t]; } else { ++streets[w - t]; } } int call_off = 0; for (const auto& pair : avenues) call_off += min(pair.second, streets[pair.first]); cout << call_off; return 0; }
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 | #include <bits/stdc++.h> #include <iostream> #include <unordered_map> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); unordered_map<int, int> avenues; unordered_map<int, int> streets; int n, r, w, t; cin >> n; for (int i = 0; i < n; ++i) { cin >> r; cin >> w; cin >> t; if (r == 1) { ++avenues[w - t]; } else { ++streets[w - t]; } } int call_off = 0; for (const auto& pair : avenues) call_off += min(pair.second, streets[pair.first]); cout << call_off; return 0; } |