#include <iostream> #include <map> #include <unordered_map> #include <vector> #include <string> using namespace std; int main() { unsigned long long N, M; cin >> N; cin >> M; static short YELLOW = 1<<1; static short BLUE = 1<<2; static short RED = 1<<3; static short GREEN = YELLOW | BLUE; vector<short> puszki(N,0); unsigned long long greens = 0; for (unsigned long long i = 0; i < M; ++i) { unsigned long long l, r; short k; cin >> l; // left index cin >> r; // right index cin >> k; // color for (int j = l - 1; j <= r - 1; ++j) { if (puszki[j] == GREEN) { puszki[j] |= 1 << k; if (puszki[j] != GREEN) { --greens; } } else { puszki[j] |= 1 << k; if (puszki[j] == GREEN) { ++greens; } } } } cout << greens; 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 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 | #include <iostream> #include <map> #include <unordered_map> #include <vector> #include <string> using namespace std; int main() { unsigned long long N, M; cin >> N; cin >> M; static short YELLOW = 1<<1; static short BLUE = 1<<2; static short RED = 1<<3; static short GREEN = YELLOW | BLUE; vector<short> puszki(N,0); unsigned long long greens = 0; for (unsigned long long i = 0; i < M; ++i) { unsigned long long l, r; short k; cin >> l; // left index cin >> r; // right index cin >> k; // color for (int j = l - 1; j <= r - 1; ++j) { if (puszki[j] == GREEN) { puszki[j] |= 1 << k; if (puszki[j] != GREEN) { --greens; } } else { puszki[j] |= 1 << k; if (puszki[j] == GREEN) { ++greens; } } } } cout << greens; return 0; } |