11926 - Multitasking.cpp

/*input
*/

#include <stdio.h>
#include <cmath>
#include <set> 
#include <vector>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string.h>
#include <stack>
#include <map>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <functional>
#include <bitset>

using namespace std;

#define r(input) freopen("input.txt","r",stdin)
#define w(output) freopen("output.txt","w",stdout)

#define FOR(i, a) for ( int i = 0 ; i < a ; i++ )
#define FOREACH(l) for (auto it = l.begin(); it != l.end(); it++)

#define BitCount(i) __builtin_popcount(i)
#define Sort(v) sort(v.begin(),v.end())
#define cover(a, d) memset(a,d,sizeof(a))
#define remove(v,e) v.erase(std::find(v.begin(),v.end(),e))
#define is_in(container, element) (container.find(element) != container.end())
#define SWAP(a,b) a= a^b, b=a^b, a=a^b

#define sz size
#define pb push_back
#define mp make_pair
#define ft first
#define sd second

#define VISITED 1
#define UNVISITED 0
#define INF 1000000000

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef pair<int,ii> triple;

inline int toint(string s){ll v; istringstream sin(s);sin>>v;return v;}
inline ll toll(string s){ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
template<class T> inline char toChar(T x) { ostringstream sout; sout << x; return sout.str()[0];}


class Compare
{
public:
	bool operator() (ii t1 , ii t2){
		return t1>t2;
	}
	
};

int main()
{
	int n , m;
	while ( cin >> n >>m)
	{
		if (!n && !m) break;
		bitset<1000500> tl;
		bool con = false;
		FOR(i , n)
		{
			int st , end;
			cin >> st >> end;
			for ( int j = st; j < end; j++)
			{
				if(tl[j]) 
				{

					con = true;
					//cout << j << endl;
					break;
				}
				tl[j] = 1;
			}
		}

		FOR(i , m)
		{
			int st , end, rep;
			cin >> st >> end >> rep;
			for ( int beg = st ; beg <= 1000000; beg+=rep)
			{
				for ( int j = beg; j < end; j++)
				{
					if(j > 1000000) break;
					if(tl[j]) 
					{	
						//cout << j << endl;
						con = true;
						break;
					}
					tl[j] = 1;
				}
				end += rep;
			}	
		}

		if(con) cout << "CONFLICT"<< endl;
		else	cout << "NO CONFLICT"<< endl;
	}
}