Submission #405881

#TimeUsernameProblemLanguageResultExecution timeMemory
405881fadi57Red-blue table (IZhO19_stones)C++14
27 / 100
75 ms1412 KiB
#include<bits/stdc++.h> using namespace std; const int mx=1005; typedef long long ll; int inf=1e9+10; const int mod=1e9+7; ll n,m,k; vector<pair<int,int>>v; bool vis[mx]; ll ans=0; char arr[mx][mx]; int main(){ int t;cin>>t; while(t--){ cin>>n>>m; int ans; if(n>=m){ int z=(m/2);z++; ans=n+(m-z); for(int i=0;i<n;i++){ for(int j=0;j<z;j++){ arr[i][j]='+'; } for(int j=z;j<m;j++){ arr[i][j]='-'; } } } else{ int z=(n/2);z++; ans=m+(n-z); for(int i=0;i<m;i++){ for(int j=0;j<z;j++){ arr[j][i]='-'; } for(int j=z;j<m;j++){ arr[j][i]='+'; } } }cout<<ans<<"\n"; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cout<<arr[i][j]; }cout<<endl; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...