# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
340751 | 2020-12-28T10:36:09 Z | David_M | Red-blue table (IZhO19_stones) | C++14 | 1 ms | 492 KB |
#include <bits/stdc++.h> #define ll long long #define pb push_back #define F first #define S second using namespace std; const ll N=1000006; int n, m, q, o, u, e, l; string x, y, a[1001]; int main(){ios_base::sync_with_stdio(false), cin.tie(0); cin>>q; while(q--){x="";o=u=0; cin>>n>>m; for(int i=0; i<n; i++)for(int j=0; j<m; j++)a[i][j]='-'; if(n%2==1&&m%2==1){ if(n==1){cout<<m<<endl;while(m--)cout<<'-';cout<<'\n';continue;} if(m==1){cout<<n<<endl;while(n--)cout<<"+\n";continue;} cout<<n+m-2<<'\n'; for (int i=1; i<=m/2; i++)x+='-'; for (int i=1; i<=m/2+1; i++)x+='+'; for (int i=1; i<=n/2; i++)cout<<x<<'\n'; for (int i=0; i<m-1; i++)x[i]='-'; x[m-1]='+'; cout<<x<<'\n'; x=""; for (int i=1; i<=m/2; i++)x+='+'; for (int i=1; i<=m/2; i++)x+='-'; x+='+'; for (int i=1; i<=n/2; i++)cout<<x<<'\n'; } if(n%2==0&&m%2==0){ if(n<m)n--,o=1; else m--,u=1; } e=n/2, l; if(n%2==1){ if(m+4-2*n>=0)l=n-2; else l=n-3; for (int i=0; i<m; i++) for (int j=i; j<i+e; j++) a[j%l][i]='+'; cout<<m+l<<endl; for(int i=0; i<n; i++){for(int j=0; j<m; j++)cout<<a[i][j];cout<<endl;} }else{ for(int i=0; i<n; i++)for(int j=0; j<m; j++)a[i][j]='+'; if(n+4-2*m>=0)l=m-2; else l=m-3; for (int i=0; i<n; i++) for (int j=i; j<i+e; j++) a[i][j%l]='-'; } cout<<n*(m%2)+m*(n%2)+l<<endl; if(o==1)for (int i=0; i<m; i++)a[n][i]='-'; if(u==1)for (int i=0; i<n; i++)a[i][m]='+'; for(int i=0; i<n; i++){for(int j=0; j<m; j++)cout<<a[i][j];cout<<endl;} } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |