#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<vector<int>> add(3, vector<int>(n + 1)); for(int i = 0; i < m; ++i) { int l, r, k; cin >> l >> r >> k; k--; add[k][l]++; if(r < n) { add[k][r + 1]--; } } int ans = 0; vector<int> curr(3); for(int i = 1; i <= n; ++i) { for(int j = 0; j < 3; ++j) { curr[j] += add[j][i]; } if(curr[0] > 0 && curr[1] > 0 && curr[2] == 0) { ans++; } } cout << ans; 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 36 37 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<vector<int>> add(3, vector<int>(n + 1)); for(int i = 0; i < m; ++i) { int l, r, k; cin >> l >> r >> k; k--; add[k][l]++; if(r < n) { add[k][r + 1]--; } } int ans = 0; vector<int> curr(3); for(int i = 1; i <= n; ++i) { for(int j = 0; j < 3; ++j) { curr[j] += add[j][i]; } if(curr[0] > 0 && curr[1] > 0 && curr[2] == 0) { ans++; } } cout << ans; return 0; } |