Sudoku

#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long

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

#define defmod 1000000007
using namespace std;


int su[9][9] = {0};
int n = 9;
void dbg(){
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cout << su[i][j];
		}
		cout << endl;
	}
}
bool onkook(){
	for(int i = 0; i < 9; i++){
		bool kay[10] = {0};
		for(int j = 0; j < 9; j++)
			kay[su[i][j]] = 1;
		for(int j = 1; j <= 9; j++)
			if(!kay[j])
				return false;
	}
	for(int i = 0; i < 9; i++){
		bool kay[10] = {0};
		for(int j = 0; j < 9; j++)
			kay[su[j][i]] = 1;
		for(int j = 1; j <= 9; j++)
			if(!kay[j])
				return false;
	}
	vector<pair<int, int> > v;
	v.push_back({0, 0});
	v.push_back({3, 0});
	v.push_back({6, 0});
	v.push_back({0, 3});
	v.push_back({3, 3});
	v.push_back({6, 3});
	v.push_back({0, 6});
	v.push_back({3, 6});
	v.push_back({6, 6});
	for(auto f: v){
		int i = f.first;
		int j = f.second;
		bool kay[10] = {0};
		for(int k = i/3*3; k < (i+3)/3*3; k++){
			for(int l = j/3*3; l < (j+3)/3*3; l++){
				kay[su[k][l]] = 1;
				//d[k][l] = 1;
				//cout << "kaydaan " << k << ", " << l << endl;

			}
		}
		for(int j = 1; j <= 9; j++)
			if(!kay[j])
				return false;
	}
	return true;
}
bool hae(int r, int t){
	//cout << "nyt " << r << " " << t << endl;
	if(r >= 9){

		bool lol = onkook();
		//dbg();
		//cout << lol << " oliko oikein" << endl;
		//int tmp; cin >> tmp;
		return lol;
		
	}
	deque<int> jee;
	int i = r; int j = t;
			//cout << "paikka " << i << ", " << j << ":" << endl;
	vector<bool> kay(10, 1);
			//bool d[9][9] = {0};
	for(int k = j-1; k >= 0; k--){
		kay[su[i][k]] = 0;
				//d[i][k] = 1;
				//cout << "kaydaan " << i << ", " << k << endl;
	}
	for(int k = i-1; k >= 0; k--){
		kay[su[k][j]] = 0;
				//d[k][j] = 1;
				//cout << "kaydaan " << k << ", " << j << endl;
	}
	for(int k = i/3*3; k < (i+3)/3*3; k++){
		for(int l = j/3*3; l < (j+3)/3*3; l++){
			kay[su[k][l]] = 0;
					//d[k][l] = 1;
					//cout << "kaydaan " << k << ", " << l << endl;

		}
	}
			
			

			/*cout << endl;
			for(int o = 0; o < n; o++){
				for(int p = 0; p < n; p++){
					cout << d[o][p];
				}
				cout << endl;
			}*/
		
	
	for(int k = 1; k <= 9; k++){
		if(kay[k]){
			jee.push_back(k);
		}
	}
	bool ohi = false;
	while(!jee.empty()){
		su[r][t] = jee.front();
		jee.pop_front();
		if(t >= 8)
			ohi|=hae(r+1, 0);
		else
			ohi|=hae(r, t+1);
		if(ohi)
			return true;

	}
	su[r][t] = 0;
	return ohi;

}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	string s; cin >> s;
	
	for(int i = 0; i < n; i++){
		su[0][i] = s[i]-'0';
	}
	hae(1, 0);
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cout << su[i][j];
		}
		cout << endl;
	}

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED