Submission #992740

#TimeUsernameProblemLanguageResultExecution timeMemory
992740simona1230Red-blue table (IZhO19_stones)C++17
0 / 100
1068 ms9748 KiB
#include <bits/stdc++.h> using namespace std; void speed() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int n,m; int ans[1024][1024]; int curr[1024][1024]; struct row { int x,l; row(){} row(int _x,int _l) { x=_x; l=_l; } bool operator<(const row&r)const { return r.l<l; } }; void solve() { cin>>n>>m; int rn=m/2+1; int cn=n/2+1; int ans_=0; for(int a=0;a<=n;a++) { priority_queue<row> q; for(int i=1;i<=a;i++) q.push({i,rn-m}); for(int i=a+1;i<=n;i++) q.push({i,-m}); int b=0; for(int j=1;j<=m;j++) { vector<row> v; bool pos=1; for(int k=1;k<=cn;k++) { if(q.size()==0) { pos=0; break; } row t=q.top(); q.pop(); t.l++; curr[t.x][j]=1; if(t.l!=0)v.push_back(t); } if(pos)b++; for(int k=0;k<v.size();k++) q.push(v[k]); } ans_=max(ans_,a+b); if(ans_==a+b) { for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { ans[i][j]=curr[i][j]; } } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { curr[i][j]=0; } } } cout<<ans_<<endl; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) if(ans[i][j]==0)cout<<"+"; else cout<<"-"; cout<<endl; } memset(ans,0,sizeof(ans)); } int main() { speed(); int t; cin>>t; while(t--) solve(); return 0; }

Compilation message (stderr)

stones.cpp: In function 'void solve()':
stones.cpp:67:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<row, std::allocator<row> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             for(int k=0;k<v.size();k++)
      |                         ~^~~~~~~~~
#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...