| Show all threads Hide all threads Show all messages Hide all messages |
| Problem description | LaVuna [NULP] | 1221. Malevich Strikes Back! | 12 Feb 2021 15:39 | 1 |
You should find maximum matrix which is square, black and also contains white square inside rotated by 45 degrees. For instance:
1)
1 1 1 0 1 1 1
1 1 0 0 0 1 1
1 0 0 0 0 0 1
0 0 0 0 0 0 0
1 0 0 0 0 0 1
1 0 0 0 0 1 1
1 1 1 0 1 1 1
2)
1 1 1 1 0 1 1 1 1
1 1 1 0 0 0 1 1 1
1 1 0 0 0 0 0 1 1
1 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1
1 1 0 0 0 0 0 1 1
1 1 1 0 0 0 1 1 1
1 1 1 1 0 1 1 1 1
are desired matrices maximum width of which you must find |
| WA3…… | LeiQ | 1221. Malevich Strikes Back! | 28 Oct 2017 16:53 | 3 |
WA3…… LeiQ 31 Oct 2016 17:50 I test all case in discussion,but all answers right...
Can someone help..Thanks!!! ...solved...
one test case:
8
1 1 0 0 1 0 1 1
1 0 0 0 0 0 0 1
1 1 1 1 1 0 1 1
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
answer: 3 It's working for me but still WA3 |
| Why is problem in dp topic??? | Anatolich | 1221. Malevich Strikes Back! | 23 Dec 2016 19:40 | 1 |
Maybe there is just small limits or not right topic??
|
| 20x20, No sulution,9 | esbybb | 1221. Malevich Strikes Back! | 28 Nov 2016 00:17 | 2 |
20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1
1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1
1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 also 9
20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1
1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 0 1 1 1 1 1
1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 |
| Help me I got WA 1 | KillThemAll[Xupypr] | 1221. Malevich Strikes Back! | 5 Apr 2016 16:20 | 3 |
I got WA 1. I think this problem is, easy but WA 1!!! I was also getting WA on test case 1.The correct pattern for 7 is-
7
1 1 1 0 1 1 1
1 1 0 0 0 1 1
1 0 0 0 0 0 1
0 0 0 0 0 0 0
1 0 0 0 0 0 1
1 1 0 0 0 1 1
1 1 1 0 1 1 1
at first it seems -
7
1 1 1 0 1 1 1
1 0 0 0 0 0 1
1 0 0 0 0 0 1
0 0 0 0 0 0 0
1 0 0 0 0 0 1
1 0 0 0 0 0 1
1 1 1 0 1 1 1
Edited by author 09.06.2005 16:00 I had this stupid WA
I printed "No solution7" |
| WHY WA2 | gamepro | 1221. Malevich Strikes Back! | 13 Nov 2015 15:00 | 1 |
If anyone knows what test 2 is? |
| Is there better solution then O(n^3) for each test? | vgu | 1221. Malevich Strikes Back! | 1 Nov 2013 01:17 | 4 |
How I can do it on 0.001?
Edited by author 31.10.2008 02:29
Edited by author 16.06.2009 00:42 |
| Tests | Alexander Samal | 1221. Malevich Strikes Back! | 25 Feb 2013 19:51 | 3 |
Tests Alexander Samal 27 Nov 2009 11:34 8
1 0 1 1 1 1 1 1
0 0 0 1 1 1 1 1
1 0 1 1 1 1 1 1
1 1 1 1 0 1 1 1
1 1 1 0 0 0 1 1
1 1 0 0 0 0 0 1
1 1 1 0 0 0 1 1
1 1 1 1 0 1 1 1
8
1 0 1 1 1 1 1 1
0 0 0 1 1 1 1 1
1 0 1 1 1 1 1 1
1 1 1 1 0 1 1 1
1 1 1 0 0 0 1 1
1 1 0 0 1 0 0 1
1 1 1 0 0 0 1 1
1 1 1 1 0 1 1 1
0
Answers:
5
3 Re: Tests monyura[ONU 1 2/3] 2 Nov 2011 02:50 5
1 1 1 1 1
1 1 0 1 1
1 0 0 0 1
1 1 0 1 1
1 1 0 1 1
Answer:
3 That's a good test indeed!
Some more:
6
1 1 1 1 1 1
1 1 0 1 1 1
1 0 0 0 1 1
1 1 0 1 1 1
1 1 0 1 1 1
1 1 1 1 1 1
> 3
6
1 1 1 1 1 1
1 1 0 1 1 1
1 0 0 0 1 1
1 1 0 1 1 1
1 1 1 1 1 1
1 1 1 1 1 1
> 3
6
1 1 1 0 1 1
1 1 0 0 1 1
1 0 0 0 0 1
1 1 0 0 1 1
1 1 1 0 1 1
1 1 1 1 1 1
> No solution
6
1 1 1 0 1 1
1 1 0 1 1 1
1 0 0 0 0 1
1 1 0 1 1 1
1 1 1 0 1 1
1 1 1 1 1 1
> 3 |
| test 2 in sample seems to be wrong? | Abhishek G. Nanda | 1221. Malevich Strikes Back! | 29 Nov 2011 07:42 | 1 |
isn't the output for:
1 0 0 1
0 0 0 0
0 0 0 0
1 0 0 1
supposed to be 1?
the 1x1 sub-matrix containing just a single 0 should be a valid figure to cut out |
| This test helped me in 1-test | Yusupov Azat(TUIT Urgench) | 1221. Malevich Strikes Back! | 21 Jul 2011 17:06 | 1 |
8
1 0 1 1 0 1 1 1
0 0 0 1 0 1 1 1
1 0 1 1 0 1 1 1
1 1 1 1 0 1 1 1
1 1 1 0 0 0 1 1
1 1 0 0 0 0 0 1
1 1 1 0 0 0 1 1
1 1 1 1 0 1 1 1
0
answer: 5 |
| Please explain algo to me! | Vasily Slesarev | 1221. Malevich Strikes Back! | 27 Jun 2011 14:40 | 3 |
O(n^4) for a test passes system test in 0.031. But can anyone explain to me a better algo? Apply the GOOD JOB for College ACMers to Make Large Money and Become a Millionaire Hello, We need large no. of dedicated and hard working ACMers. The payment is good so we need ACMers to be efficient. All you have to do to get the job is to sign up at our websites. The link of our websites are given below. http://www.PaisaLive.com/register.asp?3556638-4847933 After the registration, a confirmation email will be sent to your specified email address. Please click on the link inside the confirmation email to activate your account and recieve ACM work instantly. For any other queries you can mail the administrator. Miss Juliet Admin paisalive.com |
| WA#1 | hoan | 1221. Malevich Strikes Back! | 21 Dec 2010 19:34 | 1 |
WA#1 hoan 21 Dec 2010 19:34 here is test:
input:
7
1 1 1 0 1 1 1
1 0 0 0 0 0 1
1 0 0 0 0 0 1
0 0 0 0 0 0 0
1 0 0 0 0 0 1
1 0 0 0 0 0 1
1 1 1 0 1 1 1
0
output:
No solution
first my program write 3 for this.
hope can help you!!! |
| time limited error | pyh119_2007OnlineJudge | 1221. Malevich Strikes Back! | 13 Mar 2007 18:45 | 1 |
|
| Why I got WA on the 1st test case? Need your help. Thanks | MultiThread | 1221. Malevich Strikes Back! | 10 Jun 2006 17:36 | 1 |
I use full search to solve this problem. But I don't know why WA for the 1st case. My code below:
[code deleted]
Thanks.
Edited by moderator 10.06.2006 21:12 |
| why time limit 1 test | famas | 1221. Malevich Strikes Back! | 27 Apr 2005 00:56 | 1 |
program Project2;
{$APPTYPE CONSOLE}
uses
SysUtils;
var
zzz:array[1..100,1..100,1..100] of byte;
a:array[1..100,1..100] of byte;
i,j,n,otv:integer;
procedure profi(x:integer);
var
i1,j1,i2,j2:integer;
qy:boolean;
begin
i1:=1;
repeat
j1:=1;
repeat
qy:=true;
for i2:=i1 to n do
for j2:=j1 to n do
if a[i2,j2]<>zzz[x,i2-i1+1,j2-j1+1] then qy:=false;
inc(j1);
until (j1+x>n) or qy;
inc(i1);
until (i1+x>n) or qy;
if qy then otv:=x;
end;
begin
for n:=3 to 100 do
if n mod 3 = 0 then
begin
for i:=1 to n div 2 do
for j:=1 to n div 2-i+1 do
begin
zzz[n,i,j]:=1;
zzz[n,i,n-j+1]:=1;
zzz[n,n-i+1,j]:=1;
zzz[n,n-i+1,n-j+1]:=1;
end;
end;
repeat
fillchar(a,sizeof(a),0);
readln(n);
if n>2 then
begin
for i:=1 to n do
begin
otv:=0;
for j:=1 to n do
read(a[i,j]);
readln;
end;
for i:=n downto 3 do
if (i mod 2 =1) and (otv=0) then profi(i);
if otv=0 then writeln('No solution')
else writeln(otv);
end
else
if n<>0 then writeln('No solution');
until n=0;
end.
end. |
| who can explain the problem description to me ? | Samball | 1221. Malevich Strikes Back! | 22 Oct 2004 04:53 | 4 |
I simplely do not understand it; OK. You task is to find in this matrix a sub-matrix with maximal size
which looks like picture in text of problem. Warning! Size of it is
odd number. There are some methods to solve it, but the most simple
(but longest) is "mask-algo". I used it and after 0.38 I've get AC. What's is mask-algo?? OK. You task is to find in this matrix a sub-matrix with maximal size
which looks like picture in text of problem. Warning! Size of it is
odd number. There are some methods to solve it, but the most simple
(but longest) is "mask-algo". I used it and after 0.38 I've get AC. Edited by author 27.04.2004 14:49 |
| In fact this problem is so easy that you can only use full search to pass it! | charles.king | 1221. Malevich Strikes Back! | 29 Apr 2004 14:02 | 1 |
|
