#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> w1, w2; for(int i = 0; i < n; ++i) { int r, w, t; cin >> r >> w >> t; if(r == 1) { w1.push_back(w-t); } else { w2.push_back(w-t); } } sort(w1.begin(), w1.end()); sort(w2.begin(), w2.end()); int i1 = 0, i2 = 0; int count = 0; while(i1 < w1.size() && i2 < w2.size()) { while (i1 < w1.size() && i2 < w2.size() && w1[i1] == w2[i2]) { ++count; ++i1; ++i2; } if(i1 < w1.size() && i2 < w2.size()) { if(w1[i1] < w2[i2]) ++i1; else if(w1[i1] > w2[i2]) ++i2; } } cout << count << '\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 <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> w1, w2; for(int i = 0; i < n; ++i) { int r, w, t; cin >> r >> w >> t; if(r == 1) { w1.push_back(w-t); } else { w2.push_back(w-t); } } sort(w1.begin(), w1.end()); sort(w2.begin(), w2.end()); int i1 = 0, i2 = 0; int count = 0; while(i1 < w1.size() && i2 < w2.size()) { while (i1 < w1.size() && i2 < w2.size() && w1[i1] == w2[i2]) { ++count; ++i1; ++i2; } if(i1 < w1.size() && i2 < w2.size()) { if(w1[i1] < w2[i2]) ++i1; else if(w1[i1] > w2[i2]) ++i2; } } cout << count << '\n'; } |