Submission #54601516

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
int n,m,k,t,l;
char mp[210][210];
int main() {
    cin>>n>>m>>k;
    if (k<n||(k-n)%2) {
        cout<<"No\n";
        return 0;
    }
    cout<<"Yes\n";
    for (int i=1;i<=2*n+1;i++) for (int j=1;j<=2*m+1;j++) mp[i][j]='.';
    for (int i=1;i<=2*m+1;i++) mp[1][i]='+',mp[2*n+1][i]='+';
    for (int i=1;i<=2*n+1;i++) mp[i][1]='+',mp[i][2*m+1]='+';
    mp[1][2*m]='S';
    mp[2*n+1][2*m]='G';
    for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) mp[2*i][2*j]='o';
    for (int i=1;i<n;i++) for (int j=1;j<m;j++) mp[2*i+1][2*j+1]='+';
    if (m>1) for (int i=1;i<=n;i++) mp[2*i][2*m-1]='|';
    t=(k-n)/2;
    for (int i=1;i<=n/2;i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
int n,m,k,t,l;
char mp[210][210];
int main() {
    cin>>n>>m>>k;
    if (k<n||(k-n)%2) {
        cout<<"No\n";
        return 0;
    }
    cout<<"Yes\n";
    for (int i=1;i<=2*n+1;i++) for (int j=1;j<=2*m+1;j++) mp[i][j]='.';
    for (int i=1;i<=2*m+1;i++) mp[1][i]='+',mp[2*n+1][i]='+';
    for (int i=1;i<=2*n+1;i++) mp[i][1]='+',mp[i][2*m+1]='+';
    mp[1][2*m]='S';
    mp[2*n+1][2*m]='G';
    for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) mp[2*i][2*j]='o';
    for (int i=1;i<n;i++) for (int j=1;j<m;j++) mp[2*i+1][2*j+1]='+';
    if (m>1) for (int i=1;i<=n;i++) mp[2*i][2*m-1]='|';
    t=(k-n)/2;
    for (int i=1;i<=n/2;i++) {
        if (t>0) {
            l=min(t,m-1);
            if (l<m-1) mp[4*i-2][2*m-2*l-1]='|',mp[4*i][2*m-2*l-1]='|';
            mp[4*i-2][2*m-1]='.';
            mp[4*i][2*m-1]='.';
            if (i*2<n) for (int j=m-l;j<m;j++) mp[4*i+1][2*j]='-';
            for (int j=m-l+1;j<=m;j++) mp[4*i-1][2*j]='-';
        }
        t-=m-1;
    }
    if (t>0) {
        for (int i=1;i<=t;i++) {
            mp[2*n-1][4*i-2]='.';
            mp[2*n-1][4*i]='.';
            mp[2*n-2][4*i-1]='|';
            mp[2*n][4*i+1]='|';
        }
    }
    for (int i=1;i<=2*n+1;i++) {
        for (int j=1;j<=2*m+1;j++) cout<<mp[i][j];
        cout<<endl;
    }
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:16:19: warning: writing 1 byte into a region of size 0 [-Wstringop-overflow=]
   16 |     mp[2*n+1][2*m]='G';
      |     ~~~~~~~~~~~~~~^~~~
Main.cpp:4:6: note: at offset [-2147483648, -1] into destination object ‘mp’ of size [44100, 210]
    4 | char mp[210][210];
      |      ^~

Judge Result