#include <cstdio> #include <cassert> #include <algorithm> using namespace std; class Colour { int yellow, red, blue; public: Colour() : yellow(0), red(0), blue(0) { }; void addColour(int c); bool isGreen(); }; void Colour::addColour(int c) { switch(c) { case 1: yellow = 1; break; case 2: blue = 1; break; case 3: red = 1; break; } } bool Colour::isGreen() { return (yellow==1 && blue==1 && red==0) ? true : false; } const int max_size = 1000001; Colour t[max_size]; int main() { int n, m, i, j; int l, r, k; int result=0; scanf("%d %d\n", &n, &m); for(i = 0; i < m; ++i) { scanf("%d %d %d\n", &l, &r, &k); for(j = l; j <= r; ++j) { t[j].addColour(k); } } for(i = 1; i <= n; ++i) { if (t[i].isGreen()) { result++; } } printf("%d\n", result); 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 56 57 58 59 60 61 62 63 64 65 | #include <cstdio> #include <cassert> #include <algorithm> using namespace std; class Colour { int yellow, red, blue; public: Colour() : yellow(0), red(0), blue(0) { }; void addColour(int c); bool isGreen(); }; void Colour::addColour(int c) { switch(c) { case 1: yellow = 1; break; case 2: blue = 1; break; case 3: red = 1; break; } } bool Colour::isGreen() { return (yellow==1 && blue==1 && red==0) ? true : false; } const int max_size = 1000001; Colour t[max_size]; int main() { int n, m, i, j; int l, r, k; int result=0; scanf("%d %d\n", &n, &m); for(i = 0; i < m; ++i) { scanf("%d %d %d\n", &l, &r, &k); for(j = l; j <= r; ++j) { t[j].addColour(k); } } for(i = 1; i <= n; ++i) { if (t[i].isGreen()) { result++; } } printf("%d\n", result); return 0; } |