Spies, Revised


Problem Statement :


Two spies in a grid will have their covers blown if:

1 . They are both in the same row.
2. They are both in the same column.
3. They can see each other diagonally (i.e., lie in a line inclined 45° or 135° to the base of the grid).

The level of danger is now increased! In addition to the conditions above, no 3 spies may lie in any straight line. This line need not be aligned 45° or 135° to the base of grid.

Write a program in the language of your choice to place N spies (one spy per row) on an N x N grid without blowing anyone's cover. Your program must then print the following 2 lines describing a valid configuration:

1. The value of N.
2. A space-separated list of 1-indexed column numbers, where each value i is the column number of the spy in row i (where 1  <=  i  <=  N ).

Solve this problem for N as large as possible, up to (and including) 999.

Note: Run and Custom Input are not available for this challenge; you must click Submit Code for your submission to be scored. Your score for this challenge will always be the maximum value scored by any of your submissions.

Examples

In the examples below, S denotes a spy and * denotes an empty cell.


Input Format

There is no input for this challenge.

Constraints

N is odd.
N  <  1000  (Do not submit for any value of N larger than 999 )


Output Format

Print the following 2 lines of output:

1. The first line should be a single integer denoting the value of N.
2 .The second line should contain a space-separated list of integers . Each integer i (where 1 < i  <=  N) should be the 1-indexed column number where the spy in row i is located.


Solution :



title-img


                            Solution in C :

In   Python3  : ( Problem has Ambiguity )







import random
n=11
list_of_numbers=[]
final_list=[]
rows=[]
colomns=[]


def check(a):
    for k in final_list:
        chk1=[]
        chk2=[]
        x=k[0]
        y=k[1]
        for i in range(n):
            for j in range(n):
                if i==j:
                   if [x+i,y+j] in final_list:
                        return 0
                   if [x-i,y-j] in final_list:
                       return 0
                elif [x+i,y+j] in final_list:
                    chk1.append([x+i,y+j])
                    if len(chk1)>2:
                        return 0
                elif [x-i,y-j] in final_list:
                    chk2.append([x-i,y-j])
                    if len(chk2)>2:
                        return 0

for i in range(n):
        list_of_numbers.append(i)            
def number_generator():
    while(1):
        r = random.choice(list_of_numbers)
        c = random.choice(list_of_numbers)
        if r not in rows and c not in colomns:
            rows.append(r)
            colomns.append(c)
            final_list.append([c,r])
        if len(final_list)==n:
            break       
number_generator()           
while(1):
    if not check(1):

        final_list=[]
        rows=[]
        colomns=[]
        
        number_generator()
    else:
        print(final_list)
        new_list=[]
        for i in final_list:
            new_list.append(i[0]*n + (i[1]+1))
        new_list.sort()
        for i in new_list:
            print(i, end=" ")
        break
                        




View More Similar Problems

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →

Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →

Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →