UVA_11926_Multitasking

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <bitset>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
bitset<2000005> bs;


int main() {
    int one, rep, s, e, itv;
    bool conflict;
    while (scanf("%d %d", &one, &rep), one || rep) {
        conflict = false;

        for (int i = 0; i < one; i++) {
            scanf("%d %d", &s, &e);
            if (!conflict) {
                for (int j = 2 * s + 1; j <= 2 * e; j++) {
                    if (bs.test(j)) {
                        conflict = true;
                        break;
                    }
                    bs.set(j);
                }
            }
        }

        for (int i = 0; i < rep; i++) {
            scanf("%d %d %d", &s, &e, &itv);
            if (!conflict) {
                while (true) {
                    for (int j = 2 * s + 1; j <= 2 * e; j++) {
                        if (bs.test(j)) {
                            conflict = true;
                            break;
                        }
                        bs.set(j);
                    }
                    s += itv;
                    e += itv;
                    if (s > 1000000 && e > 1000000)
                        break;
                    else if (e > 1000000)
                        e = 1000000;
                }
            }
        }

        if (conflict)
            printf("CONFLICT\n");
        else
            printf("NO CONFLICT\n");

        for (int i = 0; i < 2000005; i++) {
            bs.reset(i);
        }
    }

    return 0;
}