제출 #173458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173458		juggernaut	Red-blue table (IZhO19_stones)	C++14	100 / 100	33 ms	2296 KiB

stones

//Just try and the idea will come!
#include<bits/stdc++.h>
using namespace std;
int t,n,m,cnt[1001];
bool a[1001][1001];
int run1(){
    int res=m,i,j,last=1,cur,mid;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)a[i][j]=false,cnt[j]=n;
    for(i=1;i<=n;i++){
        cur=last;
        mid=(m>>1)+1;
        while(mid){
            if(cnt[cur]>n/2+1){
                cnt[cur]--;
                a[i][cur]=true;
                mid--;
            }
            cur++;
            if(cur==m+1)cur=1;
            if(cur==last)break;
        }
        if(mid==0)res++,last=cur;else break;
    }
    return res;
}
int run2(){
    int res=n,i,j,last=1,cur,mid;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)a[i][j]=true,cnt[i]=m;
    for(i=1;i<=m;i++){
        cur=last;
        mid=(n>>1)+1;
        while(mid){
            if(cnt[cur]>m/2+1){
                cnt[cur]--;
                a[cur][i]=false;
                mid--;
            }
            cur++;
            if(cur==n+1)cur=1;
            if(cur==last)break;
        }
        if(mid==0)res++,last=cur;else break;
    }
    return res;
}
int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        if(run1()>run2())printf("%d\n",run1());
        else printf("%d\n",run2());
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)if(a[i][j])putchar('+');
            else putchar('-');
            puts("");
        }
    }
}

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

stones.cpp: In function 'int main()':
stones.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&t);
     ~~~~~^~~~~~~~~
stones.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&n,&m);
         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31