NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#211422	#3803. 激光	sean1381	0	9076ms	13984kb	C++11	5.1kb	2024-08-11 11:45:09	2024-08-11 13:12:46

answer

#include<bits/stdc++.h>
using namespace std;
int n,m,k,x,y,u,v;
struct pir{
    int a,b;
};
char c[1005][1005];
int ans[1005][1005];
pir ch[1005][1005];
bool f[66][66];
/*void dfs1(int i,int j,int a,int b,int res){
    if(c[a][b]=='#'){
        return;
    }
    if(ans[a][b]){ans[i][j]+=ans[a][b];return;}
    if(c[a][b]=='X'){
        dfs()
    }
}*/
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]=='#') k++;
        }
    }
    for(int i=1;2*i<=k;i++){
        cin>>x>>y>>u>>v;
        ch[x][y].a=u;
        ch[x][y].b=v;
        ch[u][v].a=x;
        ch[u][v].b=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))
                    int a=i,b=j;
                    while(true){
                    if(c[a][b]=='#'){
                        return;
                    }
                    if(ans[a][b]){ans[i][j]+=ans[a][b];return;}
                    if(c[a][b]=='X'){
                        ans[i][j]+=(f[a][b]==0);

                    }}
                    dfs1(i,j,i,j,0);
                }
                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;
        }
        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: 0

Wrong Answer

time: 0ms

memory: 5212kb

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:

wrong answer 5001st words differ - expected: '1', found: '23'

Test #2:

score: 0

Wrong Answer

time: 81ms

memory: 5660kb

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: 363ms

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...

result:

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

Test #4:

score: 0

Wrong Answer

time: 479ms

memory: 6136kb

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: 459ms

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: 0

Wrong Answer

time: 0ms

memory: 5164kb

input:

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

output:

-1 -1 -1 
-1 2 -1 
3 -1 -1 
-1 -1 -1 
-1 0 -1 
1 -1 -1 
-1 -1 -1 
-1 0 -1 
0 -1 -1 
-1 -1 -1 
-1 0 -...

result:

wrong answer 5th words differ - expected: '7', found: '2'

Test #7:

score: 0

Wrong Answer

time: 2ms

memory: 5168kb

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:

-1 -1 1 -1 1 -1 -1 
-1 -1 2 -1 2 -1 -1 
3 3 3 3 3 3 3 
-1 -1 4 -1 4 -1 -1 
5 5 5 5 5 5 5 
-1 -1 6 -1...

result:

wrong answer 15th words differ - expected: '18', found: '3'

Test #8:

score: 0

Wrong Answer

time: 0ms

memory: 5176kb

input:

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

output:

-1 1 -1 1 1 1 1 -1 1 1 
1 2 2 2 -1 2 -1 2 2 -1 
-1 3 -1 3 3 3 3 -1 3 1 
3 -1 4 -1 4 -1 4 4 4 2 
4 5 ...

result:

wrong answer 13th words differ - expected: '17', found: '2'

Test #9:

score: 0

Wrong Answer

time: 3ms

memory: 5220kb

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 -...

result:

wrong answer 53rd words differ - expected: '4', found: '2'

Test #10:

score: 0

Wrong Answer

time: 6ms

memory: 5260kb

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:

-1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -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 64th words differ - expected: '58', found: '2'

Test #11:

score: 0

Wrong Answer

time: 2ms

memory: 5224kb

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:

-1 1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -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 64th words differ - expected: '99', found: '2'

Test #12:

score: 0

Wrong Answer

time: 0ms

memory: 5220kb

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:

wrong answer 61st words differ - expected: '3542', found: '2'

Test #13:

score: 0

Wrong Answer

time: 6ms

memory: 5220kb

input:

60 55
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
X\.........XX....X.X...XX../\../...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...

result:

wrong answer 58th words differ - expected: '3216', found: '2'

Test #14:

score: 0

Wrong Answer

time: 0ms

memory: 5220kb

input:

60 60
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
X...\\XXX//../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...

result:

wrong answer 62nd words differ - expected: '3422', found: '2'

Test #15:

score: 0

Wrong Answer

time: 3ms

memory: 5224kb

input:

60 60
.XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX.
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...

result:

wrong answer 63rd words differ - expected: '2021', found: '2'

Test #16:

score: 0

Wrong Answer

time: 298ms

memory: 9632kb

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: 356ms

memory: 9312kb

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: 390ms

memory: 6144kb

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: 369ms

memory: 6140kb

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: 350ms

memory: 6140kb

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: 416ms

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 ...

result:

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

Test #22:

score: 0

Wrong Answer

time: 524ms

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 ...

result:

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

Test #23:

score: 0

Wrong Answer

time: 345ms

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: 239ms

memory: 5848kb

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: 390ms

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: 349ms

memory: 13984kb

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: 389ms

memory: 7360kb

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: 326ms

memory: 6144kb

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: 346ms

memory: 6144kb

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: 349ms

memory: 6144kb

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: 391ms

memory: 6144kb

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: 654ms

memory: 6140kb

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: 496ms

memory: 6140kb

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: 352ms

memory: 6228kb

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: 343ms

memory: 6140kb

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'