Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int queensAttack(int n, int k, int r_q, int c_q, vector<vector<int>> obstacles) {
- int count(0);
- for(int i(r_q+1); i<=n;++i){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==c_q){
- a=1;
- break;
- };
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(c_q+1); i<=n;++i){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==r_q&&x[1]==i){
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(r_q-1); i>=1;--i){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==c_q) {
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(c_q-1); i>=1;--i){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==r_q&&x[1]==i) {
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(r_q+1), j(c_q+1); n>=i&&n>=j;++i, ++j){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==j) {
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(r_q-1), j(c_q-1); 1<=i&&1<=j;--i, --j){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==j){
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(r_q+1), j(c_q-1); n>=i&&1<=j;++i, --j){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==j) {
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- for(int i(r_q-1), j(c_q+1); 1<=i&&n>=j;--i, ++j){
- bool a(0);
- for(auto x: obstacles){
- if (x[0]==i&&x[1]==j) {
- a=1;
- break;
- }
- }
- if(a){
- break;
- }
- ++count;
- }
- return count;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement