제출 #170239

#제출 시각아이디문제언어결과실행 시간메모리
170239bgspartanRed-blue table (IZhO19_stones)C++14
0 / 100
32 ms1508 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; const ll maxN=1001; char table[maxN][maxN]; void fillTable(ll n,ll m){ ll mod=n/2+1; if(m>1){ for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(i/mod==j){ table[i][j]='-'; }else{ table[i][j]='+'; } } } }else{ for(int i=0;i<n;i++){ table[i][0]='+'; } } } ll n[maxN],m[maxN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); ll t,ans1=0,ans2=0; cin>>t; for(int i=0;i<t;i++){ cin>>n[i]>>m[i]; } for(int i=0;i<t;i++){ ll used1=0,used2,lef1=0,lef2; lef1=m[i]-(m[i]/2+1); lef2=n[i]-(n[i]/2+1); ans1=n[i]+lef1; ans2=m[i]+lef2; // cout<<ans1<<" "<<ans2<<"\n"; if(ans1>=ans2){ fillTable(n[i],m[i]); cout<<ans1<<"\n"; for(int j=0;j<n[i];j++){ for(int h=0;h<m[i];h++){ cout<<table[j][h]; } cout<<"\n"; } }else{ fillTable(m[i],n[i]); cout<<ans2<<"\n"; for(int j=n[i]-1;j>=0;j--){ for(int h=0;h<m[i];h++){ if(table[h][j]=='-'){ cout<<"+"; }else{ cout<<"-"; } } cout<<"\n"; } } } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'int main()':
stones.cpp:34:8: warning: unused variable 'used1' [-Wunused-variable]
     ll used1=0,used2,lef1=0,lef2;
        ^~~~~
stones.cpp:34:16: warning: unused variable 'used2' [-Wunused-variable]
     ll used1=0,used2,lef1=0,lef2;
                ^~~~~
#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...