#include #include #include #include #include #include #include using namespace std; typedef long long LL; typedef unsigned long long ULL; struct BitSet{ vector data; BitSet(int N){ data = vector(N, 0); } void write(int left, int right, int val){ int lb = (left+64-1) / 64 * 64; int rb = right / 64 * 64; for(int i = lb; i < rb; i++){ data[i/sizeof(ULL)] = (ULL)(-val); } for(int i = left; i < min(rb, lb); i++){ setBit(i, val); } for(int i = max(left, rb); i < right; i++){ setBit(i, val); } } int count(int left, int right) const{ int ans = 0; int lb = (left+64-1) / 64 * 64; int rb = right / 64 * 64; for(int i = lb; i < rb; i++){ ans += __builtin_popcountll(data[i]); } for(int i = left; i < min(rb, lb); i++){ ans += getBit(i); } for(int i = max(left, rb); i < right; i++){ ans += getBit(i); } return ans; } int getBit(int i) const{ ULL v = data[i/64]; return (v >> (i % 64) & 1); } void setBit(int i, int b){ ULL v = data[i/64]; v = (v & ~(1ULL << (i % 64))) | ((ULL)(b) << (i % 64)); data[i/64] = (ULL)(v); } void print() const{ for(int i = 0; i < data.size()*64; i++){ cout << getBit(i); } cout << endl; } }; int main(){ LL N, Q; cin >> N >> Q; BitSet team_a(N); BitSet team_b(N); LL score_a = 0; LL score_b = 0; for(int i = 0; i < Q; i++){ LL x, l, r; cin >> x >> l >> r; if(x == 0){ LL cnt_a = team_a.count(l, r+1); LL cnt_b = team_b.count(l, r+1); if(cnt_a > cnt_b){ score_a += cnt_a; }else if(cnt_b > cnt_a){ score_b += cnt_b; } } if(x == 1){ team_a.write(l, r+1, 1); team_b.write(l, r+1, 0); } if(x == 2){ team_a.write(l, r+1, 0); team_b.write(l, r+1, 1); } } score_a += team_a.count(0, N); score_b += team_b.count(0, N); cout << score_a << " " << score_b << endl; return 0; }