# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286869 | 2020-08-31T06:02:17 Z | dvdg6566 | Red-blue table (IZhO19_stones) | C++14 | 33 ms | 2040 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pi; typedef vector<ll> vi; typedef vector<pi> vpi; #define pb emplace_back #define mp make_pair #define f first #define s second #define SZ(x) (int)x.size() #define ALL(x) x.begin(),x.end() #define lb lower_bound const int MAXN=1001; const ll MOD=998244353; ll A[MAXN][MAXN]; ll R,C,T; int eval(){ int ans=0; for(int i=0;i<R;++i){ int colp=0; for(int j=0;j<C;++j)if(A[i][j]==0)++colp; if(colp*2 > C)++ans; } for(int i=0;i<C;++i){ int colc=0; for(int j=0;j<R;++j)if(A[j][i])++colc; if(colc*2>R)++ans; } return ans; } int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>T; while(T--){ cin>>R>>C; if(R==1){ cout<<C<<'\n'; for(int i=0;i<C;++i)cout<<'-';cout<<'\n'; continue; }else if(C==1){ cout<<R<<'\n'; for(int i=0;i<R;++i){cout<<'+';cout<<'\n';} continue; } if(R%2==1&&C%2==1){ cout<<R+C-2<<'\n'; for(int i=0;i<C;++i)cout<<'-';cout<<'\n'; int h=C/2; for(int i=1;i<R;++i){ if(i%2==1){ cout<<'+'; for(int k=0;k<h;++k)cout<<'+'; for(int k=0;k<h;++k)cout<<'-'; }else{ cout<<'+'; for(int k=0;k<h;++k)cout<<'-'; for(int k=0;k<h;++k)cout<<'+'; } cout<<'\n'; } }else if(R%2==0&&C%2==0){ int perow=(R-2)/2; int tar= C*((R/2)-1); tar /= (C/2+1); int cur=0; for(int i=0;i<R;++i){ for(int ww=0;ww<perow;++ww){ A[i][cur] = 1; ++cur; cur%=tar; } } cout<<eval()<<'\n'; for(int i=0;i<R;++i){ for(int j=0;j<C;++j){ if(A[i][j])cout<<'-'; else cout<<'+'; } cout<<'\n'; } } // return 0; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 2 4: 2 < 4 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 512 KB | Wrong answer in test 20 2: 2 < 20 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 2 4: 2 < 4 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 1408 KB | Output is correct |
2 | Correct | 26 ms | 1276 KB | Output is correct |
3 | Correct | 25 ms | 1144 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 2040 KB | Wrong answer in test 68 68: 120 < 132 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 2 4: 2 < 4 |