Lucky numbers

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define ld long double
#define defmod 1000000007

#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;


int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	srand(time(0));
	int n, m; cin >> n >> m;
	vector<int> lol[1010];
	for(int i = 0; i < n; ++i){
		lol[i] = vector<int>(7);
		for(int j = 0; j < 7; ++j)
			cin >> lol[i][j];
	}

	string ans = "";
	int cc = 10000;
	while(cc--){
		string a(m+1, '0');
		for(int i = 0; i < n; ++i){
			for(int j = 0; j < 7; ++j){
				if(rand()%10 < 5)
					a[abs(lol[i][j])] = '1';
				else
					a[abs(lol[i][j])] = '0';
			}
		}
		bool ok = true;
		for(int i = 0; i < n; ++i){
			bool ok2 = false;
			for(int j = 0; j < 7; ++j){
				if(lol[i][j] < 0 && a[-lol[i][j]] == '1')
					ok2 = true;
				else if(lol[i][j] > 0 && a[lol[i][j]] == '1')
					ok2 = true;
			}
			if(!ok2){
				ok = false;
				break;
			}
		}
		
		if(ok){
			ans = a.substr(1, m);
			break;
		}
	}
	if(ans.length() == 0)
		cout << "UNSAT" << endl;
	else
		cout << "SAT" << endl << ans << endl;
	return 0;
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: RUNTIME ERROR