NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#211431	#3803. 激光	sean1381	9	11167ms	14004kb	C++11	6.7kb	2024-08-11 12:40:48	2024-08-11 13:16:05

answer

#include<bits/stdc++.h>
using namespace std;
int n,m,k,x,y,u,v;
struct pir{
    int aa,bb;
};
char c[1005][1005];
int ans[1005][1005];
pir ch[1005][1005];
bool f[66][66];
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>c[i][j];
            if(c[i][j]=='X') k++;
        }
    }
    for(int i=1;2*i<=k;i++){
        cin>>x>>y>>u>>v;
        ch[x][y].aa=u;
        ch[x][y].bb=v;
        ch[u][v].aa=x;
        ch[u][v].bb=y;
    }
    if(n<=60&&m<=60){
        int cnt=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.'){
                    memset(f,0,sizeof(f)),cnt=0;
                    int a=i,b=j,p,t=1,ft=1;
                    while(true){if(a>n||a<1||b<1||b>m)break;if(c[a][b]=='#'){break;}cnt+=(f[a][b]==0);f[a][b]=1;
                        if(c[a][b]=='X'){if(ft){p=a;a=ch[p][b].aa;b=ch[p][b].bb;ft=0;}else{ft=1;if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}}else if(c[a][b]=='/'){if(t==1){t=2;b++;}else if(t==2){t=1;a--;}else if(t==3){t=4;b--;}else if(t==4){t=3;a++;}}else if(c[a][b]=='.'){if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}else{if(t==1){t=4;b--;}else if(t==2){t=3;a++;}else if(t==3){t=2;b++;}else if(t==4){t=1;a--;}}}
                    ans[i][j]=cnt;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.')cout<<ans[i][j]<<' ';
                else cout<<-1<<' ';
            }
            cout<<endl;
        }
        cnt=0;memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.'){
                    memset(f,0,sizeof(f)),cnt=0;
                    int a=i,b=j,p,t=3,ft=1;
                    while(true){if(a>n||a<1||b<1||b>m)break;if(c[a][b]=='#'){break;}cnt+=(f[a][b]==0);f[a][b]=1;
                        if(c[a][b]=='X'){if(ft){p=a;a=ch[p][b].aa;b=ch[p][b].bb;ft=0;}else{ft=1;if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}}else if(c[a][b]=='/'){if(t==1){t=2;b++;}else if(t==2){t=1;a--;}else if(t==3){t=4;b--;}else if(t==4){t=3;a++;}}else if(c[a][b]=='.'){if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}else{if(t==1){t=4;b--;}else if(t==2){t=3;a++;}else if(t==3){t=2;b++;}else if(t==4){t=1;a--;}}}
                    ans[i][j]=cnt;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.')cout<<ans[i][j]<<' ';
                else cout<<-1<<' ';
            }
            cout<<endl;
        }
        cnt=0;memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.'){
                    memset(f,0,sizeof(f)),cnt=0;
                    int a=i,b=j,p,t=4,ft=1;
                    while(true){if(a>n||a<1||b<1||b>m)break;if(c[a][b]=='#'){break;}cnt+=(f[a][b]==0);f[a][b]=1;
                        if(c[a][b]=='X'){if(ft){p=a;a=ch[p][b].aa;b=ch[p][b].bb;ft=0;}else{ft=1;if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}}else if(c[a][b]=='/'){if(t==1){t=2;b++;}else if(t==2){t=1;a--;}else if(t==3){t=4;b--;}else if(t==4){t=3;a++;}}else if(c[a][b]=='.'){if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}else{if(t==1){t=4;b--;}else if(t==2){t=3;a++;}else if(t==3){t=2;b++;}else if(t==4){t=1;a--;}}}
                    ans[i][j]=cnt;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.')cout<<ans[i][j]<<' ';
                else cout<<-1<<' ';
            }
            cout<<endl;
        }cnt=0;memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.'){
                    memset(f,0,sizeof(f)),cnt=0;
                    int a=i,b=j,p,t=2,ft=1;
                    while(true){if(a>n||a<1||b<1||b>m)break;if(c[a][b]=='#'){break;}cnt+=(f[a][b]==0);f[a][b]=1;
                        if(c[a][b]=='X'){if(ft){p=a;a=ch[p][b].aa;b=ch[p][b].bb;ft=0;}else{ft=1;if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}}else if(c[a][b]=='/'){if(t==1){t=2;b++;}else if(t==2){t=1;a--;}else if(t==3){t=4;b--;}else if(t==4){t=3;a++;}}else if(c[a][b]=='.'){if(t==1){a--;}if(t==2){b++;}if(t==3){a++;}if(t==4){b--;}}else{if(t==1){t=4;b--;}else if(t==2){t=3;a++;}else if(t==3){t=2;b++;}else if(t==4){t=1;a--;}}}
                    ans[i][j]=cnt;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(c[i][j]=='.')cout<<ans[i][j]<<' ';
                else cout<<-1<<' ';
            }
            cout<<endl;
        }
        return 0;
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(c[i][j]=='.'){
                for(int l=i;l>=1;l--){
                    if(c[l][j]=='#') break;
                    if(ans[l][j]){ ans[i][j]+=ans[l][j];break;}
                    ans[i][j]++;
                }
                cout<<ans[i][j]<<' ';
            }
            else cout<<-1<<' ';
        }
        cout<<endl;
    }
    memset(ans,0,sizeof(ans));
    for(int i=n;i>=1;i--){
        for(int j=1;j<=m;j++){
            if(c[i][j]=='.'){
                for(int l=i;l<=n;l++){
                    if(c[l][j]=='#') break;
                    if(ans[l][j]){ ans[i][j]+=ans[l][j];break;}
                    ans[i][j]++;
                }
                
            }else ans[i][j]=-1;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<ans[i][j]<<' ';
        }
        cout<<endl;
    }
    memset(ans,0,sizeof(ans));
    for(int i=1;i<=n;i++){
        for(int j=m;j>=1;j--){
            if(c[i][j]=='.'){
                for(int l=j;l<=n;l++){
                    if(c[i][l]=='#') break;
                    if(ans[i][l]){ ans[i][j]+=ans[i][l];break;}
                    ans[i][j]++;
                }
                
            }else ans[i][j]=-1;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<ans[i][j]<<' ';
        }
        cout<<endl;
    }
    memset(ans,0,sizeof(ans));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(c[i][j]=='.'){
                for(int l=j;l>=1;l--){
                    if(c[i][l]=='#') break;
                    if(ans[i][l]){ ans[i][j]+=ans[i][l];break;}
                    ans[i][j]++;
                }
                
            }else ans[i][j]=-1;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<ans[i][j]<<' ';
        }
        cout<<endl;
    }

}

源文件, 语言: C++11

详细

小提示：点击横条可展开更详细的信息

Test #1:

score: 3

Accepted

time: 2ms

memory: 5216kb

input:

50 50
.......................#.........#................
..............................................

output:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

ok 10000 tokens

Test #2:

score: 0

Wrong Answer

time: 94ms

memory: 5656kb

input:

500 500
...............................................................................................

output:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

wrong answer 500001st words differ - expected: '1', found: '229'

Test #3:

score: 0

Wrong Answer

time: 373ms

memory: 6148kb

input:

1000 1000
#.....#..#...............#..#.##......#......#...........#....#....#.#.......#..........##...

output:

-1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 1 1 -1...

result:

wrong answer 2000002nd words differ - expected: '1', found: '5'

Test #4:

score: 0

Wrong Answer

time: 347ms

memory: 6140kb

input:

990 831
...............................................................................................

output:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

wrong answer 1645381st words differ - expected: '1', found: '990'

Test #5:

score: 0

Wrong Answer

time: 362ms

memory: 6144kb

input:

1000 1000
.............................................................................................

output:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

wrong answer 2000001st words differ - expected: '1', found: '1000'

Test #6:

score: 3

Accepted

time: 3ms

memory: 5184kb

input:

3 3
/X\
X.X
.X/
1 2 2 3
2 1 3 2

output:

-1 -1 -1 
-1 7 -1 
7 -1 -1 
-1 -1 -1 
-1 4 -1 
1 -1 -1 
-1 -1 -1 
-1 4 -1 
1 -1 -1 
-1 -1 -1 
-1 7 -...

result:

ok 36 tokens

Test #7:

score: 0

Time Limit Exceeded

input:

7 7
/X.X.X\
X\.\./X
.......
X\././X
.......
X\./.\X
\X.X.X/
1 2 7 2
1 4 7 4
1 6 7 6
2 1 2 7
4 1 4 7
...

output:

result:

Test #8:

score: 0

Time Limit Exceeded

input:

9 10
#./....\..
..../.X..#
/.X..../..
./.\./....
..X../..#.
\/.\...\..
..X...\/..
.X....X..\
....X.....

output:

result:

Test #9:

score: 0

Time Limit Exceeded

input:

50 50
.././.\.\\.\\.\/\\.//..\\..//\./////..\//..//\\...
\.....\..../\\/..\/././\.//.\\\.\\/\\\..\//...

output:

result:

Test #10:

score: 0

Time Limit Exceeded

input:

60 60
X..XXX.../...XXX././X..\..X....XX.X.X./X....XXX....\XXX.X.X.
XX..XX.//..XX\.X...X.X...X.....X....

output:

result:

Test #11:

score: 0

Time Limit Exceeded

input:

60 60
X..XXXX..X...XXX.X.XX..X..XXXXXXX.X.X.XXX.X.XXXX.X.XXXX.XXX.
XX..XX.XX..XXX.X...X.X.XXX..X..X....

output:

result:

Test #12:

score: 3

Accepted

time: 51ms

memory: 5228kb

input:

60 60
/..........................................................\
./..................................

output:

-1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...

result:

ok 14400 tokens

Test #13:

score: 0

Time Limit Exceeded

input:

60 55
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
X\.........XX....X.X...XX../\../...X.....

output:

result:

Test #14:

score: 0

Time Limit Exceeded

input:

60 60
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
X...\\XXX//../X/////...\..\.\/X.X...

output:

result:

Test #15:

score: 0

Time Limit Exceeded

input:

60 60
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
X/..\\/..//.././////...\..\.\/......

output:

result:

Test #16:

score: 0

Wrong Answer

time: 398ms

memory: 14000kb

input:

1000 899
........X...X..X...X.X.....X.....X...............X.XX.X.X............X..X.X.X..X..............

output:

1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1...

result:

wrong answer 908th words differ - expected: '239', found: '2'

Test #17:

score: 0

Wrong Answer

time: 495ms

memory: 14000kb

input:

1000 1000
X.....XXXX.X...X.........X..X.XX...X.XX......X........X..X....X....X.X.......X.......X..XX...

output:

-1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 ...

result:

wrong answer 1007th words differ - expected: '1301', found: '2'

Test #18:

score: 0

Wrong Answer

time: 953ms

memory: 14000kb

input:

1000 1000
XXX...XXXXXXXXXXXXXX.XXXXXXXXXXXXXXX.XXX.X.XXXXXX.XX..X.XXXXXXXXXXXXXXXXXXXXXX.XXXXX.XXXXX...

output:

-1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1011th words differ - expected: '2203', found: '2'

Test #19:

score: 0

Wrong Answer

time: 631ms

memory: 10280kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '420525', found: '2'

Test #20:

score: 0

Wrong Answer

time: 359ms

memory: 11288kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '1000', found: '2'

Test #21:

score: 0

Wrong Answer

time: 387ms

memory: 6148kb

input:

1000 1000
...../\..../.\......//././/./\\./../..\/.......\\.\.....\\\\//.\.../.\....\...\../././../\...

output:

1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 ...

result:

wrong answer 1006th words differ - expected: '9', found: '2'

Test #22:

score: 0

Wrong Answer

time: 296ms

memory: 6148kb

input:

1000 1000
......\...................../................................................................

output:

1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

wrong answer 1007th words differ - expected: '8', found: '2'

Test #23:

score: 0

Wrong Answer

time: 331ms

memory: 6144kb

input:

1000 1000
/............................................................................................

output:

-1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...

result:

wrong answer 1001st words differ - expected: '999002', found: '2'

Test #24:

score: 0

Wrong Answer

time: 246ms

memory: 5856kb

input:

700 1000
/.............................................................................................

output:

-1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...

result:

wrong answer 1001st words differ - expected: '489302', found: '2'

Test #25:

score: 0

Wrong Answer

time: 406ms

memory: 6144kb

input:

1000 1000
#.....#\/................\..#\#\\/...../.....#..\........#.\..#\...\.\........\/../../...\...

output:

-1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 1 1 ...

result:

wrong answer 1009th words differ - expected: '25', found: '2'

Test #26:

score: 0

Wrong Answer

time: 603ms

memory: 14004kb

input:

1000 1000
.........X.\........\.......#..X............/#....\........./.............X.......X..........

output:

1 1 1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1...

result:

wrong answer 1010th words differ - expected: '62', found: '2'

Test #27:

score: 0

Wrong Answer

time: 677ms

memory: 14000kb

input:

1000 1000
...../\\./.X.......X/..../../\.../.X..\X..........\...\..\.X/XX..../.X.....\...X...../XX.....

output:

1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 ...

result:

wrong answer 1006th words differ - expected: '203', found: '2'

Test #28:

score: 0

Wrong Answer

time: 388ms

memory: 11064kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '964933', found: '2'

Test #29:

score: 0

Wrong Answer

time: 358ms

memory: 12656kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '1000', found: '2'

Test #30:

score: 0

Wrong Answer

time: 363ms

memory: 11792kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '886109', found: '2'

Test #31:

score: 0

Wrong Answer

time: 419ms

memory: 14000kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1002nd words differ - expected: '547503', found: '2'

Test #32:

score: 0

Wrong Answer

time: 367ms

memory: 10704kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1010th words differ - expected: '831504', found: '2'

Test #33:

score: 0

Wrong Answer

time: 710ms

memory: 14004kb

input:

1000 1000
\.XXX/\X..X\XXXX.XXXXX.X.X.X/X.\XX.XX.\XXX.XXXXX\X\.XX.XX\XX/X.X.XXXXXXXXXXX.X\XXXXXXXXX/....

output:

-1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -...

result:

wrong answer 1005th words differ - expected: '425', found: '2'

Test #34:

score: 0

Wrong Answer

time: 771ms

memory: 14000kb

input:

1000 1000
X..XXXXX.XXXXXXX.XXXXX.X.X.XXXXXXX.XX.XXXX.XXX.XXXXX.X.XXXXXXX.X.XXXXXXX..XX.XXXXXXXXXXX.....

output:

-1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 ...

result:

wrong answer 1006th words differ - expected: '835', found: '2'

Test #35:

score: 0

Wrong Answer

time: 777ms

memory: 14004kb

input:

1000 1000
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX...

output:

1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...

result:

wrong answer 1003rd words differ - expected: '999506', found: '2'